Acta Informatica
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
A survey of kernels for structured data
ACM SIGKDD Explorations Newsletter
Diffusion Kernels on Statistical Manifolds
The Journal of Machine Learning Research
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Protein function prediction via graph kernels
Bioinformatics
Shortest-Path Kernels on Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Nonextensive Information Theoretic Kernels on Measures
The Journal of Machine Learning Research
A history of graph entropy measures
Information Sciences: an International Journal
Improving vector space embedding of graphs through feature selection algorithms
Pattern Recognition
Weisfeiler-Lehman Graph Kernels
The Journal of Machine Learning Research
Fitting the smallest enclosing bregman ball
ECML'05 Proceedings of the 16th European conference on Machine Learning
Graph Characterization via Ihara Coefficients
IEEE Transactions on Neural Networks
Graph characterizations from von Neumann entropy
Pattern Recognition Letters
Quantifying Complexity in Networks: The von Neumann Entropy
International Journal of Agent Technologies and Systems
Graph Kernels from the Jensen-Shannon Divergence
Journal of Mathematical Imaging and Vision
Hi-index | 0.01 |
In this paper we aim to characterize graphs in terms of a structural measure of complexity. Our idea is to decompose a graph into layered substructures of increasing size, and then to measure the information content of these substructures. To locate dominant substructures within a graph, we commence by identifying a centroid vertex which has the minimum shortest path length variance to the remaining vertices. For each graph a family of centroid expansion subgraphs is derived from the centroid vertex in order to capture dominant structural characteristics of the graph. Since the centroid vertex is identified through a global analysis of the shortest path length distribution, the expansion subgraphs provide a fine representation of a graph structure. We then show how to characterize graphs using depth-based complexity traces. Here we explore two different strategies. The first strategy is to measure how the entropies on the centroid expansion subgraphs vary with the increasing size of the subgraphs. The second strategy is to measure how the entropy differences vary with the increasing size of the subgraphs. We perform graph classification in the principal component space of the complexity trace vectors. Experiments on graph datasets abstracted from some bioinformatics and computer vision databases demonstrate the effectiveness and efficiency of the proposed graph complexity traces. Our methods are competitive to state of the art methods.