Boosting as a metaphor for algorithm designLEYTON-BROWN, Kevin; NUDELMAN, Eugene; ANDREW, Galen et al.Lecture notes in computer science. 2003, pp 899-903, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

Random subclass boundsMENDELSON, Shahar; PHILIPS, Petra.Lecture notes in computer science. 2003, pp 329-343, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Exploring learnability between Exact and PACBSHOUTY, Nader H; JACKSON, Jeffrey C; TAMON, Christino et al.Lecture notes in computer science. 2002, pp 244-254, issn 0302-9743, isbn 3-540-43836-X, 11 p.Conference Paper

iboost : Boosting using an instance-based exponential weighting schemeKWEK, Stephen; NGUYEN, Chau.Lecture notes in computer science. 2002, pp 245-257, issn 0302-9743, isbn 3-540-44036-4, 13 p.Conference Paper

Pairwise classification as an ensemble techniqueFÜRNKRANZ, Johannes.Lecture notes in computer science. 2002, pp 97-110, issn 0302-9743, isbn 3-540-44036-4, 14 p.Conference Paper

Learning with an embedded reject optionSUNDARARAJAN, Ramasubramanian; PAL, Asim K.Lecture notes in computer science. 2004, pp 664-669, issn 0302-9743, isbn 3-540-22123-9, 6 p.Conference Paper

Probabilistic predicative programmingHEHNER, Eric C. R.Lecture notes in computer science. 2004, pp 169-185, issn 0302-9743, isbn 3-540-22380-0, 17 p.Conference Paper

New lower bounds for Statistical Query learningKE YANG.Lecture notes in computer science. 2002, pp 229-243, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

A few notes on statistical learning theoryMENDELSON, Shahar.Lecture notes in computer science. 2003, pp 1-40, issn 0302-9743, isbn 3-540-00529-3, 40 p.Conference Paper

SINGLE CUE PROBABILITY LEARNING: DO SUBJECTS GIVE PRIORITY TO SMALL ERRORS OR TASK-REGULARITY.BJOERKMAN M; NILSSON R.1982; ACTA PSYCHOL.; ISSN 0001-6918; NLD; DA. 1982; VOL. 51; NO 1; PP. 1-11; BIBL. 7 REF.Article

Getting it right by getting it wrong: When learners change languagesHUDSON KAM, Carla L; NEWPORT, Elissa L.Cognitive psychology (Print). 2009, Vol 59, Num 1, pp 30-66, issn 0010-0285, 37 p.Article

The effectiveness of feedback in multiple-cue probability learningNEWELL, Ben R; WESTON, Nicola J; TUNNEY, Richard J et al.The Quarterly journal of experimental psychology (2006. Print). 2009, Vol 62, Num 5, pp 890-908, issn 1747-0218, 19 p.Article

Ontology mapping: An integrated approachEHRIG, Marc; SURE, York.Lecture notes in computer science. 2004, pp 76-91, issn 0302-9743, isbn 3-540-21999-4, 16 p.Conference Paper

How to make AdaBoost.M1 work for weak base classifiers by changing only one line of the codeEIBL, Günther; PFEIFFER, Karl Peter.Lecture notes in computer science. 2002, pp 72-83, issn 0302-9743, isbn 3-540-44036-4, 12 p.Conference Paper

Highlighting hard patterns via AdaBoost weights evolutionCAPRILE, Bruno; FURLANELLO, Cesare; MERLER, Stefano et al.Lecture notes in computer science. 2002, pp 72-80, issn 0302-9743, isbn 3-540-43818-1, 9 p.Conference Paper

A discussion on the Classifier Projection Space for Classifier combiningPEKALSKA, Elzbieta; DUIN, Robert P. W; SKURICHINA, Marina et al.Lecture notes in computer science. 2002, pp 137-148, issn 0302-9743, isbn 3-540-43818-1, 12 p.Conference Paper

Neural network realization of support vector methods for pattern classificationYING TAN; YOUSHEN XIA; JUN WANG et al.IEEE-INNS-ENNS international joint conference on neural networks. 2000, pp Vol6.411-416, isbn 0-7695-0619-4, 6VolConference Paper

Probably approximate learning over classes of distributionsNATARAJAN, B. K.SIAM journal on computing (Print). 1992, Vol 21, Num 3, pp 438-449, issn 0097-5397Article

The neural correlates of reward-related trial-and-error learning : An fMRI study with a probabilistic learning taskKOCH, Kathrin; SCHACHTZABEL, Claudia; WAGNER, Gerd et al.Learning & memory (Cold Spring Harbor, N.Y.). 2008, Vol 15, Num 7-12, pp 728-732, issn 1072-0502, 5 p.Article

A non-local coarsening result in granular probabilistic networksBUTZ, Cory J; HONG YAO; HAMILTON, Howard J et al.Lecture notes in computer science. 2003, pp 686-689, issn 0302-9743, isbn 3-540-14040-9, 4 p.Conference Paper

Universal well-calibrated algorithm for on-line classificationVOVK, Vladimir.Lecture notes in computer science. 2003, pp 358-372, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Multiple-cue probabilistic learning in spider-fearful and in panic-prone individualsKOPP, Bruno; ALTMANN, René; HERMANN, Christiane et al.Journal of behavior therapy and experimental psychiatry. 2003, Vol 34, Num 2, pp 101-115, issn 0005-7916, 15 p.Article

Distributed pasting of small votesCHAWLA, N. V; HALL, L. O; BOWYER, K. W et al.Lecture notes in computer science. 2002, pp 52-61, issn 0302-9743, isbn 3-540-43818-1, 10 p.Conference Paper

Scaling boosting by margin-based inclusion of features and relationsHOCHE, Susanne; WROBEL, Stefan.Lecture notes in computer science. 2002, pp 148-160, issn 0302-9743, isbn 3-540-44036-4, 13 p.Conference Paper

Stochastic finite learningZEUGMANN, Thomas.Lecture notes in computer science. 2001, pp 155-171, issn 0302-9743, isbn 3-540-43025-3Conference Paper