2600 search results - page 39 / 520 » Clustering with or without the Approximation |
ADC
2006
Springer
14 years 1 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 16 days 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...
ASC
2008
13 years 7 months ago
2008
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
IGPL
2011
13 years 2 months ago
2011
Clustering is a branch of multivariate analysis that is used to create groups of data. While there are currently a variety of techniques that are used for creating clusters, many ...
VISSYM
2003
13 years 9 months 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...