node2bits: Compact Time- and Attribute-aware Node Representations for User Stitching
Not on the map. Why?
Abstract (arXiv)
Identity stitching, the task of identifying and matching various online references (e.g., sessions over different devices and timespans) to the same user in real-world web services, is crucial for personalization and recommendations. However, traditional user stitching approaches, such as grouping or blocking, require quadratic pairwise comparisons between a massive number of user activities, thus posing both computational and storage challenges. Recent works, which are often application-specific, heuristically seek to reduce the amount of comparisons, but they suffer from low precision and recall. To solve the problem in an application-independent way, we take a heterogeneous network-based approach in which users (nodes) interact with content (e.g., sessions, websites), and may have attributes (e.g., location). We propose node2bits, an efficient framework that represents multi-dimensional features of node contexts with binary hashcodes. node2bits leverages feature-based temporal walks to encapsulate short- and long-term interactions between nodes in heterogeneous web networks, and adopts SimHash to obtain compact, binary representations and avoid the quadratic complexity for similarity search. Extensive experiments on large-scale real networks show that node2bits outperforms traditional techniques and existing works that generate real-valued embeddings by up to 5.16% in F1 score on user stitching, while taking only up to 1.56% as much storage.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 2.
8 papers.
- 2021Deep Transfer Learning for Multi-source Entity Linkage via Domain Adaptationcited by 7
- 2022MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learningcited by 6
- 2021A Survey on Role-Oriented Network Embeddingcited by 4
- 2024Efficient Network Embedding by Approximate Equitable Partitionscited by 2
- 2022Representation Learning on Heterostructures via Heterogeneous Anonymous Walkscited by 1
- 2022Privacy Aware Experiments without Cookiescited by 1
- 2023From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphscited by 1
- 2024Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphscited by 0
- 2024Efficient Network Embedding by Approximate Equitable Partitions16 Sep 2024
- 2024Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs10 Jul 2024
- 2023From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs17 Jul 2023
- 2022Privacy Aware Experiments without Cookies3 Nov 2022
- 2022MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning18 Jun 2022
- 2022Representation Learning on Heterostructures via Heterogeneous Anonymous Walks18 Jan 2022
- 2021Deep Transfer Learning for Multi-source Entity Linkage via Domain Adaptation27 Oct 2021
- 2021A Survey on Role-Oriented Network Embedding18 Jul 2021