Cliques in High-Dimensional Random Geometric Graphs.
Konstantin AvrachenkovAndrei BobuPublished in: COMPLEX NETWORKS (1) (2019)
Keyphrases
- high dimensional
- maximal cliques
- graph structure
- weighted graph
- maximum clique
- graph theoretical
- dimensionality reduction
- graph theory
- low dimensional
- graph theoretic
- high dimensionality
- graph matching
- bipartite graph
- random graphs
- sparse data
- noisy data
- parameter space
- similarity search
- data points
- variable selection
- multi dimensional
- graph model
- topological information
- nearest neighbor
- graph representation
- graph partitioning
- graph mining
- random variables
- undirected graph
- geometric information
- spanning tree
- probabilistic model
- high dimensional problems
- feature space
- association graph