Sciweavers

5603 search results - page 218 / 1121
» Feature Selection for Clustering
Sort
View
COMPGEOM
2001
ACM
15 years 10 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ICDM
2007
IEEE
137views Data Mining» more  ICDM 2007»
16 years 17 days ago
Locally Constrained Support Vector Clustering
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
Dragomir Yankov, Eamonn J. Keogh, Kin Fai Kan
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 9 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
CIKM
2006
Springer
15 years 8 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
AE
2003
Springer
15 years 11 months ago
A Clustering Based Niching EA for Multimodal Search Spaces
Abstract. We propose a new niching method for Evolutionary Algorithms which is able to identify and track global and local optima in a multimodal search space. To prevent the loss ...
Felix Streichert, Gunnar Stein, Holger Ulmer, Andr...