Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs.
François BavaudPublished in: ECML/PKDD (1) (2010)
Keyphrases
- weighted graph
- euclidean distance
- spectral clustering
- graph laplacian
- normalized cut
- clustering method
- distance measure
- graph partitioning
- pairwise
- similarity measure
- shortest path
- graph clustering
- distance function
- feature vectors
- distance metric
- data points
- euclidean space
- graph structure
- geodesic distance
- dimensionality reduction
- k means
- data clustering
- clustering algorithm
- multidimensional scaling
- image segmentation
- embedding space
- data objects
- edge weights
- decision trees
- low dimensional
- principal component analysis
- nearest neighbor
- active learning
- kernel pca
- machine learning
- data mining