Approximate Greedy Clustering and Distance Selection for Graph Metrics.
David EppsteinSariel Har-PeledAnastasios SidiropoulosPublished in: CoRR (2015)
Keyphrases
- graph theoretic
- distance computation
- clustering algorithm
- clustering method
- graph clustering
- distance metric
- graph partitioning
- k means
- random selection
- similarity matrix
- graph model
- search algorithm
- graph construction
- random walk
- graph structure
- bipartite graph
- graph theory
- forward selection
- cluster analysis
- data points
- hierarchical clustering
- tree edit distance
- directed graph
- information theoretic
- graph representation
- pairwise similarities
- normalized cut
- data clustering
- neighborhood graph
- spectral clustering
- inter cluster
- partitioning algorithm
- dynamic programming
- self organizing maps
- proximity measures
- distance measure
- euclidean distance
- dissimilarity measure
- feature selection
- document clustering
- structured data
- distance matrix
- edge weights
- similarity function
- similarity graph
- similarity measure
- affinity measure