1105 search results - page 78 / 221 » Approximate Spectral Clustering. |
ADC
2006
Springer
14 years 5 months ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
Our goal is to segment a video sequence into moving objects and the world scene. In recent work, spectral embedding of point trajectories based on 2D motion cues accumulated from ...
VISSYM
2003
14 years 16 days ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
DAGSTUHL
2007
14 years 19 days ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...