Clustering social audiences in business information networks

被引:21
作者
Zheng, Yu [1 ]
Hu, Ruiqi [2 ]
Fung, Sai-fu [3 ]
Yu, Celina [4 ]
Long, Guodong [2 ]
Guo, Ting [5 ]
Pan, Shirui [1 ]
机构
[1] Monash Univ, Fac Informat Technol, Clayton, Vic 3800, Australia
[2] Univ Technol Sydney, Ctr Artificial Intelligence, Sydney, NSW 2007, Australia
[3] City Univ Hong Kong, Dept Appl Social Sci, Hong Kong, Peoples R China
[4] Global Business Coll Australia, Melbourne, Vic, Australia
[5] Univ Technol Sydney, Sydney, NSW 2007, Australia
基金
澳大利亚研究理事会;
关键词
Machine learning; Clustering; Business information networks; Social networks; NONNEGATIVE MATRIX FACTORIZATION; ALGORITHMS;
D O I
10.1016/j.patcog.2019.107126
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Business information networks involve diverse users and rich content and have emerged as important platforms for enabling business intelligence and business decision making. A key step in an organizations business intelligence process is to cluster users with similar interests into social audiences and discover the roles they play within a business network. In this article, we propose a novel machine-learning approach, called CBIN, that co-clusters business information networks to discover and understand these audiences. The CBIN framework is based on co-factorization. The audience clusters are discovered from a combination of network structures and rich contextual information, such as node interactions and node-content correlations. Since what defines an audience cluster is data-driven, plus they often overlap, predetermining the number of clusters is usually very difficult. Therefore, we have based CBIN on an overlapping clustering paradigm with a hold-out strategy to discover the optimal number of clusters given the underlying data. Experiments validate an outstanding performance by CBIN compared to other state-of-the-art algorithms on 13 real-world enterprise datasets. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:12
相关论文
共 38 条
[1]  
[Anonymous], 2009, THESIS
[2]  
Baird Carolyn Heller, 2011, Strategy & Leadership, V39, P30, DOI 10.1108/10878571111161507
[3]  
Balasubramanyan R., 2011, P 2011 SIAM INT C DA, P450, DOI DOI 10.1137/1.9781611972818.39
[4]  
Butow Eric., 2008, How to Succeed in Business Using LinkedIn: Making Connections and Capturing Opportunities on the World's# 1 Business Networking Site
[5]   Non-negative Matrix Factorization on Manifold [J].
Cai, Deng ;
He, Xiaofei ;
Wu, Xiaoyun ;
Han, Jiawei .
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, :63-+
[6]   Greedy discrete particle swarm optimization for large-scale social network clustering [J].
Cai, Qing ;
Gong, Maoguo ;
Ma, Lijia ;
Ruan, Shasha ;
Yuan, Fuyan ;
Jiao, Licheng .
INFORMATION SCIENCES, 2015, 316 :503-516
[7]  
Chen YW, 2006, STUD FUZZ SOFT COMP, V207, P315
[8]   Convex and Semi-Nonnegative Matrix Factorizations [J].
Ding, Chris ;
Li, Tao ;
Jordan, Michael I. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (01) :45-55
[9]  
Drury G., 2008, J DIRECT DATA DIGITA, V9, P274, DOI [10.1057/palgrave.dddmp.4350096., DOI 10.1057/PALGRAVE.DDDMP.4350096]
[10]   Graph embedding in vector spaces by node attribute statistics [J].
Gibert, Jaume ;
Valveny, Ernest ;
Bunke, Horst .
PATTERN RECOGNITION, 2012, 45 (09) :3072-3083