1996 | |  | Learning in the Presence of Inaccurate Information - Mark Fulk and Sanjay Jain |
| |  | Learning by Erasing - S. Lange, R. Wiehagen and T. Zeugmann |
| |  | Non mean square error criteria for the training of learning machines - Marco Saerens |
| |  | Performance Improvement of Robot Continuous-Path Operation through Iterative Learning Using Neural Networks - Peter C. Y. Chen, James K. Mills and Kenneth C. Smith |
| |  | Unions of identifiable families of languages - Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis and Juris Smotrovs |
| |  | Introduction - Judy A. Franklin, Tom M. Mitchell and Sebastian Thrun |
| |  | Negative robust learning results for Horn clause programs - Pascal Jappy, Richard Nock and Olivier Gascuel |
| |  | VC dimension of an integrate-and-fire neuron model - Anthony M. Zador and Barak A. Pearlmutter |
| |  | Review of Inductive Logic Programming: Techniques and Applications by Nada Lavrac, Saso Dzeroski - Michael Pazzani |
| |  | How many queries are needed to learn? - Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan and Dawn Wilkins |
| |  | Searching for structure in multiple streams of data - Tim Oates and Paul R. Cohen |
| |  | Inductive logic programming beyond logical implication - Jianguo Lu and Jun Arima |
| |  | Towards robust model selection using estimation and approximation error bounds - Joel Ratsaby, Ronny Meir and Vitaly Maiorov |
| |  | Inductive inference from positive data: from heuristic to characterizing methods - Timo Knuutila |
| |  | Inclusion problems in parallel learning and games - Martin Kummer and Frank Stephan |
| |  | Technical Note: Some Properties of Splitting Criteria - Leo Breiman |
| |  | Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent - N. Cesa-Bianchi, P. M. Long and M. K. Warmuth |
| |  | Learning a representation for optimizable formulas - Hans Kleine Büning and Theodor Lettmann |
| |  | Relational instance-based learning - Werner Emde and Dietrich Wettschereck |
| |  | Reinforcement learning in factories: the auton project (abstract) - Andrew W. Moore |
| |  | Real-World Robotics: Learning to Plan for Robust Execution - Scott W. Bennett and Gerald F. DeJong |
| |  | Background knowledge in GA-based concept learning - Jukka Hekanaho |
| |  | On-line Prediction and Conversion Strategies - Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold and Manfred K. Warmuth |
| |  | Non-linear decision trees - NDT - Andreas Ittner and Michael Schlosser |
| |  | Probabilistic limit identification up to 'small' sets - Juris Vīksna |
| |  | Hinfinity Optimality of the LMS Algorithm - B. Hassibi, A. H. Sayed and T. Kailath |
| |  | Stacked Regressions - Leo Breiman |
| |  | Constructive induction using fragmentary knowledge - Steve Donoho and Larry Rendell |
| |  | Characteristic sets for polynominal grammatical inference - Colin De La Higuera |
| |  | Grammatical inference using tabu search - Jean-Yves Giordano |
| |  | The complexity of exactly learning algebraic concepts - V. Arvind and N. V. Vinodchandran |
| |  | Transformations that preserve learnability - Andris Ambainis and Rīsiņs Freivalds |
| |  | Learning conjunctions of two unate DNF formulas: computational and informational results - Aaron Feigelson and Lisa Hellerstein |
| |  | Actual return reinforcement learning versus temporal differences: some theoretical and experimental results - Mark D. Pendrith and Malcolm R. K. Ryan |
| |  | Representation changes for efficient learning in structural domains - Jean-Daniel Zucker and Jean-Gabriel Ganascia |
| |  | Incremental regular inference - Pierre Dupont |
| |  | Introduction - Leslie Pack Kaelbling |
| |  | Probabilistic and team PFIN-type learning: general properties - Andris Ambainis |
| |  | Worst-Case Loss Bounds for Single Neurons - David P. Helmbold, Jyrki Kivinen and Manfred K. Warmuth |
| |  | Identification of DFA: data-dependent vs data-independent algorithms - Colin De La Higuera, José Oncina and Enrique Vidal |
| |  | Inferring stochastic regular grammars with recurrent neural networks - Rafael C. Carrasco, Mikel L. Forcada and Laureano Santamar\'ıa |
| |  | Oracles and queries that are sufficient for exact learning - Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan and Christino Tamon |
| |  | Clustering of sequences using minimum grammar compexity criterion - Ana L. N. Fred |
| |  | Discretizing continuous attributes while learning Bayesian neworks - Nir Friedman and Moises Goldszmidt |
| |  | The intrinsic complexity of language identification - Sanjay Jain and Arun Sharma |
| |  | Reinforcement Learning with Replacing Eligibility Traces - Satinder P Singh and Richard S. Sutton |
| |  | Game theory, on-line prediction and boosting - Yoav Freund and Robert E. Schapire |
| |  | MML estimation of the parameters of the spherical Fisher distribution - David L. Dowe, Jonathan J. Oliver and Chris S. Wallace |
| |  | Computational Limits on Team Identification of Languages - Sanjay Jain and Arun Sharma |
| |  | On the structure of the Degrees of Inferability - Martin Kummer and Frank Stephan |
| |  | BEXA: A Covering Algorithm for Learning Propositional Concept Descriptions - Hendrik Theron and Ian Cloete |
| |  | Active Learning for Vision-Based Robot Grasping - Marcos Salganicoff, Lyle H. Ungar and Ruzena Bajcsy |
| |  | Angluin's theorem for indexed families of r.e. sets and applications - Dick de Jongh and Makoto Kanazawa |
| |  | Analysis of greedy expert hiring and an application to memory-based learning - Igal Galperin |
| |  | CLASSIC Learning - Michael Frazier and Leonard Pitt |
| |  | On-line portfolio selection using multiplicative updates - David P. Helmbold, Robert E. Schapire, Yoram Singer and Manfred K. Warmuth |
| |  | Lexical categorization: fitting template grammars by incremental MDL optimization - Michael R. Brent and Timothy A. Cartwright |
| |  | A Bayesian/information theoretic model of bias learning - Jonathan Baxter |
| |  | PAC-like upper bounds for the sample complexity of leave-one-out cross-validation - Sean B. Holden |
| |  | representing and learning quality-improving search control knowledge - M. Alicia Pérez |
| |  | Purposive Behavior Acquisition for a Real Robot by Vision-Based Reinforcement Learning - Minoru Asada, Shoichi Noda, Sukoya Tawaratsumida and Koh Hosoda |
| |  | Exponentially many local minima for single neurons - Peter Auer, Mark Herbster and Manfred K. Warmuth |
| |  | Team Learning of Recursive Languages - Sanjay Jain and Arun Sharma |
| |  | Inductive Inference of Monogenic Pure Context-Free Languages - Noriyuki Tanida and Takashi Yokomori |
| |  | Robot Programming by Demonstration (RPD): Supporting the Induction by Human Interaction - H. Friedrich, S. Münch, R. Dillman, S. Bocionek and M. Sassin |
| |  | Learning from a consistently ignorant teacher - Michael Frazier, Sally Goldman, Nina Mishra and Leonard Pitt |
| |  | Experimental knowledge acquisition for planning - Kang Soo Tae and Diane J. Cook |
| |  | Second tier for decision trees - Miroslav Kubat |
| |  | Learning relational concepts with decision trees - Peter Geibel and Fritz Wysotzki |
| |  | The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length - Dana Ron, Yoram Singer and Naftali Tishby |
| |  | Maximum mutual information and conditional maximum likelihood estimation of stochastic regular syntax-directed translation schemes - F. Casacuberta |
| |  | The importance of convexity in learning with squared loss - Wee Sun Lee, Peter L. Bartlett and Robert C. Williamson |
| |  | Exact classification with two-layer neural nets - Gavin J. Gibson |
| |  | Using knowledge to improve N-gram language modelling through the MGGI methodology. - Enrique Vidal and David Llorens |
| |  | Learning in the Presence of Concept Drift and Hidden Contexts - Gerhard Widmer and Miroslav Kubat |
| |  | Challenges in machine learning for text classification - David D. Lewis |
| |  | The characterisation of predictive accuracy and decision combination - Kai Ming Ting |
| |  | Effects of feature selection with 'blurring' on neurofuzzy systems - Selwyn Piramuthu |
| |  | Applying the weak learning framework to understand and improve C4.5 - Tom Dietterich, Michael Kearns and Yishay Mansour |
| |  | Learning changing concepts by exploiting the structure of change - Peter L. Bartlett, Shai Ben-David and Sanjeev R. Kulkarni |
| |  | A framework for structural risk minimization - John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson and Martin Anthony |
| |  | Unsupervised learning using MML - Jonathan J. Oliver, Rohan A. Baxter and Chris S. Wallace |
| |  | The Effect of Representation and Knowledge on Goal-Directed Exploration with Reinforcement-Learning Algorithms - Sven Koenig and Reid G. Simmons |
| |  | Learning evaluation functions for large acyclic domains - Justin A. Boyan and Andrew W. Moore |
| |  | Learning despite concept variation by finding structure in attribute-based data - Eduardo Pérez and Larry A. Rendell |
| |  | Introducing statistical dependencies and structural constraints in variable-length sequence models - Sabine Deligne, François Yvon and Frédéric Bimbot |
| |  | Lower bound on learning decision lists and trees - Thomas Hancock, Tao Jiang, Ming Li and John Tromp |
| |  | Simplified support vector decision rules - Chris J. C. Burges |
| |  | Approximating value trees in structured dynamic programming - Craig Boutilier and Richard Dearden |
| |  | Co-Learning of Recursive Languages from Positive Data - R. Freivalds and T. Zeugmann |
| |  | Learning active classifiers - Russell Greiner, Adam J. Grove and Dan Roth |
| |  | The loss from imperfect value functions in expectation-based and minimax-based tasks - Matthias Heger |
| |  | Applying winnow to context-sensitive spelli ng correction - Andrew R. Golding and Dan Roth |
| |  | Learning of context-sensitive language acceptors through regular inference and constrained induction - René Alquézar, Alberto Sanfeliu and Jordi Cueva |
| |  | Toward a model of mind as a laissez-faire economy of idiots - Eric B. Baum |
| |  | Reflecting inductive inference machines and its improvement by therapy - Gunter Grieser |
| |  | On the learnability of the uncomputable - Richard H. Lathrop |
| |  | An efficient algorithm for optimal pruning of decision trees - Hussein Almuallim |
| |  | On the Limits of Proper Learnability of Subclasses of DNF Formulas - Pillaipakkamnatt Krishnan and Raghavan Vijay |
| |  | Program Synthesis in the Presence of Infinite Number of Inaccuracies - Sanjay Jain |
| |  | Exploration Bonuses and Dual Control - Peter Dayan and Terrence J. Sejnowski |
| |  | Noise-Tolerant Distribution-Free Learning of General Geometric Concepts - N. H. Bshouty, S. A. Goldman, H. D. Mathias, S. Suri and H. Tamaki |
| |  | On the Worst-Case Analysis of Temporal-Difference Learning Algorithms - Robert E. Schapire and Manfred K. Warmuth |
| |  | Average Reward Reinforcement Learning: Foundations, Algorithms, and Empirical Results - Sridhar Mahadevan |
| |  | Monotonic and dual monotonic language learning - S. Lange, T. Zeugmann and S. Kapur |
| |  | On Limited Nondeterminism and the Complexity of the V-C Dimension - Christos H. Papadimitriou and Mihalis Yannakakis |
| |  | Residual Q-learning applied to visual attention - Cesar Bandera, Francisco J. Vico, Jose M. Bravo, Mance E. Harmon and Leemon C. Baird III |
| |  | A probabilistic approach to feature selection - a filter solution - Huan Liu and Rudy Setiono |
| |  | Speeding-up nearest neighbour memories: the template tree case memory organisation - Stephan Grolimund and Jean-Gabriel Ganascia |
| |  | Representation of finite state automata in recurrent radial basis function networks - Paolo Frasconi, Marco Gori, Marco Maggini and Giovanni Soda |
| |  | Improved bounds about on-line learning of smooth functions of a single variable - Philip M. Long |
| |  | A competitive approach to game learning - Christopher D. Rosin and Richard K. Belew |
| |  | Induction of constraint logic programs - Lionel Martin and Christel Vrain |
| |  | Probabilistic instance-based learning - Henry Tirri, Petri Kontkanen and Petri Myllymäki |
| |  | Learning Bayesian belief networks based on the minimum description length principle: an efficient algorithm using the B \& B technique - Joe Suzuki |
| |  | Set-driven and rearrangement-independent learning of recursive languages - S. Lange and T. Zeugmann |
| |  | Experiments with a new Boosting algorithm - Yoav Freund and Robert E. Schapire |
| |  | Analysis of a simple learning algorithm: learning foraging thresholds for lizards - Leslie Ann Goldberg, William E. Hart and David Bruce Wilson |
| |  | General Inductive Inference Types Based on Linearly-Ordered Sets - Andris Ambainis, Rīsiņs Freivalds and Carl H. Smith |
| |  | Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs - Arlindo L. Oliveira and Alberto Sangiovanni-Vincentelli |
| |  | A disagreement count scheme for inference of constrained Markov networks - J. Gregor and Michael G. Thomason |
| |  | A Reply to Pazzani's Book Review of Inductive Logic Programming: Techniques and Applications - Nada Lavrac and Saso Dzeroski |
| |  | Managing complexity in neuroidal circuits - Leslie G. Valiant |
| |  | Applying the multiple cause mixture model to text categorization - M. Sahami, M. Hearst and E. Saund |
| |  | Anomalous Learning Helps Succinctness - John Case, Sanjay Jain and Arun Sharma |
| |  | Error Reduction through Learning Multiple Descriptions - Kamal M. Ali and Michael J. Pazzani |
| |  | Data mining and machine learning (abstract) - Heikki Mannila |
| |  | On the complexity of learning from drifting distributions - Rakesh D. Barve and Philip M. Long |
| |  | Asking questions to minimize errors - Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock and Sleiman Matar |
| |  | Learning code regular and code linear languages - J. D. Emerald, K. G. Subramanian and D. G. Thomas |
| |  | Query learning of subsequential transducer - Juan Miguel Vilar |
| |  | A randomized approximation of the MDL for stochastic models with hidden variables - Kenji Yamanishi |
| |  | Theory-guided induction of logic programs by inference of regular languages - Henrik Boström |
| |  | Incremental Learning from Positive Data - S. Lange and T. Zeugmann |
| |  | Efficient learning of selective Bayesian network classifiers - Moninder Singh and Gregory M. Provan |
| |  | Using domain information during the learning of a subsequential transducer - José Oncina and Miguel Angel Varó |
| |  | Learning of depth two neural networks with constant fan-in at the hidden nodes - Peter Auer, Stephen Kwek, Wolfgang Maass and Manfred K. Warmuth |
| |  | Learning linear grammars from structural information - Jose M. Sempere and Antonio Fos |
| |  | A generalized reinforcement-learning model: Convergence and applications - Michael L. Littman and Csaba Szepesvári |
| |  | Book review: inductive logic programming: techniques and applications - Michael Pazzani |
| |  | Efficient Incremental Induction of Decision Trees - Dimitrios Kalles and Tim Morris |
| |  | On-line portfolio selection - Erik Ordentlich and Thomas Cover |
| |  | Discrete sequence prediction with commented Markov models - Reinhard Blasig |
| |  | Trees and learning - Wolfgang Merkle and Frank Stephan |
| |  | Learning goal oriented Bayesian networks for telecommunications risk management - Kazuo J. Ezawa, Moninder Singh and Steven W. Norton |
| |  | Proceedings of the Ninth Annual Conference on Computational Learning Theory - Avrim Blum and Michael Kearns |
| |  | Efficient Reinforcement Learning through Symbiotic Evolution - David E. Moriarty and Risto Miikkulainen |
| |  | Extracting Best Consensus Motifs from Positive and Negative Examples - Erika Tateishi, Osamu Maruyama and Satoru Miyano |
| |  | Predicting a binary sequence almost as well as the optimal biased coin - Yoav Freund |
| |  | Learning sparse multivariate polynomials over a field with queries and counterexamples - Robert E. Schapire and Linda M. Sellie |
| |  | A note on grammatical inference of slender context-free languages - Yuji Takada and Taishin Y. Nishida |
| |  | Cost-sensitive feature reduction applied to a hybrid genetic algorithm - Nada Lavrač, Dragan Gamberger and Peter Turney |
| |  | Learning radial basis function networks on-line - E. Blanzieri and P. Katenkamp |
| |  | Learning binary perceptrons perfectly efficiently - Shao C. Fang and Santosh S. Venkatesh |
| |  | Identifying the information contained in a flawed theory - Sean P. Engelson and Moshe Koppel |
| |  | A data dependent skeleton estimate for learning - Gábor Lugosi and Márta Pintér |
| |  | Inductive logic programming for discrete event systems - David Lorenzo |
| |  | The dual DFA learning problem: hardness results for programming by demonstration and learning first-order representations - William W. Cohen |
| |  | Recent Advances in Robot Learning - J. Franklin and T. Mitchell and S. Thrun |
| |  | Learning with Confidence - Jānis Bārzdiņs, Rīsiņs Freivalds and Carl H. Smith |
| |  | K nearest neighbor classification on feature projections - Aynur Akkuş and H. Altay Güvenir |
| |  | An advanced evolution should not repeat its past errors - Caroline Ravis'e and Michèle Sebag |
| |  | Graph learning with a nearest neighbor approach - Sven Koenig and Yury Smirnov |
| |  | Theoretical analysis of the nearest neighbor classifier in noisy domains - Seishi Okamoto and Nobuhiro Yugami |
| |  | Learning k-piecewise testable languages from positive data - José Ruiz and Pedro Garcia |
| |  | Linear estimation in Krein spaces - part I: Theory - B. Hassibi, A. H. Sayed and T. Kailath |
| |  | Technical note: incremental multi-step Q-learning - Jing Peng and Ronald J. Williams |
| |  | Efficient learning of real time two-counter automata - Amr F. Fahmy and Robert S. Roos |
| |  | Classification by feature partitioning - H. Altay Güvenir and Izzet Sirin |
| |  | The kindest cut: minimum message length segmentation - Rohan A. Baxter and Jonathan J. Oliver |
| |  | Efficient Learning of One-Variable Pattern Languages from Positive Examples - T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger and T. Zeugmann |
| |  | Guest Editor's Introduction - Thomas Hancock |
| |  | Sensitive discount optimality: unifying discounted and average reward reinforcement learning - Sridhar Mahadevan |
| |  | Selection criteria for word trigger pairs in language modelling - Christoph Tillmann and Hermann Ney |
| |  | Editors' foreword - William Gasarch and Ming Li |
| |  | An incremental interactive algorithm for grammar inference - Rajesh Parekh and Vasant Honavar |
| |  | Learning an optimal decision strategy in an influence diagram with latent variables - V. G. Vovk |
| |  | Bias plus variance decomposition for zero-one loss functions - Ron Kohavi and David H. Wolpert |
| |  | Delaying the choice of bias: a disjunctive version space approach - Michele Sebag |
| |  | Inferring a Tree from Walks - Osamu Maruyama and Satoru Miyano |
| |  | Learning Controllers for Industrial Robots - C. Baroglio, A. Giordana, M. Kaiser, M. Nuttin and R. Piola |
| |  | Recognition and exploitation of contextual clues via incremental meta-learning - Gerhard Widmer |
| |  | Scaling Up Inductive Learning with Massive Parallelism - Foster John Provost and John M. Aronis |
| |  | Noise elimination in inductive concept learning: a case study in medical diagnosis - Dragan Gamberger, Nada Lavrač and Sašo Dzeroski |
| |  | Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning - David P. Dobkin and Dimitrios Gunopulos |
| |  | Constructive learning of translations based on dictionaries - Noriko Sugimoto, Kouichi Hirata and Hiroki Ishizaka |
| |  | Teaching a smarter learner - Sally A. Goldman and H. David Mathias |
| |  | Scaling up average reward reinforcement learning by approximating the domain models and the value function - Prasad Tadepalli and DoKyeong Ok |
| |  | Incremental Multi-Step Q-Learning - Jing Peng and Ronald J. Williams |
| |  | A convergent reinforcement learning algorithm in the continuous case: the finite-element reinforcement learning - Rémi Munos |
| |  | Boosting first-order learning - J. R. Quinlan |
| |  | Nonparametric statistical methods for experimental evaluations of speedup learning - Geoffrey J. Gordon and Alberto Maria Segre |
| |  | PAC learning with simple examples - F. Denis, C. D'Halluin and R. Gilleron |
| |  | Genetic fitness optimization using rapidly mixing Markov chains - Paul Vitányi |
| |  | Learning Concepts from Sensor Data of a Mobile Robot - Volker Klingspor, Katharina J. Morik and Anke D. Rieger |
| |  | Learning branches and learning to win closed games - Martin Kummer and Matthias Ott |
| |  | Beyond independence: conditions for the optimality of the simple Bayesian classifier - Pedro Domingos and Michael Pazzani |
| |  | Learnability: Admissible, Co-Finite, and Hypersimple Languages - Ganesh Baliga and John Case |
| |  | Solving POMDPs with Levin search and EIRA - Marco Wiering and Jürgen Schmidhuber |
| |  | Causal discovery via MML - Chris Wallace, Kevin B. Korb and Honghua Dai |
| |  | Improving the efficiency of knowledge base refinement - Leonardo Carbonara and Derek Sleeman |
| |  | PAC Learning of One-Dimensional Patterns - Paul W. Goldberg, Sally A. Goldman and Stephen D. Scott |
| |  | A Decision-Tree Model of Balance Scale Development - William C. Schmidt and Charles X. Ling |
| |  | Analogy access by mapping spreading and abstraction in large, multifunctional knowledge bases - Davide Roverso |
| |  | Feature-Based Methods for Large Scale Dynamic Programming - John N. Tsitsiklis and Benjamin van Roy |
| |  | Discovering structure in multiple learning tasks: the TC algorithm - Sebastian Thrun and Joseph O'Sullivan |
| |  | Creating Advice-Taking Reinforcement Learners - Richard Maclin and Jude W. Shavlik |
| |  | Learning Behaviors of Automata from Multiplicity and Equivalence Queries - Francesco Bergadano and Stefano Varricchio |
| |  | Synthesizing enumeration techniques for language learning - Ganesh R. Baliga, John Case and Sanjay Jain |
| |  | Learning to Select Useful Landmarks - Russell Greiner and Ramana Isukapalli |
| |  | On Learning Visual Concepts and DNF Formulae - Eyal Kushilevitz and Dan Roth |
| |  | Algorithms and applications for multitask learning - Rich Caruana |
| |  | Learning curve bounds for a Markov decision process with undiscounted rewards - Lawrence K. Saul and Satinder P. Singh |
| |  | Statistical theory of generalization (abstract) - Vladimir Vapnik |
| |  | Fat-shattering and the learnability of real-valued functions - Peter L. Bartlett, Philip M. Long and Robert C. Williamson |
| |  | Stochastic simple recurrent neural networks - Mostefa Golea, Masahiro Matsuoka and Yasubumi Sakakibara |
| |  | On learning width two branching programs - Nader H. Bshouty, Christino Tamon and David K. Wilson |
| |  | On learning and co-learning of minimal programs - Sanjay Jain, Efim Kinber and Rolf Wiehagen |
| |  | A simple algorithm for learning O(log n)-term DNF - Eyal Kushilevitz |
| |  | Learning grammatical stucture using statistical decision-trees - David M. Magerman |
| |  | Linear least-squares algorithms for temporal difference learning - Steven J. Bradtke and Andrew G. Barto |
| |  | Reducing complexity of decision trees with two variable tests - R. A. Pearson and E. K. T. Smith |
| |  | Theory-guided empirical speedup learning of goal decomposition rules - Chandra Reddy, Prasad Tadepalli and Silvana Roncagliolo |
| |  | Exploiting the omission of irrelevant data - Russell Greiner, Adam J. Grove and Alexander Kogan |
| |  | Passive distance learning for robot navigation - Sven Koenig and Reid G. Simmons |
| |  | On-line adaptation of a signal predistorter through dual reinforcement learning - Patrick Goetz, Shailesh Kumar and Risto Miikkulainen |
| |  | Limits of exact algorithms for inference of minimum size finite state machines - Arlindo L. Oliveira and Stephen Edwards |
| |  | Toward optimal feature selection - Daphne Koller and Mehran Sahami |
| |  | The bounded injury priority method and the learnability of unions of rectangles - Z. Chen and S. Homer |
| |  | Attribute-efficient learning in query and mistake-bound models - Nader H. Bshouty and Lisa Hellerstein |
| |  | General bounds on the number of examples needed for learning probabilistic concepts - Hans Ulrich Simon |
| |  | Incorporating hypothetical knowledge into the process of inductive synthesis - Jānis Bārzdiņš and Ugis Sarkans |
| |  | Learning word association norms using tree cut pair models - Naoki Abe and Hang Li |
| |  | Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract) - Alvis Brāzma, Esko Ukkonen and Jaak Vilo |
| |  | Partially Supervised Learning for Nearest Neighbor Classifiers - Hiroyuki Matsunaga and Kiichi Urahama |
| |  | Inducing constraint grammars - Christer Samuelsson, Pasi Tapanainen and Atro Voutilainen |
| April |  | Probably Approximately Optimal Satisficing Strategies - Russell Greiner and Pekka Orponen |
| July |  | PALO: A probabilistic hill-climbing algorithm - Russell Greiner |
| August |  | Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments - Kathleen Romanik and Jeffrey Scott Vitter |
| |  | Machine Induction Without Revolutionary Changes in Hypothesis Size - John Case, Sanjay Jain and Arun Sharma |
| |  | On Duality in Learning and the Selection of Learning Teams - Kalvis Aps\=ıtis, Rīsiņš Freivalds and Carl H. Smith |
| |  | Probably Almost Bayes Decisions - Svetlana Anoulova, Paul Fischer, Stefan Pölt and Hans Ulrich Simon |
| October |  | Algorithmic Learning Theory, 7th International Workshop, ALT '96, Sydney, Australia, October 1996, Proceedings - Setsuo Arikawa and Arun K. Sharma |