1887 search results - page 16 / 378 » Clustering with Local Restrictions |
107
click to vote
PAMI
2007
14 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
BMVC
1998
14 years 11 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...
ICTIR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We have found that the nearest neighbor (NN) test is an insufficient measure of the cluster hypothesis. The NN test is a local measure of the cluster hypothesis. Designer...
103
click to vote
PAKDD
2000
ACM
15 years 1 months ago
2000
ACM
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...