Abstract is missing.
- On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority AlgorithmsNaoki Abe, Hang Li, Atsuyoshi Nakamura. 3-11
- On Handling Tree-Structured Attributed in Decision Tree LearningHussein Almuallim, Yasuhiro Akiba, Shigeo Kaneda. 12-20
- Theory and Applications of Agnostic PAC-Learning with Small Decision TreesPeter Auer, Robert C. Holte, Wolfgang Maass. 21-29
- Residual Algorithms: Reinforcement Learning with Function ApproximationLeemon C. Baird III. 30-37
- Removing the Genetics from the Standard Genetic AlgorithmShumeet Baluja, Rich Caruana. 38-46
- Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural NetworkJustine Blackmore, Risto Miikkulainen. 55-63
- Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling DomainAvrim Blum. 64-72
- Automatic Selection of Split Criterion during Tree Growing Based on Node LocationCarla E. Brodley. 73-80
- A Lexical Based Semantic Bias for Theory RevisionClifford Brunk, Michael J. Pazzani. 81-89
- A Comparative Evaluation of Voting and Meta-learning on Partitioned DataPhilip K. Chan, Salvatore J. Stolfo. 90-98
- Fast and Efficient Reinforcement Learning with Truncated Temporal DifferencesPawel Cichosz, Jan J. Mulawka. 99-107
- Fast Effective Rule InductionWilliam W. Cohen. 115-123
- Protein Folding: Symbolic Refinement Competes with Neural NetworksSusan Craw, Paul Hutton. 133-141
- A Bayesian Analysis of Algorithms for Learning Finite FunctionsJames Cussens. 142-149
- Committee-Based Sampling For Training Probabilistic ClassifiersIdo Dagan, Sean P. Engelson. 150-157
- Learning Prototypical Concept DescriptionsPiew Datta, Dennis F. Kibler. 158-166
- A Case Study of Explanation-Based ControlGerald DeJong. 167-175
- Explanation-Based Learning and Reinforcement Learning: A Unified ViewThomas G. Dietterich, Nicholas S. Flann. 176-184
- Supervised and Unsupervised Discretization of Continuous FeaturesJames Dougherty, Ron Kohavi, Mehran Sahami. 194-202
- Q-Learning for Bandit ProblemsMichael O. Duff. 209-217
- Distilling Reliable Information From Unreliable TheoriesSean P. Engelson, Moshe Koppel. 218-225
- A Quantitative Study of Hypothesis SelectionPhilip W. L. Fong. 226-234
- Learning to Make Rent-to-Buy Decisions with Systems ApplicationsP. Krishnan, Philip M. Long, Jeffrey Scott Vitter. 233-330
- Learning Proof Heuristics by Adaptive ParametersMatthias Fuchs. 235-243
- Efficient Algorithms for Finding Multi-way Splits for Decision TreesTruxton Fulton, Simon Kasif, Steven Salzberg. 244-251
- Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman ProblemLuca Maria Gambardella, Marco Dorigo. 252-260
- The Challenge of Revising an Impure TheoryRussell Greiner. 269-277
- Tracking the Best ExpertMark Herbster, Manfred K. Warmuth. 286-294
- Reinforcement Learning by Stochastic Hill Climbing on Discounted RewardHajime Kimura, Masayuki Yamamura, Shigenobu Kobayashi. 295-303
- Autmatic Parameter Selection by Minimizing Estimated ErrorRon Kohavi, George H. John. 304-312
- Error-Correcting Output Coding Corrects Bias and VarianceEun-Bae Kong, Thomas G. Dietterich. 313-321
- Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza sKevin J. Lang. 340-343
- Case-Based Acquisition of Place KnowledgePat Langley, Karl Pfleger. 344-352
- Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous AttributesNick Littlestone. 353-361
- Learning Policies for Partially Observable Environments: Scaling UpMichael L. Littman, Anthony R. Cassandra, Leslie Pack Kaelbling. 362-370
- Increasing the Performance and Consistency of Classification Trees by Using the Accuracy Criterion at the LeavesDavid J. Lubinsky. 371-377
- Efficient Learning from Delayed Rewards through Symbiotic EvolutionDavid E. Moriarty, Risto Miikkulainen. 396-404
- Free to Choose: Investigating the Sample Complexity of Active Learning of Real Valued FunctionsPartha Niyogi. 405-412
- On Learning Decision CommitteesRichard Nock, Olivier Gascuel. 413-420
- Inferring Reduced Ordered Decision Graphs of Minimum Description LengthArlindo L. Oliveira, Alberto L. Sangiovanni-Vincentelli. 421-429
- On Pruning and Averaging Decision TreesJonathan J. Oliver, David J. Hand. 430-437
- Efficient Memory-Based Dynamic ProgrammingJing Peng. 438-446
- Using Multidimensional Projection to Find RelationsEduardo Pérez, Larry A. Rendell. 447-455
- Compression-Based Discretization of Continuous AttributesBernhard Pfahringer. 456-463
- For Every Generalization Action, Is There Really an Equal and Opposite Reaction?R. Bharat Rao, Diana F. Gordon, William M. Spears. 471-479
- Active Exploration and Learning in real-Valued Spaces using Multi-Armed Bandit Allocation IndicesMarcos Salganicoff, Lyle H. Ungar. 480-487
- A Comparison of Induction Algorithms for Selective and non-Selective Bayesian ClassifiersMoninder Singh, Gregory M. Provan. 497-505
- Retrofitting Decision Tree Classifiers Using Kernel Density EstimationPadhraic Smyth, Alexander Gray, Usama M. Fayyad. 506-514
- Automatic Speaker Recognition: An Application of Machine LearningBrett Squires, Claude Sammut. 515-521
- TD Models: Modeling the World at a Mixture of Time ScalesRichard S. Sutton. 531-539
- Learning Collection FUsion Strategies for Information RetrievalGeoffrey G. Towell, Ellen M. Voorhees, Narendra Kumar Gupta, Ben Johnson-Laird. 540-548
- Learning by Observation and Practice: An Incremental Approach for Planning Operator AcquisitionXuemei Wang. 549-557
- Learning with Rare Cases and Small DisjunctsGary M. Weiss. 558-565
- Learning Hierarchies from Ambiguous Natural Language DataTakefumi Yamazaki, Michael J. Pazzani, Christopher J. Merz. 575-583
- Machine Learning and Information Retrieval (Abstract)W. Bruce Croft. 587
- Learning With Bayesian Networks (Abstract)David Heckerman. 588
- Learning for Automotive Collision Avoidance and Autonomous ControlDean Pomerleau. 589