Depth-based hypergraph complexity traces from directed line graphs
From MaRDI portal
Publication:2416965
DOI10.1016/j.patcog.2016.01.004zbMath1412.68179OpenAlexW2303006504WikidataQ60430845 ScholiaQ60430845MaRDI QIDQ2416965
Edwin R. Hancock, Lu Bai, F. Escolano
Publication date: 27 May 2019
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/53435
Learning and adaptive systems in artificial intelligence (68T05) Hypergraphs (05C65) Measures of information, entropy (94A17) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
Graph characterization by counting sink star subgraphs ⋮ A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework ⋮ Adaptive Feature Selection Based on the Most Informative Graph-Based Features ⋮ Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection ⋮ A New Entropy for Hypergraphs
Cites Work
- Graph kernels from the Jensen-Shannon divergence
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
- A history of graph entropy measures
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- The zeta function of a hypergraph
- Depth-based complexity traces of graphs
- Information processing in complex networks: Graph entropy and information functionals
- Laplacians and the Cheeger inequality for directed graphs
- Chromatic number and the 2-rank of a graph
- Measures of statistical complexity: why?
- Graph characteristics from the heat kernel trace
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Effective graph classification based on topological and label attributes
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
This page was built for publication: Depth-based hypergraph complexity traces from directed line graphs
