RolX: Structural role extraction & mining in large graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1231-1239

  Henderson, Keith ^a   Gallagher, Brian ^a   Eliassi Rad, Tina ^b   Tong, Hanghang ^c   Basu, Sugato ^d   Akoglu, Leman ^e   Koutra, Danai ^e   Faloutsos, Christos ^e   Li, Lei ^e  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d GOOGLE INC   (United States)

^e CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

graph mining; network classification; sense making; similarity search; structural role discovery

Indexed keywords

GRAPH MINING; NETWORK CLASSIFICATION; SENSEMAKING; SIMILARITY SEARCH; STRUCTURAL ROLE DISCOVERY;

DATA MINING;

EID: 84866016454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339723     Document Type: Conference Paper

References (30)

1. H. Akaike. Information theory and an extension of the maximum likelihood principle. In Proc. of the 2nd Int'l Symp. on Information Theory, pages 267-281, 1972.
2. L. Akoglu, M. McGlohon, and C. Faloutsos. Oddball: Spotting anomalies in weighted graphs. In PAKDD, pages 410-421, 2010.
3. I. Bhattacharya, S. Godbole, S. Joshi, and A. Verma. Cross-guided clustering: Transfer of relevant supervision across domains for improved clustering. In ICDM, pages 41-50, 2009.
4. D. Cai, C. Zhang, and X. He. Unsupervised feature selection for multi-cluster data. In KDD, pages 333-342, 2010.
5. B. Cao, N. Liu, and Q. Yang. Transfer learning for collective link prediction in multiple heterogenous domains. In ICML, pages 159-166, 2010.
6. A. Clauset, M. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E, 70:066111, 2004.
7. W. Dai, O. Jin, G.-R. Xue, Q. Yang, and Y. Yu. Eigentransfer: a unified framework for transfer learning. In ICML, pages 193-200, 2009.
8. I. S. Dhillon and S. Sra. Generalized nonnegative matrix approximations with Bregman divergences. In NIPS, pages 283-290, 2005.
9. N. Eagle, A. Pentland, and D. Lazer. Inferring social network structure using mobile phone data. PNAS, 106(36):15274-15278, 2009.
10. J. Eggert and E. Korner. Sparse coding and NMF. In IJCNN, pages 2529-2533, 2004.
11. H. Fürstenau and M. Lapata. Semi-supervised semantic role labeling. In EACL, pages 220-228, 2009.
12. B. Gallagher and T. Eliassi-Rad. Leveraging label-independent features for classification in sparsely labeled networks: An empirical study. Lecture Notes in Computer Science, 5498:1-19, 2010.
13. B. Gallagher, H. Tong, T. Eliassi-Rad, and C. Faloutsos. Using ghost edges for classification in sparsely labeled networks. In KDD, pages 256-264, 2008.
14. K. Henderson, T. Eliassi-Rad, C. Faloutsos, L. Akoglu, L. Li, K. Maruhashi, B. A. Prakash, and H. Tong. Metric forensics: A multi-level approach for mining volatile graphs. In KDD, pages 163-172, 2010.
15. K. Henderson, B. Gallagher, L. Li, L. Akoglu, T. Eliassi-Rad, H. Tong, and C. Faloutsos. It's who you know: Graph mining using recursive structural features. In KDD, pages 663-671, 2011.
16. M. Herbster. Exploiting cluster-structure to predict the labeling of a graph. In ALT, pages 54-69, 2008.
17. D. Huffman. A method for the construction of minimum-redundancy codes. In Proc. of the IRE, pages 1098-1101, 1952.
18. D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755):788-791, 1999.
19. R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla. New perspectives and methods in link prediction. In KDD, pages 243-252, 2010.
20. C.-J. Lin. Projected Gradient Methods for Nonnegative Matrix Factorization. Neural Computation, 19(10):2756-2779, 2007.
21. S. P. Lloyd. Least squares quantization in PCM. IEEE Trans. on Info. Theory, IT-28(2):129-137, 1982.
22. J. Max. Quantizing for minimum distortion. IRE Trans. on Information Theory, IT-6:7-12, 1960.
23. A. Mccallum, X. Wang, and A. Corrada-Emmanuel. Topic and role discovery in social networks with experiments on enron and academic email. JAIR, 30(1):249-272, 2007.
24. I. Molloy, N. Li, T. Li, Z. Mao, Q. Wang, and J. Lobo. Evaluating role mining algorithms. In SACMAT, pages 95-104, 2009.
25. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E., 74:036104, 2006.
26. A. F. Patrick Doreian, Vladimir Batagelj. Generalized Blockmodeling. Cambridge University Press, 2005.
27. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
28. M. Somaiya, C. Jermaine, and S. Ranka. Mixture models for learning low-dimensional roles in high-dimensional data. In KDD, pages 909-918, 2010.
29. Z. Wang, Y. Song, and C. Zhang. Knowledge transfer on hybrid graph. In IJCAI, pages 1291-1296, 2009.
30. J. Weston, C. Leslie, E. Ie, D. Zhou, A. Elisseeff, and W. S. Noble. Semi-supervised protein classification using cluster kernels. Bioinformatics, 21:3241-3247, 2005.