Sciweavers

380 search results - page 43 / 76
» On the Parallelization of the Sparse Grid Approach for Data ...
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 9 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
14 years 1 months ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 9 months ago
Semantic Smoothing for Bayesian Text Classification with Small Training Data
Bayesian text classifiers face a common issue which is referred to as data sparsity problem, especially when the size of training data is very small. The frequently used Laplacian...
Xiaohua Zhou, Xiaodan Zhang, Xiaohua Hu
ICDM
2005
IEEE
217views Data Mining» more  ICDM 2005»
14 years 1 months ago
Improving Automatic Query Classification via Semi-Supervised Learning
Accurate topical classification of user queries allows for increased effectiveness and efficiency in general-purpose web search systems. Such classification becomes critical if th...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
HPCC
2005
Springer
14 years 1 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold