Sciweavers

436 search results - page 33 / 88
» Automatic Subspace Clustering of High Dimensional Data for D...
Sort
View
ACSW
2004
13 years 9 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
CVPR
2005
IEEE
14 years 9 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax
ICDM
2002
IEEE
123views Data Mining» more  ICDM 2002»
14 years 19 days ago
Towards Automatic Generation of Query Taxonomy: A Hierarchical Query Clustering Approach
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
Shui-Lung Chuang, Lee-Feng Chien
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
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 1 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal