Sciweavers

1339 search results - page 128 / 268
» Robust learning from bites for data mining
Sort
View
AAAI
1996
13 years 10 months ago
Post-Analysis of Learned Rules
Rule induction research implicitly assumes that after producing the rules from a dataset, these rules will be used directly by an expert system or a human user. In real-life appli...
Bing Liu, Wynne Hsu
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
13 years 7 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
ICDM
2006
IEEE
84views Data Mining» more  ICDM 2006»
14 years 3 months ago
Exploratory Under-Sampling for Class-Imbalance Learning
Under-sampling is a class-imbalance learning method which uses only a subset of major class examples and thus is very efficient. The main deficiency is that many major class exa...
Xu-Ying Liu, Jianxin Wu, Zhi-Hua Zhou
KDD
2010
ACM
233views Data Mining» more  KDD 2010»
14 years 25 days ago
Evolutionary hierarchical dirichlet processes for multiple correlated time-varying corpora
Mining cluster evolution from multiple correlated time-varying text corpora is important in exploratory text analytics. In this paper, we propose an approach called evolutionary h...
Jianwen Zhang, Yangqiu Song, Changshui Zhang, Shix...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 3 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...