Sciweavers

190 search results - page 35 / 38
» Constraint-Based Subspace Clustering.
Sort
View
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 9 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 9 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 8 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
WACV
2008
IEEE
14 years 2 months ago
Object Categorization Based on Kernel Principal Component Analysis of Visual Words
In recent years, many researchers are studying object categorization problem. It is reported that bag of keypoints approach which is based on local features without topological in...
Kazuhiro Hotta
ICDM
2007
IEEE
134views Data Mining» more  ICDM 2007»
14 years 2 months ago
On Regional Association Rule Scoping
A special challenge for spatial data mining is that information is not distributed uniformly in spatial data sets. Consequently, the discovery of regional knowledge is of fundamen...
Wei Ding 0003, Christoph F. Eick, Xiaojing Yuan, J...