Sciweavers

298 search results - page 2 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 24 days ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
13 years 9 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
14 years 24 days ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 8 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
CGF
2011
12 years 7 months ago
Visualizing High-Dimensional Structures by Dimension Ordering and Filtering using Subspace Analysis
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
Bilkis J. Ferdosi, Jos B. T. M. Roerdink