default search action
13th ICML 1996: Bari, Italy
- Lorenza Saitta:
Machine Learning, Proceedings of the Thirteenth International Conference (ICML '96), Bari, Italy, July 3-6, 1996. Morgan Kaufmann 1996, ISBN 1-55860-419-7
Contributed Papers
- Naoki Abe, Hang Li:
Learning Word Association Norms Using Tree Cut Pair Models. ICML 1996: 3-11 - Aynur Akkus, H. Altay Güvenir:
K Nearest Neighbor Classification on Feature Projections. ICML 1996: 12-19 - Cesar Bandera, Francisco J. Vico, José Manuel Bravo, Mance E. Harmon, Leemon C. Baird III:
Residual Q-Learning Applied to Visual Attention. ICML 1996: 20-27 - Eric B. Baum:
Toward a Model of Mind as a Laissez-Faire Economy of Idiots. ICML 1996: 28-36 - Enrico Blanzieri, Patrick Katenkamp:
Learning Radial Basis Function Networks On-line. ICML 1996: 37-45 - Henrik Boström:
Theory-Guideed Induction of Logic Programs by Inference of Regular Languages. ICML 1996: 46-53 - Craig Boutilier, Richard Dearden:
Approximate Value Trees in Structured Dynamic Programming. ICML 1996: 54-62 - Justin A. Boyan, Andrew W. Moore:
Learning Evaluation Functions for Large Acyclic Domains. ICML 1996: 63-70 - Christopher J. C. Burges:
Simplified Support Vector Decision Rules. ICML 1996: 71-77 - Leonardo Carbonara, Derek H. Sleeman:
Improving the Efficiency of Knowledge Base Refinement. ICML 1996: 78-86 - Rich Caruana:
Algorithms and Applications for Multitask Learning. ICML 1996: 87-95 - Thomas G. Dietterich, Michael J. Kearns, Yishay Mansour:
Applying the Waek Learning Framework to Understand and Improve C4.5. ICML 1996: 96-104 - Pedro M. Domingos, Michael J. Pazzani:
Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier. ICML 1996: 105-112 - Steven K. Donoho, Larry A. Rendell:
Constructive Induction Using Fragmentary Knowledge. ICML 1996: 113-121 - Werner Emde, Dietrich Wettschereck:
Relational Instance-Based Learning. ICML 1996: 122-130 - Sean P. Engelson, Moshe Koppel:
Identifying the Information Contained in a Flawed Theory. ICML 1996: 131-138 - Kazuo J. Ezawa, Moninder Singh, Steven W. Norton:
Learning Goal Oriented Bayesian Networks for Telecommunications Risk Management. ICML 1996: 139-147 - Yoav Freund, Robert E. Schapire:
Experiments with a New Boosting Algorithm. ICML 1996: 148-156 - Nir Friedman, Moisés Goldszmidt:
Discretizing Continuous Attributes While Learning Bayesian Networks. ICML 1996: 157-165 - Peter Geibel, Fritz Wysotzki:
Learning Relational Concepts with Decision Trees. ICML 1996: 166-174 - Patrick Goetz, Shailesh Kumar, Risto Miikkulainen:
On-Line Adaptation of a Signal Predistorter through Dual Reinforcement Learning. ICML 1996: 175-181 - Andrew R. Golding, Dan Roth:
Applying Winnow to Context-Sensitive Spelling Correction. ICML 1996: 182-190 - Sally A. Goldman, Stephen D. Scott:
A Theoretical and Empirical Study of a Noise-Tolerant Algorithm to Learn Geormetric Patterns. ICML 1996: 191-199 - Geoffrey J. Gordon, Alberto Maria Segre:
Nonparametric Statistical Methods for Experimental Evaluations of Speedup Learning. ICML 1996: 200-206 - Russell Greiner, Adam J. Grove, Dan Roth:
Learning Active Classifiers. ICML 1996: 207-215 - Russell Greiner, Adam J. Grove, Alexander Kogan:
Exploiting the Omission of Irrelevant Data. ICML 1996: 216-224 - Stephan Grolimund, Jean-Gabriel Ganascia:
Speeding-up Nearest Neighbour Memories: The Template Tree Case Memory Organisation. ICML 1996: 225-233 - Jukka Hekanaho:
Background Knowledge in GA-based Concept Learning. ICML 1996: 234-242 - David P. Helmbold, Robert E. Schapire, Yoram Singer, Manfred K. Warmuth:
On-Line Portfolio Selection Using Multiplicative Updates. ICML 1996: 243-251 - Andreas Ittner, Michael Schlosser:
Non-Linear Decision Trees - NDT. ICML 1996: 252-257 - Pascal Jappy, Richard Nock, Olivier Gascuel:
Negative Robust Learning Results from Horn Claus Programs. ICML 1996: 258-265 - Sven Koenig, Reid G. Simmons:
Passive Distance Learning for Robot Navigation. ICML 1996: 266-274 - Ron Kohavi, David H. Wolpert:
Bias Plus Variance Decomposition for Zero-One Loss Functions. ICML 1996: 275-283 - Daphne Koller, Mehran Sahami:
Toward Optimal Feature Selection. ICML 1996: 284-292 - Miroslav Kubat:
Second Tier for Decision Trees. ICML 1996: 293-301 - Richard H. Lathrop:
On the Learnability of the Uncomputable. ICML 1996: 302-309 - Michael L. Littman, Csaba Szepesvári:
A Generalized Reinforcement-Learning Model: Convergence and Applications. ICML 1996: 310-318 - Huan Liu, Rudy Setiono:
A Probabilistic Approach to Feature Selection - A Filter Solution. ICML 1996: 319-327 - Sridhar Mahadevan:
Sensitive Discount Optimality: Unifying Discounted and Average Reward Reinforcement Learning. ICML 1996: 328-336 - Rémi Munos:
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning. ICML 1996: 337-345 - Tim Oates, Paul R. Cohen:
Searching for Structure in Multiple Streams of Data. ICML 1996: 346-354 - Seishi Okamoto, Nobuhiro Yugami:
Theoretical Analysis of the Nearest Neighbor Classifier in Noisy Domains. ICML 1996: 355-363 - Jonathan J. Oliver, Rohan A. Baxter, Chris S. Wallace:
Unsupervised Learning Using MML. ICML 1996: 364-372 - Mark D. Pendrith, Malcolm R. K. Ryan:
Actual Return Reinforcement Learning versus Temporal Differences: Some Theoretical and Experimental Results. ICML 1996: 373-381 - M. Alicia Pérez:
Representing and Learning Quality-Improving Search Control Knowledge. ICML 1996: 382-390 - Eduardo Pérez, Larry A. Rendell:
Learning Despite Concept Variation by Finding Structure in Attribute-based Data. ICML 1996: 391-399 - Caroline Ravise, Michèle Sebag:
An Advanced Evolution Should Not Repeat its Past Errors. ICML 1996: 400-408 - Chandra Reddy, Prasad Tadepalli, Silvana Roncagliolo:
Theory-guided Empirical Speedup Learning of Goal Decomposition Rules. ICML 1996: 409-417 - Davide Roverso:
Analogy Access by Mapping Spreading and Abstraction in Large, Multifunctional Knowledge Bases. ICML 1996: 418-426 - Marco Saerens:
Non Mean Square Error Criteria for the Training of Learning Machines. ICML 1996: 427-434 - Mehran Sahami, Marti A. Hearst, Eric Saund:
Applying the Multiple Cause Mixture Model to Text Categorization. ICML 1996: 435-443 - Michèle Sebag:
Delaying the Choice of Bias: A Disjunctive Version Space Approach. ICML 1996: 444-452 - Moninder Singh, Gregory M. Provan:
Efficient Learning of Selective Bayesian Network Classifiers. ICML 1996: 453-461 - Joe Suzuki:
Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: An Efficient Algorithm Using the B & B Technique. ICML 1996: 462-470 - Prasad Tadepalli, DoKyeong Ok:
Scaling Up Average Reward Reinforcement Learning by Approximating the Domain Models and the Value Function. ICML 1996: 471-479 - Kang Soo Tae, Diane J. Cook:
Experimental Knowledge Acquisition for Planning. ICML 1996: 480-488 - Sebastian Thrun, Joseph O'Sullivan:
Discovering Structure in Multiple Learning Tasks: The TC Algorithm. ICML 1996: 489-497 - Kai Ming Ting:
The Characterisation of Predictive Accuracy and Decision Combination. ICML 1996: 498-506 - Henry Tirri, Petri Kontkanen, Petri Myllymäki:
Prababilistic Instance-Based Learning. ICML 1996: 507-515 - Chris S. Wallace, Kevin B. Korb, Honghua Dai:
Causal Discovery via MML. ICML 1996: 516-524 - Gerhard Widmer:
Recognition and Exploitation of Contextual CLues via Incremental Meta-Learning. ICML 1996: 525-533 - Marco A. Wiering, Jürgen Schmidhuber:
Solving POMDPs with Levin Search and EIRA. ICML 1996: 534-542 - Jean-Daniel Zucker, Jean-Gabriel Ganascia:
Representation Changes for Efficient Learning in Structural Domains. ICML 1996: 543-551
Invited Talks
- Heikki Mannila:
Data Mining and Machine Learning (Abstract). ICML 1996: 555 - Andrew W. Moore:
Reinforcement Learning in Factories: The Auton Project (Abstract). ICML 1996: 556 - Vladimir Vapnik:
Statistical Theory of Generalization (Abstract). ICML 1996: 557
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.