Sciweavers

966 search results - page 119 / 194
» A Two-Level Learning Method for Generalized Multi-instance P...
Sort
View
144
Voted
DMIN
2007
226views Data Mining» more  DMIN 2007»
15 years 4 months ago
Generative Oversampling for Mining Imbalanced Datasets
— One way to handle data mining problems where class prior probabilities and/or misclassification costs between classes are highly unequal is to resample the data until a new, d...
Alexander Liu, Joydeep Ghosh, Cheryl Martin
178
Voted
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 5 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
13 years 5 months ago
Mining emerging patterns by streaming feature selection
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...
Kui Yu, Wei Ding 0003, Dan A. Simovici, Xindong Wu
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 2 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
SIGIR
2009
ACM
15 years 9 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...