Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering.
Anat AlmogJacob GoldbergerYuval ShavittPublished in: ICDM Workshops (2008)
Keyphrases
- spectral clustering
- label propagation
- graph laplacian
- graph partitioning
- normalized cut
- graph structure
- graph construction
- adjacency matrix
- directed graph
- similarity matrix
- laplacian matrix
- graph clustering
- semi supervised
- pairwise
- pairwise similarities
- spectral methods
- similarity graph
- clustering method
- weighted graph
- graph structures
- undirected graph
- evolutionary clustering
- constrained spectral clustering
- data clustering
- image segmentation
- edge weights
- shortest path
- eigendecomposition
- affinity matrix
- pairwise constraints
- random walk
- k means
- graph representation
- spanning tree
- network structure
- constrained clustering
- clustering algorithm
- data mining
- laplace beltrami
- semi supervised learning
- high dimensional