Sciweavers

ICPP
2000
IEEE
13 years 9 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
MLDM
2005
Springer
13 years 10 months ago
SSC: Statistical Subspace Clustering
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
Laurent Candillier, Isabelle Tellier, Fabien Torre...
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
13 years 11 months ago
Incremental Subspace Clustering over Multiple Data Streams
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
Qi Zhang, Jinze Liu, Wei Wang 0010
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 5 months ago
Query result clustering for object-level search
Query result clustering has recently attracted a lot of attention to provide users with a succinct overview of relevant results. However, little work has been done on organizing t...
Jongwuk Lee, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
ISBI
2006
IEEE
14 years 5 months ago
Segmenting a beating heart using polysegment and Spatial GPCA
Given a volume of cardiac MR images, we consider the problem of segmenting the heart based on intensity and dynamics. We first segment the heart and the chest from the background ...
Avinash Ravichandran, René Vidal, Henry Hal...
ICIP
2006
IEEE
14 years 6 months ago
Automatic Clustering of Faces in Meetings
Meetings are an integral part of business life for any organization. In previous work, we have developed a physical awareness system called CAMEO (Camera Assisted Meeting Event Ob...
Carlos Vallespí, Fernando De la Torre, Manu...