Cliques in high-dimensional random geometric graphs.
Konstantin E. AvrachenkovAndrei BobuPublished in: Appl. Netw. Sci. (2020)
Keyphrases
- high dimensional
- maximal cliques
- graph structure
- weighted graph
- maximum clique
- graph theoretical
- low dimensional
- graph matching
- reeb graph
- feature space
- topological information
- graph theoretic
- similarity search
- high dimensional data
- multi dimensional
- nearest neighbor
- dimensionality reduction
- geometric constraints
- high dimensionality
- data points
- d objects
- graph mining
- kernel function
- graph theory
- parameter space
- variable selection
- geometric structure
- graphical models
- graph clustering
- graph kernels
- functional modules
- heavy tailed
- subgraph isomorphism
- metric space
- microarray data
- data sets