Fetching the paper…
Reading the bibliography…
Graph-based methods are known to be successful in many machine learning and pattern classification tasks.
K. Mehlhorn, Graph algorithms and NP-completeness . Springer-Verlag New York, Inc., 1984
1984
Earlier work this paper cites.
J. Köbler, U. Schöning, and J. Torán, The Graph Isomorphism Problem: Its Structural Complexity . Birkhauser Verlag, 1993
1993
Earlier work this paper cites.
V. N. Vapnik, Statistical Learning Theory . Wiley, 1998
1998
Earlier work this paper cites.
C. Watkins, “Kernels from matching operations,” University of London, Computer Science Department, Tech. Rep., 1999
1999
Earlier work this paper cites.
S. Belongie, J. Malik, and J. Puzicha, “Shape matching and object recognition using shape contexts,” IEEE TPAMI , vol. 24, no. 4, pp. 509–522, 2002
2002
Earlier work this paper cites.
J. Kandola, N. Cristianini, and J. S. Shawe-taylor, “Learning semantic similarity,” in NIPS , 2002, pp. 673–680
2002
Earlier work this paper cites.
S. Belongie, J. Malik, and J. Puzicha, “Shape matching and object recognition using shape contexts,” IEEE TPAMI , vol. 24, no. 4, pp. 509–522, 2002
2002
Earlier work this paper cites.
A. Barla, F. Odone, and A. Verri, “Histogram intersection kernel for image classification,” in ICIP , 2003, pp. 513–516
2003
Earlier work this paper cites.
T. Gärtner, “A survey of kernels for structured data,” ACM SIGKDD , vol. 5, no. 1, pp. 49–58, 2003
2003
Earlier work this paper cites.
A. J. Smola and R. Kondor, “Kernels and regularization on graphs,” in COLT , 2003, pp. 144–158
2003
Earlier work this paper cites.
T. Weissman, E. Ordentlich, G. Seroussi, S. Verdu, and M. J. Weinberger, “Inequalities for the l1 deviation of the empirical distribution,” HP Labs, Palo Alto, Tech. Rep., 2003
2003
Earlier work this paper cites.
T. Caelli and S. Kosinov, “An eigenspace projection clustering method for inexact graph matching,” IEEE TPAMI , vol. 26, no. 4, pp. 515–519, 2004
2004
Earlier work this paper cites.
D. Conte, P. Foggia, C. Sansone, and M. Vento, “Thirty years of graph matching in pattern recognition,” IJPRAI , vol. 18, no. 3, pp. 265–298, 2004
2004
Earlier work this paper cites.
G. Csurka, C. Dance R., L. Fan, J. Williamowski, and C. Bray, “Visual categorization with bags of keypoints,” in SLCVW, ECCV , 2004, pp. 1–22
2004
Earlier work this paper cites.
T. Horváth, T. Gärtner, and S. Wrobel, “Cyclic pattern kernels for predictive graph mining,” in KDD , 2004, pp. 158–167
2004
Earlier work this paper cites.
K. Borgwardt and H.-P. Kriegel, “Shortest-path kernels on graphs,” in ICDM , 2005, pp. 74–81
2005
Earlier work this paper cites.
J. Lafferty and G. Lebanon, “Diffusion kernels on statistical manifolds,” JMLR , vol. 6, pp. 129–163, 2005
2005
Earlier work this paper cites.
M. J. Newman, “A measure of betweenness centrality based on random walks,” SN , vol. 27, no. 1, pp. 39–54, 2005
2005
Earlier work this paper cites.
E. Pekalska and R. P. W. Duin, The Dissimilarity Representation for Pattern Recognition: Foundations And Applications . World Scientific, USA, 2005
2005
Earlier work this paper cites.
R. Wilson, E. Hancock, and B. Luo, “Pattern vectors from algebraic graph theory,” IEEE TPAMI , vol. 27, no. 7, pp. 1112–1124, 2005
2005
Cited alongside, same era.
S. Lazebnik, C. Schmid, and J. Ponce, “Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories,” in CVPR , 2006, pp. 2169–2178
2006
Cited alongside, same era.
Z. Harchaoui and F. Bach, “Image classification with segmentation graph kernels,” in CVPR , 2007, pp. 1–8
2007
Cited alongside, same era.
H. Ling and D. Jacobs, “Shape classification using the inner-distance,” IEEE TPAMI , vol. 29, no. 2, pp. 286–299, 2007
2007
Cited alongside, same era.
M. Neuhaus and H. Bunke, Bridging the Gap Between Graph Edit Distance and Kernel Machines . World Scientific, 2007
2007
Cited alongside, same era.
O. Duchenne, A. Joulin, and J. Ponce, “A graph-matching kernel for object categorization,” in ICCV , 2011, pp. 1792–1799
2011
Later among the works it cites.
A. Sharma, R. Horaud, J. Cech, and E. Boyer, “Topologically-robust 3d shape matching based on diffusion geometry and seed growing,” in CVPR , 2011, pp. 2481–2488
2011
Later among the works it cites.
H. Bunke and K. Riesen, “Towards the unification of structural and statistical pattern recognition,” PRL , vol. 33, no. 7, pp. 811–825, 2012
2012
Later among the works it cites.
J. Gibert, E. Valveny, and H. Bunke, “Graph embedding in vector spaces by node attribute statistics,” PR , vol. 45, no. 9, pp. 3072–3083, 2012
2012
Later among the works it cites.
F. Aziz, R. Wilson, and E. Hancock, “Backtrackless walks on a graph,” IEEE TNNLS , vol. 24, no. 6, pp. 977–989, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. Pržulj, “Biological network comparison using graphlet degree distribution,” Bioinformatics , vol. 23, no. 2, p. e177, 2007
2007
Cited alongside, same era.
K. Riesen, M. Neuhaus, and H. Bunke, “Bipartite graph matching for computing the edit distance of graphs,” in GbRPR , ser. LNCS, 2007, vol. 4538, pp. 1–12
2007
Cited alongside, same era.
A. Robles-Kelly and E. R. Hancock, “A riemannian approach to graph embedding,” PR , vol. 40, no. 3, pp. 1042–1056, 2007
2007
Cited alongside, same era.
F. Comellas and J. Paz-Sánchez, “Reconstruction of networks from their betweenness centrality,” in AEC , 2008, pp. 31–37
2008
Cited alongside, same era.
K. Riesen and H. Bunke, “Iam graph database repository for graph based pattern recognition and machine learning,” in S+SSPR , 2008, pp. 287–297
2008
Cited alongside, same era.
W.-J. Lee and R. P. W. Duin, “A labelled graph based multiple classifier system,” in MCS , 2009, pp. 201–210
2009
Cited alongside, same era.
K. Riesen and H. Bunke, “Graph classification by means of lipschitz embedding,” IEEE TSMCB , vol. 39, no. 6, pp. 1472–1483, 2009
2009
Cited alongside, same era.
E. Z. Borzeshi, M. Piccardi, K. Riesen, and H. Bunke, “Discriminative prototype selection methods for graph embedding,” PR , vol. 46, no. 6, pp. 1648–1657, 2013
2013
Later among the works it cites.
N. Dahm, H. Bunke, T. Caelli, and Y. Gao, “A unified framework for strengthening topological node features and its application to subgraph isomorphism detection,” in GbRPR , 2013, pp. 11–20
2013
Later among the works it cites.
M. M. Luqman, J.-Y. Ramel, J. Lladós, and T. Brouard, “Fuzzy multilevel graph embedding,” PR , vol. 46, no. 2, pp. 551–565, 2013
2013
Later among the works it cites.
E. Saund, “A graph lattice approach to maintaining and learning dense collections of subgraphs as image features,” IEEE TPAMI , vol. 35, no. 10, pp. 2323–2339, 2013
2013
Later among the works it cites.
F. Zhou and F. De la Torre, “Deformable graph matching,” in CVPR , 2013, pp. 1–8
2013
Later among the works it cites.
P. Foggia, G. Percannella, and M. Vento, “Graph matching and learning in pattern recognition in the last 10 years,” IJPRAI , vol. 28, no. 1, pp. 1–40, 2014
2014
Later among the works it cites.
J. Lugo-Martinez and P. Radivojac, “Generalized graphlet kernels for probabilistic inference in sparse graphs,” NS , vol. 2, no. 2, p. 254–276, 2014
2014
Later among the works it cites.
B. D. McKay and A. Piperno, “Practical graph isomorphism, ii,” JSC , vol. 60, pp. 94 – 112, 2014
2014
Later among the works it cites.
B. Wu, C. Yuan, and W. Hu, “Human action recognition based on context-dependent graph kernels,” in CVPR , 2014, pp. 2609–2616
2014
Later among the works it cites.
R. Kondor and H. Pan, “The multiscale laplacian graph kernel,” in NIPS , 2016, pp. 2982–2990
2016
Later among the works it cites.
S. F. Mousavi, M. Safayani, A. Mirzaei, and H. Bahonar, “Hierarchical graph embedding in vector space by graph pyramid,” PR , vol. 61, pp. 245–254, 2017
2017
Closest in time.
A. Dutta and H. Sahbi, “Supplemental material: Stochastic graphlet embedding,” IEEE TNNLS , pp. 1–4, 2018
2018
Closest in time.
A. Dutta and H. Sahbi, “Stochastic graphlet embedding,” IEEE TNNLS , pp. 1–14, 2018
2018
Closest in time.