Sciweavers

528 search results - page 63 / 106
» Mining Subspace Correlations
Sort
View
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
14 years 9 months ago
LOCUST: An Online Analytical Processing Framework for High Dimensional Classification of Data Streams
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
Charu C. Aggarwal, Philip S. Yu
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
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
14 years 8 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone
SDM
2011
SIAM
198views Data Mining» more  SDM 2011»
12 years 10 months ago
Exemplar-based Robust Coherent Biclustering
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
Kewei Tu, Xixiu Ouyang, Dingyi Han, Vasant Honavar