Sciweavers

5659 search results - page 239 / 1132
» Comparing Clusterings in Space
Sort
View
IR
2002
15 years 5 months ago
Adaptive Filtering of Newswire Stories using Two-Level Clustering
Adaptive filtering of news is an area of information retrieval gaining substantial interest as services become more available on the Internet. This paper reports on a number of ex...
David Eichmann, Padmini Srinivasan
PRL
2007
150views more  PRL 2007»
15 years 5 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
15 years 7 months ago
An incremental data-stream sketch using sparse random projections
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
Aditya Krishna Menon, Gia Vinh Anh Pham, Sanjay Ch...
ICML
2007
IEEE
16 years 6 months ago
Feature selection in a kernel space
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...
Bin Cao, Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng...
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
16 years 17 days ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang