A new space for comparing graphs

ASONAM 2014 - Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Volumn , Issue , 2014, Pages 62-71

  Shrivastava, Anshumali ^a   Li, Ping ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; COVARIANCE MATRIX; GRAPHIC METHODS; LEARNING ALGORITHMS; LEARNING SYSTEMS;

ADJACENCY MATRICES; COMPUTATIONALLY EFFICIENT; MATHEMATICAL REPRESENTATIONS; MATRIX REPRESENTATION; MEASURE OF SIMILARITIES; NETWORK CLASSIFICATION; POSITIVE SEMIDEFINITE MATRICES; SIMILARITY MEASURE;

MATRIX ALGEBRA;

EID: 84911176580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2014.6921561     Document Type: Conference Paper

References (32)

1. L. A. Adamic, J. Zhang, E. Bakshy, and M. S. Ackerman. Knowledge sharing and yahoo answers: everyone knows something. In WWW, pages 665-674. ACM, 2008.
2. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. Computer networks, 33(1), 2000.
3. C.-C. Chang and C.-J. Lin. LlBSYM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2:27: 1-27:27, 20 1 1.
4. H.-H. Chen, L. Gou, X. Zhang, and C. L. Giles. CoUabseer: a search engine for collaboration discovery. In JCDL, pages 231-240. ACM, 20 1 1.
5. F. Chung, L. Lu, and V. Yu. Spectra of random graphs with given expected degrees. PNAS, 1 00(11): 63 1 3-63 1 8, 2003.
6. C. Cortes, P. Haffner, and M. Mohri. Rational kernels. In NIPS, pages 601-608, 2002.
7. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Distributed random walks. J. ACM.
8. D. Easley. Networks, crowds, and markets: Reasoning about a highly connected world, 2012.
9. I. J. Farkas, I. Derenyi, A.-L. Barabasi, and T. Yicsek. Spectra of real-world graphs: Beyond the semicircle law. Physical Review E, 64(2):026704, 2001.
10. D. Haussler. Convolution kernels o n discrete structures. Technical report, 1999.
11. J. He and W. W. Chu. A social network-based recommender system (SNRS). Springer, 2010.
12. Q. He, 1. Pei, D. Kifer, P. Mitra, and L. Giles. Context-aware citation recommendation. In WWW. ACM, 2010.
13. T. Hofmann, B. Schiilkopf, and A. J. Smola. Kernel methods i n machine learning. The annals of statistics, 2008.
14. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1 999.
15. R. Kondor and T. Jebara. A kernel between sets of vectors. In ICML, pages 36 1-368, 2003.
16. A. N. Krylov. On the numerical solution of equations whose solution determine the frequency of small vibrations of material systems (in russian (1 93 1)).
17. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In Link Mining: Models, Algorithms, and Applications, pages 337-357. Springer, 2010.
18. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1 (1):2, 2007.
19. F. Lin and W. W. Cohen. Power iteration clustering. In ICML, pages 655-662, 2010.
20. J. McAuley and J. Leskovec. Learning to discover social circles in ego networks. In NIPS, pages 548-556, 2012.
21. G. D. F. Morales, A. Gionis, and C. Lucchese. From chatter to headlines: harnessing the real-time web for personalized news recommendation. In WSDM, pages 1 53-1 62, 20 1 2.
22. M. E. Newman. The structure o f scientific collaboration networks. PNAS, 98(2):404-409, 2001.
23. I. Paparrizos, B. B. Cambazoglu, and A. Gionis. Machine learned job recommendation. In RecSys, 2011.
24. N. Shervashidze, T. Petri, K. Mehlhorn, K. M. Borgwardt, and S. Yiswanathan. Efficient graphlet kernels for large graph comparison. In AISTATS, pages 488-495, 2009.
25. A. Shrivastava and P. Li. A new mathematical space for social networks. In NIPS Workshop on Frontiers of Network Analysis: Methods, Models, and Applications, 20 1 3.
26. A. Shrivastava and P. Li. Graph kernels via functional embedding. Technical report, arXiv: 1404.5214, 2014.
27. S. H. Strogatz. Exploring complex networks. Nature, 41 0(6825):268-276, 200 1.
28. J. Ugander, L. Backstrom, and J. Kleinberg. Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In WWW, pages 1307-1318, 2013.
29. S. Yishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt. Graph kernels. JMLR, 99: 1201-1242, 2010.
30. S. Yishwanathan and A. Smola. Binet-cauchy kernels. 2004.
31. D. J. Watts and S. H. Strogatz. Collective dynamics of smallworld networks. nature, 393(6684):440-442, 1998.
32. E. P. Wigner. On the distribution of the roots of certain symmetric matrices. The Annals of Mathematics, 67(2):325-327, 1958.