Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Digger

Digger People participate in multiple online social networks, e.g., Facebook, Twitter, and Linkedin, and these social networks with heterogeneous social content and user relationship are named as heterogeneous social networks. Group structure widely exists in heterogeneous social networks, which reveals the evolution of human cooperation. Detecting similar groups in heterogeneous networks has a great significance for many applications, such as recommendation system and spammer detection, using the wealth of group information. Although promising, this novel problem encounters a variety of technical challenges, including incomplete data, high time complexity, and ground truth. To address the research gap and technical challenges, we take advantage of a ratio-cut optimization function to model this novel problem by the linear mixed-effects method and graph spectral theory. Based on this model, we propose an efficient algorithm called Digger to detect the similar groups in the large graphs. Digger consists of three steps, including measuring user similarity, construct a matching graph, and detecting similar groups. We adopt several strategies to lower the computational cost and detail the basis of labeling the ground truth. We evaluate the effectiveness and efficiency of our algorithm on five different types of online social networks. The extensive experiments show that our method achieves 0.693, 0.783, and 0.735 in precision, recall, and F1-measure, which significantly surpass the state-of-arts by 24.4%, 15.3%, and 20.7%, respectively. The results demonstrate that our proposal can detect similar groups in heterogeneous networks effectively. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Knowledge Discovery from Data (TKDD) Association for Computing Machinery

Digger

Download PDF
27 pages

Loading next page...
 
/lp/association-for-computing-machinery/digger-nbSQTj64tH
Publisher
Association for Computing Machinery
Copyright
Copyright © 2018 ACM
ISSN
1556-4681
eISSN
1556-472X
DOI
10.1145/3267106
Publisher site
See Article on Publisher Site

Abstract

People participate in multiple online social networks, e.g., Facebook, Twitter, and Linkedin, and these social networks with heterogeneous social content and user relationship are named as heterogeneous social networks. Group structure widely exists in heterogeneous social networks, which reveals the evolution of human cooperation. Detecting similar groups in heterogeneous networks has a great significance for many applications, such as recommendation system and spammer detection, using the wealth of group information. Although promising, this novel problem encounters a variety of technical challenges, including incomplete data, high time complexity, and ground truth. To address the research gap and technical challenges, we take advantage of a ratio-cut optimization function to model this novel problem by the linear mixed-effects method and graph spectral theory. Based on this model, we propose an efficient algorithm called Digger to detect the similar groups in the large graphs. Digger consists of three steps, including measuring user similarity, construct a matching graph, and detecting similar groups. We adopt several strategies to lower the computational cost and detail the basis of labeling the ground truth. We evaluate the effectiveness and efficiency of our algorithm on five different types of online social networks. The extensive experiments show that our method achieves 0.693, 0.783, and 0.735 in precision, recall, and F1-measure, which significantly surpass the state-of-arts by 24.4%, 15.3%, and 20.7%, respectively. The results demonstrate that our proposal can detect similar groups in heterogeneous networks effectively.

Journal

ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery

Published: Dec 19, 2018

Keywords: Heterogeneous networks

