Sciweavers

766 search results - page 26 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
DAWAK
2005
Springer
14 years 2 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
SOCO
2008
Springer
13 years 8 months ago
A particular Gaussian mixture model for clustering and its application to image retrieval
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
Hichem Sahbi
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
13 years 10 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...
ICDM
2007
IEEE
137views Data Mining» more  ICDM 2007»
14 years 3 months 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
SIGIR
2004
ACM
14 years 2 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