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...
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. ...
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...
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...
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...