Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
One of the most enjoyable experiences in science is hearing a simple but novel idea which instantly rings true, and whose consequences then begin to unfold in unforeseen directions. For me, this book presents such an idea and several of its ramifications. This book is concerned with machine learning. It focuses on a ques tion that is central to understanding how computers might learn: how can a computer acquire the definition of some general concept by abstracting from specific training instances of the concept? Although this question of how to automatically generalize from examples has been considered by many researchers over several decades, it remains only partly answered. The approach developed in this book, based on Haym Hirsh’s Ph.D. dis sertation, leads to an algorithm which efficiently and exhaustively searches a space of hypotheses (possible generalizations of the data) to find all maxi mally consistent hypotheses, even in the presence of certain types of incon sistencies in the data. More generally, it provides a framework for integrat ing different types of constraints (e.g., training examples, prior knowledge) which allow the learner to reduce the set of hypotheses under consideration.
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
One of the most enjoyable experiences in science is hearing a simple but novel idea which instantly rings true, and whose consequences then begin to unfold in unforeseen directions. For me, this book presents such an idea and several of its ramifications. This book is concerned with machine learning. It focuses on a ques tion that is central to understanding how computers might learn: how can a computer acquire the definition of some general concept by abstracting from specific training instances of the concept? Although this question of how to automatically generalize from examples has been considered by many researchers over several decades, it remains only partly answered. The approach developed in this book, based on Haym Hirsh’s Ph.D. dis sertation, leads to an algorithm which efficiently and exhaustively searches a space of hypotheses (possible generalizations of the data) to find all maxi mally consistent hypotheses, even in the presence of certain types of incon sistencies in the data. More generally, it provides a framework for integrat ing different types of constraints (e.g., training examples, prior knowledge) which allow the learner to reduce the set of hypotheses under consideration.