A hierarchy tree data structure for behavior-based user segment representation

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liu, Yang, Kang, Xuejiao, Iyer, Sathya, Malik, Idris, Li, Ruixuan, Wang, Juan, Lu, Xinchen, Zhao, Xiangxue, Wang, Dayong, Liu, Menghan, Liu, Isaac, Liang, Feng, Yu, Yinzhe
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910030706507776
author Liu, Yang
Kang, Xuejiao
Iyer, Sathya
Malik, Idris
Li, Ruixuan
Wang, Juan
Lu, Xinchen
Zhao, Xiangxue
Wang, Dayong
Liu, Menghan
Liu, Isaac
Liang, Feng
Yu, Yinzhe
author_facet Liu, Yang
Kang, Xuejiao
Iyer, Sathya
Malik, Idris
Li, Ruixuan
Wang, Juan
Lu, Xinchen
Zhao, Xiangxue
Wang, Dayong
Liu, Menghan
Liu, Isaac
Liang, Feng
Yu, Yinzhe
contents User attributes are essential in multiple stages of modern recommendation systems and are particularly important for mitigating the cold-start problem and improving the experience of new or infrequent users. We propose Behavior-based User Segmentation (BUS), a novel tree-based data structure that hierarchically segments the user universe with various users' categorical attributes based on the users' product-specific engagement behaviors. During the BUS tree construction, we use Normalized Discounted Cumulative Gain (NDCG) as the objective function to maximize the behavioral representativeness of marginal users relative to active users in the same segment. The constructed BUS tree undergoes further processing and aggregation across the leaf nodes and internal nodes, allowing the generation of popular social content and behavioral patterns for each node in the tree. To further mitigate bias and improve fairness, we use the social graph to derive the user's connection-based BUS segments, enabling the combination of behavioral patterns extracted from both the user's own segment and connection-based segments as the connection aware BUS-based recommendation. Our offline analysis shows that the BUS-based retrieval significantly outperforms traditional user cohort-based aggregation on ranking quality. We have successfully deployed our data structure and machine learning algorithm and tested it with various production traffic serving billions of users daily, achieving statistically significant improvements in the online product metrics, including music ranking and email notifications. To the best of our knowledge, our study represents the first list-wise learning-to-rank framework for tree-based recommendation that effectively integrates diverse user categorical attributes while preserving real-world semantic interpretability at a large industrial scale.
format Preprint
id arxiv_https___arxiv_org_abs_2508_01115
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A hierarchy tree data structure for behavior-based user segment representation
Liu, Yang
Kang, Xuejiao
Iyer, Sathya
Malik, Idris
Li, Ruixuan
Wang, Juan
Lu, Xinchen
Zhao, Xiangxue
Wang, Dayong
Liu, Menghan
Liu, Isaac
Liang, Feng
Yu, Yinzhe
Machine Learning
User attributes are essential in multiple stages of modern recommendation systems and are particularly important for mitigating the cold-start problem and improving the experience of new or infrequent users. We propose Behavior-based User Segmentation (BUS), a novel tree-based data structure that hierarchically segments the user universe with various users' categorical attributes based on the users' product-specific engagement behaviors. During the BUS tree construction, we use Normalized Discounted Cumulative Gain (NDCG) as the objective function to maximize the behavioral representativeness of marginal users relative to active users in the same segment. The constructed BUS tree undergoes further processing and aggregation across the leaf nodes and internal nodes, allowing the generation of popular social content and behavioral patterns for each node in the tree. To further mitigate bias and improve fairness, we use the social graph to derive the user's connection-based BUS segments, enabling the combination of behavioral patterns extracted from both the user's own segment and connection-based segments as the connection aware BUS-based recommendation. Our offline analysis shows that the BUS-based retrieval significantly outperforms traditional user cohort-based aggregation on ranking quality. We have successfully deployed our data structure and machine learning algorithm and tested it with various production traffic serving billions of users daily, achieving statistically significant improvements in the online product metrics, including music ranking and email notifications. To the best of our knowledge, our study represents the first list-wise learning-to-rank framework for tree-based recommendation that effectively integrates diverse user categorical attributes while preserving real-world semantic interpretability at a large industrial scale.
title A hierarchy tree data structure for behavior-based user segment representation
topic Machine Learning
url https://arxiv.org/abs/2508.01115