References

  • Description-oriented community detection using exhaustive subgroup discovery
    Atzmueller, Martin; Doerfel, Stephan; Mitzlaff, Folke
  • Complex networks: Structure and dynamics
    Boccaletti, Stefano; Latora, Vito; Moreno, Yamir; Chavez, Martin; Hwang, D.-U.
  • Classification and Regression Trees
    Breiman, Leo
  • A game-theoretic framework to identify overlapping communities in social networks
    Chen, Wei; Liu, Zhenming; Sun, Xiaorui; Wang, Yajun
  • Detecting opinion spammer groups through community discovery and sentiment analysis
    Choo, Euijin; Yu, Ting; Chi, Min
  • Finding community structure in very large networks
    Clauset, Aaron; Newman, Mark E. J.; Moore, Cristopher
  • MapReduce: Simplified data processing on large clusters
    Dean, Jeffrey; Ghemawat, Sanjay
  • Fast linear algebra is stable
    Demmel, James; Dumitriu, Ioana; Holtz, Olga
  • Community detection in graphs
    Fortunato, Santo
  • Cooperative behavior cascades in human social networks
    Fowler, James H.; Christakis, Nicholas A.
  • The rectilinear Steiner tree problem is NP-complete
    Garey, Michael R.; Johnson, David S.
  • Defining and discovering communities in social networks
    Kelley, Stephen; Goldberg, Mark; Magdon-Ismail, Malik; Mertsalov, Konstantin; Wallace, Al
  • The link-prediction problem for social networks
    Liben-Nowell, David; Kleinberg, Jon
  • Common visual pattern discovery via spatially coherent correspondences
    Liu, Hairong; Yan, Shuicheng
  • A common subgraph correspondence mining framework for map search services
    Liu, Wu; Zhu, Lingheng; Chu, Lingyang; Ma, Huadong
  • A feasible graph partition framework for parallel computing of big graph
    Liu, Xiaoming; Zhou, Yadong; Guan, Xiaohong; Shen, Chao
  • MIRACLE: A multiple independent random walks community parallel detection algorithm for big graphs
    Liu, Xiaoming; Zhou, Yadong; Hu, Chengchen; Guan, Xiaohong
  • Detecting community structure for undirected big graphs based on random walks
    Liu, Xiaoming; Zhou, Yadong; Hu, Chengchen; Guan, Xiaohong; Leng, Junyuan
  • Generalized Linear Mixed Models
    McCulloch, Charles E.; Neuhaus, John M.
  • Spotting fake reviewer groups in consumer reviews
    Mukherjee, Arjun; Liu, Bing; Glance, Natalie
  • Modularity and community structure in networks
    Newman, Mark E. J.
  • The PageRank Citation Ranking: Bringing Order to the Web
    Page, Lawrence; Brin, Sergey; Motwani, Rajeev; Winograd, Terry
  • How unique and traceable are usernames? In Proceedings of the International Symposium on Privacy Enhancing Technologies Symposium
    Perito, Daniele; Castelluccia, Claude; Kaafar, Mohamed Ali; Manils, Pere
  • Computing communities in large networks using random walks
    Pons, Pascal; Latapy, Matthieu
  • Term-weighting approaches in automatic text retrieval
    Salton, Gerard; Buckley, Christopher
  • Hetesim: A general framework for relevance measure in heterogeneous networks
    Shi, Chuan; Kong, Xiangnan; Huang, Yue; Philip, S. Yu; Wu, Bin
  • A survey of heterogeneous information network analysis
    Shi, Chuan; Li, Yitong; Zhang, Jiawei; Sun, Yizhou; Philip, S. Yu
  • HeteRecom: A semantic-based recommendation system in heterogeneous networks
    Shi, Chuan; Zhou, Chong; Kong, Xiangnan; Yu, Philip S.; Liu, Gang; Wang, Bai
  • Pathsim: Meta path-based top-k similarity search in heterogeneous information networks
    Sun, Yizhou; Han, Jiawei; Yan, Xifeng; Yu, Philip S.; Wu, Tianyi
  • Estimating the number of clusters in a data set via the gap statistic
    Tibshirani, Robert; Walther, Guenther; Hastie, Trevor
  • A tutorial on spectral clustering
    Von Luxburg, Ulrike
  • Toward understanding the cliques of opinion spammers with social network analysis
    Wang, Chih-Chien; Day, Min-Yuh; Lin, Yu-Ruei
  • Collaborative co-clustering across multiple social media
    Wang, Fengjiao; Lin, Shuyang; Philip, S. Yu
  • Top-k similarity join in heterogeneous information networks
    Xiong, Yun; Zhu, Yangyong; Philip, S. Yu
  • A comparative study on feature selection in text categorization
    Yang, Yiming; Pedersen, Jan O.
  • Community detection in networks with unequal groups
    Zhang, Pan; Moore, Cristopher; Newman, M. E. J.
  • Transient community detection and its application to data forwarding in delay tolerant networks
    Zhang, Xiaomei; Cao, Guohong
  • Cosnet: Connecting heterogeneous social networks with local and global consistency
    Zhang, Yutao; Tang, Jie; Yang, Zhilin; Pei, Jian; Yu, Philip S.
  • Inferring social roles and statuses in social networks
    Zhao, Yuchen; Wang, Guan; Yu, Philip S.; Liu, Shaobo; Zhang, Simon