Sciweavers

165 search results - page 20 / 33
» Adaptive dimension reduction for clustering high dimensional...
Sort
View
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 2 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
AUSAI
2007
Springer
15 years 5 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
NPL
1998
135views more  NPL 1998»
14 years 11 months ago
Local Adaptive Subspace Regression
Abstract. Incremental learning of sensorimotor transformations in high dimensional spaces is one of the basic prerequisites for the success of autonomous robot devices as well as b...
Sethu Vijayakumar, Stefan Schaal
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 5 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 3 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar