Sciweavers

692 search results - page 34 / 139
» A new clustering algorithm for coordinate-free data
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Learning from high-dimensional noisy data via projections onto multi-dimensional ellipsoids
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
Liuling Gong, Dan Schonfeld
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 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
IDEAL
2009
Springer
13 years 5 months ago
Implementation and Integration of Algorithms into the KEEL Data-Mining Software Tool
This work is related to the KEEL1 (Knowledge Extraction based on Evolutionary Learning) tool, a non-commercial software that supports data management, design of experiments and an ...
Alberto Fernández, Julián Luengo, Jo...
SIGIR
2004
ACM
14 years 1 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara