187 search results - page 10 / 38 » Constrained 1-Spectral Clustering |
KDD
2007
ACM
16 years 2 days ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
88
Voted
KDD
2008
ACM
16 years 2 days ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
94
Voted
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
99
Voted
IDA
2003
Springer
15 years 4 months ago
2003
Springer
The segmentation of time-series is a constrained clustering problem: the data points should be grouped by their similarity, but with the constraint that all points in a cluster mus...
89
Voted
BMVC
1998
15 years 1 months ago
1998
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...