22 search results - page 4 / 5 » Spectral Relaxation for K-means Clustering |
NIPS
2007
13 years 7 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
NIPS
2004
13 years 7 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
TIP
2010
13 years 22 days ago
2010
In this paper, we propose a new image clustering algorithm, referred to as Clustering using Local Discriminant Models and Global Integration (LDMGI). To deal with the data points s...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
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...
ML
2010
ACM
13 years 24 days ago
2010
ACM
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...