Sciweavers

350 search results - page 2 / 70
» Semidefinite spectral clustering
Sort
View
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 2 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
JMLR
2006
124views more  JMLR 2006»
13 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ICML
2005
IEEE
14 years 5 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul
EPIA
2011
Springer
12 years 4 months ago
Thematic Fuzzy Clusters with an Additive Spectral Approach
This paper introduces an additive fuzzy clustering model for similarity data as oriented towards representation and visualization of activities of research organizations in a hiera...
Susana Nascimento, Rui Felizardo, Boris Mirkin
DAGSTUHL
2006
13 years 6 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum