Sciweavers

1085 search results - page 97 / 217
» Active Mining in a Distributed Setting
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 11 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
14 years 4 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 11 months ago
Roughly Balanced Bagging for Imbalanced Data
Imbalanced class problems appear in many real applications of classification learning. We propose a novel sampling method to improve bagging for data sets with skewed class distri...
Shohei Hido, Hisashi Kashima
PPOPP
2010
ACM
14 years 7 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 10 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen