A Review on Hypothesis Representation in Machine Learning
Keywords:
Machine Learning, Hypothesis RepresentationAbstract
Search through a large hypothesis space is the basis for Machine Learning. The process of learning is said to be complete, when the search arrives at a hypothesis, whichprovides best approximation to the target function. Such hypothesis not only fits the available training examples, but also extends beyond it. This review presents different approaches available for representing a hypothesis and the search of hypothesis space to arrive at the best hypothesis.
References
- Tom M Mitchell, "Machine Learning",ISBN-13:978-0070428072.
- Mitchell T M(1979).Version Spaces: An approach to concept learning, (Ph.DDissertation).Electrical Engineering Dept., Standford, USA
- Fayyad, U.M.(1991). On the induction of decision trees for multiple concept learning, (Ph.D Dissertation).EECSDept, University of Michigan.
- DeJong,K.A.(1975).An analysis of behavior of a class of genetic adaptive systems((Ph.D Dissertation). University of Michigan.
- Genetic algorithms in search, optimization , and machine learning. MA: Addison-Wesley.
- Waibel,A.,Hanazawa,T.,Hinton.,Shikano,K.,&Lang,K.(1989).Phoneme recognition using time delay neural networks. IEEE Transactions on Acoustics,Speech and Signal Processing,328-339
- Sebag, M(1994).Using Constraints to build version spaces .Proceedings of the 1994 European Conference on Machine learning. Springer-Verlag.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

This work is licensed under a Creative Commons Attribution 4.0 International License.