Sciweavers

325 search results - page 3 / 65
» On Clusterings - Good, Bad and Spectral
Sort
View
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
14 years 11 days ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...
ECCV
2010
Springer
13 years 8 months ago
Learning Shape Segmentation Using Constrained Spectral Clustering and Probabilistic Label Transfer
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a...
BMVC
2002
13 years 8 months ago
Alignment using Spectral Clusters
This paper describes a hierarchical spectral method for the correspondence matching of point-sets. Conventional spectral methods for correspondence matching are notoriously suscep...
Marco Carcassoni, Edwin R. Hancock
CVPR
2008
IEEE
14 years 7 months ago
Correlational spectral clustering
We present a new method for spectral clustering with paired data based on kernel canonical correlation analysis, called correlational spectral clustering. Paired data are common i...
Matthew B. Blaschko, Christoph H. Lampert
ECML
2006
Springer
13 years 7 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev