Sciweavers

PAKDD
2011
ACM
245views Data Mining» more  PAKDD 2011»
13 years 2 months ago
Finding Rare Classes: Adapting Generative and Discriminative Models in Active Learning
Discovering rare categories and classifying new instances of them is an important data mining issue in many fields, but fully supervised learning of a rare class classifier is pr...
Timothy M. Hospedales, Shaogang Gong, Tao Xiang
CATS
2008
14 years 27 days ago
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
Frank Ruskey, Aaron Williams
ESOP
2008
Springer
14 years 1 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
ICPR
2006
IEEE
15 years 16 days ago
A 'No Panacea Theorem' for Multiple Classifier Combination
We introduce the `No Panacea Theorem' for classifier combination in the two-classifier, two-class case. It states that if the combination function is continuous and diverse, ...
Robert I. Damper, Roland Hu