{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:55:01Z","timestamp":1769925301157,"version":"3.49.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72371241, 72171229, 62172014, 62172015, 62272009"],"award-info":[{"award-number":["72371241, 72171229, 62172014, 62172015, 62272009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Renmin University of China, Chinese National Statistical Science Research","award":["2022LD06"],"award-info":[{"award-number":["2022LD06"]}]},{"name":"Foundation from Ministry of Education of China","award":["20JZD023"],"award-info":[{"award-number":["20JZD023"]}]},{"name":"MOE Project of Key Research Institute of Humanities and Social Sciences","award":["22JJD110001"],"award-info":[{"award-number":["22JJD110001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,7,31]]},"abstract":"<jats:p>There is an emerging trend in the Chinese automobile industries that automakers are introducing exclusive enterprise social networks (EESNs) to expand sales and provide after-sale services. The traditional online social networks (OSNs) and enterprise social networks (ESNs), such as X (formerly known as Twitter) and Yammer, are ingeniously designed to facilitate unregulated communications among equal individuals. However, users in EESNs are naturally social stratified, consisting of both enterprise staffs and customers. In addition, the motivation to operate EESNs can be quite complicated, including providing customer services and facilitating communication among enterprise staffs. As a result, the social behaviors in EESNs can be quite different from those in OSNs and ESNs. In this work, we aim to analyze the social behaviors in EESNs. We consider the Chinese car manufacturer NIO as a typical example of EESNs and provide the following contributions. First, we formulate the social behavior analysis in EESNs as a link prediction problem in heterogeneous social networks. Second, to analyze this link prediction problem, we derive plentiful user features and build multiple meta-path graphs for EESNs. Third, we develop a novel Fast (H)eterogeneous graph (A)ttention (N)etwork algorithm for (D)irected graphs (FastHAND) to predict directed social links among users in EESNs. This algorithm introduces feature group attention at the node-level and uses an edge sampling algorithm over directed meta-path graphs to reduce the computation cost. By conducting various experiments on the NIO community data, we demonstrate the predictive power of our proposed FastHAND method. The experimental results also verify our intuitions about social affinity propagation in EESNs.<\/jats:p>","DOI":"10.1145\/3646552","type":"journal-article","created":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T11:59:21Z","timestamp":1707739161000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Social Behavior Analysis in Exclusive Enterprise Social Networks by FastHAND"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8857-3679","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"first","affiliation":[{"name":"Defense Innovation Institute, Chinese Academy of Military Science, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8260-2053","authenticated-orcid":false,"given":"Feifei","family":"Wang","sequence":"additional","affiliation":[{"name":"Center for Applied Statistics and School of Statistics, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5245-7905","authenticated-orcid":false,"given":"Enqiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6954-0067","authenticated-orcid":false,"given":"Fei","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Electronics Engineering and Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5224-9834","authenticated-orcid":false,"given":"Wen","family":"Yao","sequence":"additional","affiliation":[{"name":"Defense Innovation Institute, Chinese Academy of Military Science, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/CBI.2015.29"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623733"},{"key":"e_1_3_3_4_2","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"Blei David M.","year":"2003","unstructured":"David M. Blei, Andrew Y. Ng, and Michael I. Jordan. 2003. Latent Dirichlet allocation. Journal of Machine Learning Research 3, Jan. (2003), 993\u20131022.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2015.04.005"},{"key":"e_1_3_3_6_2","first-page":"2434","volume-title":"International Conference on Machine Learning","author":"Grover Aditya","year":"2019","unstructured":"Aditya Grover, Aaron Zweig, and Stefano Ermon. 2019. Graphite: Iterative generative modeling of graphs. In International Conference on Machine Learning. PMLR, 2434\u20132444."},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11892"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357990"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2018.07.033"},{"key":"e_1_3_3_10_2","article-title":"Variational graph auto-encoders","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational graph auto-encoders. NIPS Workshop on Bayesian Deep Learning (2016).","journal-title":"NIPS Workshop on Bayesian Deep Learning"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47426-3_22"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/772"},{"key":"e_1_3_3_13_2","article-title":"Link prediction algorithm based on the initial information contribution of nodes","author":"Liu Yingjie","year":"2022","unstructured":"Yingjie Liu, Shihu Liu, Fusheng Yu, and Xiyang Yang. 2022. Link prediction algorithm based on the initial information contribution of nodes. Information Sciences (2022).","journal-title":"Information Sciences"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272010"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3012704"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/3304889.3305023"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380750"},{"key":"e_1_3_3_19_2","volume-title":"International Conference on Learning Representations","author":"Rong Yu","year":"2020","unstructured":"Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2020. DropEdge: Towards deep graph convolutional networks on node classification. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Hkx1qkrKPr"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/3367471.3367507"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358023"},{"key":"e_1_3_3_22_2","article-title":"Fast graph attention networks using effective resistance based graph sparsification","author":"Srinivasa Rakshith S.","year":"2020","unstructured":"Rakshith S. Srinivasa, Cao Xiao, Lucas Glass, Justin Romberg, and Jimeng Sun. 2020. Fast graph attention networks using effective resistance based graph sparsification. arXiv preprint arXiv:2006.08796 (2020).","journal-title":"arXiv preprint arXiv:2006.08796"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2481244.2481248"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.09.001"},{"key":"e_1_3_3_25_2","volume-title":"J. International Conference on Learning Representations (ICLR 2017)","author":"Welling Max","year":"2016","unstructured":"Max Welling and Thomas N. Kipf. 2016. Semi-supervised classification with graph convolutional networks. In J. International Conference on Learning Representations (ICLR 2017)."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487607"},{"key":"e_1_3_3_27_2","first-page":"2048","volume-title":"International Conference on Machine Learning","author":"Xu Kelvin","year":"2015","unstructured":"Kelvin Xu, Jimmy Ba, Ryan Kiros, Kyunghyun Cho, Aaron Courville, Ruslan Salakhudinov, Rich Zemel, and Yoshua Bengio. 2015. Show, attend and tell: Neural image caption generation with visual attention. In International Conference on Machine Learning. PMLR, 2048\u20132057."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.58"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488514"},{"issue":"1","key":"e_1_3_3_30_2","first-page":"905","article-title":"Sparse graph attention networks","volume":"35","author":"Ye Yang","year":"2021","unstructured":"Yang Ye and Shihao Ji. 2021. Sparse graph attention networks. IEEE Transactions on Knowledge and Data Engineering 35, 1 (2021), 905\u2013916.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1177\/0093650208330254"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2481978"},{"key":"e_1_3_3_33_2","first-page":"13683","article-title":"Neo-GNNs: Neighborhood overlap-aware graph neural networks for link prediction","volume":"34","author":"Yun Seongjun","year":"2021","unstructured":"Seongjun Yun, Seoyoon Kim, Junhyun Lee, Jaewoo Kang, and Hyunwoo J. Kim. 2021. Neo-GNNs: Neighborhood overlap-aware graph neural networks for link prediction. Advances in Neural Information Processing Systems 34 (2021), 13683\u201313694.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806549"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783266"},{"key":"e_1_3_3_36_2","article-title":"Link prediction based on graph neural networks","volume":"31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in Neural Information Processing Systems 31 (2018).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"e_1_3_3_38_2","first-page":"11458","volume-title":"International Conference on Machine Learning","author":"Zheng Cheng","year":"2020","unstructured":"Cheng Zheng, Bo Zong, Wei Cheng, Dongjin Song, Jingchao Ni, Wenchao Yu, Haifeng Chen, and Wei Wang. 2020. Robust graph representation learning via neural sparsification. In International Conference on Machine Learning. PMLR, 11458\u201311468."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10878"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3646552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3646552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:41Z","timestamp":1750295861000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3646552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,12]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,7,31]]}},"alternative-id":["10.1145\/3646552"],"URL":"https:\/\/doi.org\/10.1145\/3646552","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,12]]},"assertion":[{"value":"2023-01-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}