Sciweavers

110 search results - page 19 / 22
» Boosting a Weak Learning Algorithm by Majority
Sort
View
DIS
2009
Springer
15 years 6 months ago
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
Yasser El-Manzalawy, Vasant Honavar
RECOMB
2005
Springer
16 years 14 hour ago
Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions
Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when th...
Chen Yanover, Tomer Hertz
PAMI
2008
175views more  PAMI 2008»
14 years 11 months ago
Discriminative Feature Co-Occurrence Selection for Object Detection
This paper describes an object detection framework that learns the discriminative co-occurrence of multiple features. Feature co-occurrences are automatically found by Sequential F...
Takeshi Mita, Toshimitsu Kaneko, Björn Stenge...
SAC
2008
ACM
14 years 10 months ago
Strangeness-based feature weighting and classification of gene expression profiles
Achieving high classification accuracy is a major challenge in the diagnosis of cancer types based on gene expression profiles. These profiles are notoriously noisy in that a larg...
Haifeng Shao, Bei Yu, Joseph H. Nadeau
COLT
2001
Springer
15 years 4 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman