A structural smoothing framework for robust graph-comparison

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 2134-2142

  Yanardag, Pinar ^a   Vishwanathan, S V N ^b  

^a Purdue University   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE;

DIAGONAL DOMINANCE; EXPERIMENTAL EVALUATION; GRAPH KERNELS; NATURAL LANGUAGE PROCESSING; SMOOTHING TECHNIQUES; STATE OF THE ART; STRUCTURAL SIMILARITY; SUB-STRUCTURES;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84965152252     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. K. M. Borgwardt and H.-P. Kriegel. Shortest-path kernels on graphs. In ICML, pages 74-81, 2005.
2. K. M. Borgwardt, C. S. Ong, S. Schönauer, S. V. N. Vishwanathan, A. J. Smola, and H.-P. Kriegel. Protein function prediction via graph kernels. In ISMB, Detroit, USA, 2005.
3. S. F. Chen and J. Goodman. An empirical study of smoothing techniques for language modeling. In ACL, pages 310-318, 1996.
4. D. Croce, A. Moschitti, and R. Basili. Structured lexical similarity via convolution kernels on dependency trees. In Proceedings of EMNLP, pages 1034-1046. Association for Computational Linguistics, 2011.
5. A. K. Debnath, R. L. Lopez de Compadre, G. Debnath, A. J. Shusterman, and C. Hansch. Structureactivity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity. J. Med. Chem, 34:786-797, 1991.
6. A. Feragen, N. Kasenburg, J. Petersen, M. de Bruijne, and K. Borgwardt. Scalable kernels for graphs with continuous attributes. In NIPS, pages 216-224, 2013.
7. T. Gärtner, P. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In COLT, pages 129-143, 2003.
8. S. Goldwater, T. Griffiths, and M. Johnson. Interpolating between types and tokens by estimating powerlaw generators. NIPS, 2006.
9. S. Goldwater, T. L. Griffiths, and M. Johnson. Producing power-law distributions and damping word frequencies with two-stage language models. JMLR, 12:2335-2382, 2011.
10. D. Haussler. Convolution kernels on discrete structures. Technical Report UCS-CRL-99-10, UC Santa Cruz, 1999.
11. J. Kandola, T. Graepel, and J. Shawe-Taylor. Reducing kernel matrix diagonal dominance using semidefinite programming. In COLT, volume 2777 of Lecture Notes in Computer Science, pages 288-302, Washington, DC, 2003.
12. R. Kneser and H. Ney. Improved backing-off for M-gram language modeling. In ICASSP, 1995.
13. B. D. McKay. Nauty user's guide (version 2.4). Australian National University, 2007.
14. M. Neumann, R. Garnett, P. Moreno, N. Patricia, and K. Kersting. Propagation kernels for partially labeled graphs. In ICML-2012 Workshop on Mining and Learning with Graphs, Edinburgh, UK, 2012.
15. H. Ney, U. Essen, and R. Kneser. On structuring probabilistic dependences in stochastic language modeling. In Computer Speech and Language, pages 1-38, 1994.
16. J. Pitman and M. Yor. The two-parameter poisson-dirichlet distribution derived from a stable subordinator. Annals of Probability, 25(2):855-900, 1997.
17. N. Przulj. Biological network comparison using graphlet degree distribution. In ECCB, 2006.
18. J. Ramon and T. Gärtner. Expressivity versus efficiency of graph kernels. Technical report, First International Workshop on Mining Graphs, Trees and Sequences (held with ECML/PKDD'03), 2003.
19. B. Schölkopf and A. J. Smola. Learning with Kernels. 2002.
20. A. Severyn and A. Moschitti. Fast support vector machines for convolution tree kernels. Data Mining and Knowledge Discovery, 25(2):325-357, 2012.
21. N. Shervashidze and K. Borgwardt. Fast subtree kernels on graphs. In NIPS, 2010.
22. N. Shervashidze, S. V. N. Vishwanathan, T. Petri, K. Mehlhorn, and K. Borgwardt. Efficient graphlet kernels for large graph comparison. In AISTATS, 2009.
23. N. Shervashidze, P. Schweitzer, E. J. Van Leeuwen, K. Mehlhorn, and K. M. Borgwardt. Weisfeilerlehman graph kernels. JMLR, 12:2539-2561, 2011.
24. A. J. Smola and R. Kondor. Kernels and regularization on graphs. In COLT, pages 144-158, 2003.
25. Y. W. Teh. A hierarchical bayesian language model based on pitman-yor processes. In ACL, 2006.
26. H. Toivonen, A. Srinivasan, R. D. King, S. Kramer, and C. Helma. Statistical evaluation of the predictive toxicology challenge 2000-2001. Bioinformatics, 19(10):1183-1193, July 2003.
27. S. V. N. Vishwanathan, N. N. Schraudolph, I. R. Kondor, and K. M. Borgwardt. Graph kernels. JMLR, 2010.
28. N. Wale, I. A. Watson, and G. Karypis. Comparison of descriptor spaces for chemical compound retrieval and classification. Knowledge and Information Systems, 14(3):347-375, 2008.
29. P. Yanardag and S. Vishwanathan. Deep graph kernels. In KDD, pages 1365-1374. ACM, 2015.
30. C. Zhai and J. Lafferty. A study of smoothing methods for language models applied to information retrieval. ACM Trans. Inf. Syst., 22(2):179-214, 2004.