It's who you know: Graph mining using recursive structural features

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

Volumn , Issue , 2011, Pages 663-671

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

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

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

Author keywords

Feature extraction; Graph mining; Identity resolution; Network classification

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA MINING; EXTRACTION; GRAPH THEORY; GRAPHIC METHODS; INFORMATION USE;

ANONYMIZATION; FEATURES EXTRACTION; GRAPH MINING; IDENTITY RESOLUTIONS; LARGE GRAPHS; MINING TASKS; NETWORK CLASSIFICATION; NETWORK TRANSFERS; REGIONAL FEATURE; STRUCTURAL FEATURE;

FEATURE EXTRACTION;

EID: 80052674771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020512     Document Type: Conference Paper

References (30)

1. L. Akoglu, M. McGlohon, and C. Faloutsos. Oddball: Spotting anomalies in weighted graphs. In PAKDD, pages 410-421, 2010.
2. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, (401):130-131, 1999.
3. A.-L. Barabasi, R. Albert, and H. Jeong. Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications, 281(1-4):69 - 77, 2000.
4. J. Blitzer, M. Dredze, and F. Pereira. Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification. In ACL, 2007.
5. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In SDM, Apr. 2004.
6. W. Dai, Q. Yang, G.-R. Xue, and Y. Yu. Boosting for transfer learning. In ICML, pages 193-200, 2007.
7. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. SIGCOMM, pages 251-262, Aug-Sept. 1999. (Pubitemid 32081870)
8. H. Fei and J. Huan. Structure feature selection for graph classification. In CIKM, pages 991-1000, 2008.
9. G. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization and identification of web communities. IEEE Computer, 35(3), Mar. 2002.
10. 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.
11. 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.
12. J. Gao, W. Fan, J. Jiang, and J. Han. Knowledge transfer via multiple model local structure mapping. In KDD, pages 283-291, 2008.
13. N. Ghamrawi and A. McCallum. Collective multi-label classification. In CIKM, pages 195-200, 2005. (Pubitemid 44022130)
14. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99:7821, 2002.
15. J. He, Y. Liu, and R. D. Lawrence. Graph-based transfer learning. In CIKM, pages 937-946, 2009.
16. 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.
17. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins. The Web as a graph: Measurements, models and methods. Lecture Notes in Computer Science, 1627:1-17, 1999.
18. X. Kong and P. S. Yu. Multi-label feature selection for graph classification. In ICDM, pages 274-283, 2010.
19. S.-I. Lee, V. Chatalbashev, D. Vickrey, and D. Koller. Learning a meta-level prior for feature relevance from multiple related tasks. In ICML, pages 489-496, 2007.
20. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD, pages 177-187, 2005. (Pubitemid 43218279)
21. R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla. New perspectives and methods in link prediction. In KDD, pages 243-252, 2010.
22. C. Liu, X. Yan, H. Yu, J. Han, and P. S. Yu. Mining behavior graphs for "backtrace" of noncrashing bugs. In SDM, 2005.
23. S. A. Macskassy and F. Provost. A simple relational classifier. In Proc. of the 2nd Workshop on Multi-Relational Data Mining (MRDM) at KDD, pages 64-76, 2003.
24. M. E. J. Newman. Power laws, Pareto distributions and Zipf's law. Contemporary Physics, 46:323-351, 2005. (Pubitemid 41335662)
25. X. Ni, J.-T. Sun, J. Hu, and Z. Chen. Cross lingual text classification by mining multilingual topics from wikipedia. In WSDM, pages 375-384, 2011.
26. C. C. Noble and D. J. Cook. Graph-based anomaly detection. In KDD, pages 631-636, 2003.
27. H. Tong, B. A. Prakash, C. E. Tsourakakis, T. Eliassi-Rad, C. Faloutsos, and D. H. Chau. On the vulnerability of large graphs. In ICDM, pages 1091-1096, 2010.
28. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2005.
29. L. Yao, S. Riedel, and A. McCallum. Collective cross-document relation extraction without labelled data. In EMNLP, pages 1013-1023, 2010.
30. J. Zhang, Z. Ghahramani, and Y. Yang. Learning multiple related tasks using latent independent component analysis. In NIPS, 2005.