A Degeneracy Framework for Graph Similarity
暂无分享,去创建一个
Michalis Vazirgiannis | Giannis Nikolentzos | Stratis Limnios | Polykarpos Meladianos | M. Vazirgiannis | Giannis Nikolentzos | Stratis Limnios | G. Nikolentzos | Polykarpos Meladianos
[1] Magyar Tudományos Akadémia. Acta mathematica Hungarica , 1983 .
[2] Devdatt P. Dubhashi,et al. Global graph kernels using geometric embeddings , 2014, ICML.
[3] Kilian Q. Weinberger,et al. Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 , 2016 .
[4] Nils M. Kriege,et al. Subgraph Matching Kernels for Attributed Graphs , 2012, ICML.
[5] Jean-Philippe Vert,et al. Graph kernels based on tree patterns for molecules , 2006, Machine Learning.
[6] David Haussler,et al. Convolution kernels on discrete structures , 1999 .
[7] Dimitrios M. Thilikos,et al. CoreCluster: A Degeneracy Based Graph Clustering Framework , 2014, AAAI.
[8] Pinar Yanardag,et al. Deep Graph Kernels , 2015, KDD.
[9] Kurt Mehlhorn,et al. Efficient graphlet kernels for large graph comparison , 2009, AISTATS.
[10] Stefan Wuchty,et al. Peeling the yeast protein network , 2005, Proteomics.
[11] D. R. Lick,et al. k-Degenerate Graphs , 1970, Canadian Journal of Mathematics.
[12] Mario Vento,et al. Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..
[13] Roman Garnett,et al. Propagation kernels: efficient graph kernels from propagated information , 2015, Machine Learning.
[14] Leland L. Beck,et al. Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.
[15] Charu C. Aggarwal,et al. Managing and Mining Graph Data , 2010, Managing and Mining Graph Data.
[16] Kurt Mehlhorn,et al. Weisfeiler-Lehman Graph Kernels , 2011, J. Mach. Learn. Res..
[17] Yannis Stavrakas,et al. Shortest-Path Graph Kernels for Document Similarity , 2017, EMNLP.
[18] Sugiyama Mahito,et al. Halting in Random Walk Kernels , 2015 .
[19] Thomas Gärtner,et al. Cyclic pattern kernels for predictive graph mining , 2004, KDD.
[20] Stephen B. Seidman,et al. Network structure and minimum degree , 1983 .
[21] Alessandro Vespignani,et al. Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.
[22] Thomas Gärtner,et al. On Graph Kernels: Hardness Results and Efficient Alternatives , 2003, COLT.
[23] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .
[24] P. Erdos,et al. On chromatic number of graphs and set-systems , 1966 .
[25] Le Song,et al. Discriminative Embeddings of Latent Variable Models for Structured Data , 2016, ICML.
[26] Charu C. Aggarwal,et al. A Survey of Algorithms for Dense Subgraph Discovery , 2010, Managing and Mining Graph Data.
[27] Bernhard Schölkopf,et al. Kernel Methods in Computational Biology , 2005 .
[28] Devdatt P. Dubhashi,et al. Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings , 2015, KDD.
[29] Hans-Peter Kriegel,et al. Shortest-path kernels on graphs , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[30] Alexander J. Smola,et al. Learning with kernels , 1998 .
[31] Risi Kondor,et al. The Multiscale Laplacian Graph Kernel , 2016, NIPS.
[32] Michalis Vazirgiannis,et al. Matching Node Embeddings for Graph Similarity , 2017, AAAI.