Using Cliques with Higher-order Spectral Embeddings Improves Graph Visualizations.
Huda NassarCaitlin KennedyShweta JainAustin R. BensonDavid F. GleichPublished in: WWW (2020)
Keyphrases
- higher order
- graph structure
- weighted graph
- graph theory
- maximal cliques
- random walk
- higher order cliques
- higher order relations
- laplacian matrix
- graph representation
- spectral decomposition
- high order
- maximum clique
- directed graph
- pairwise
- bipartite graph
- normalized cut
- natural images
- markov random field
- spectral analysis
- spectral methods
- low dimensional
- graph theoretic
- graph model
- manifold learning
- graph matching
- structured data
- high dimensional
- distance measure
- visualization tools
- graph laplacian
- connected components
- graph databases
- data visualization
- euclidean space
- functional modules
- vector space
- high dimensional data
- bayesian networks