Abstract
Following a drizzling, we take a walk on the wet street. Feeling the gentle breeze and seeing the sunset glow, we bet the weather must be nice tomorrow. Walking to a fruit stand, we pick up a green watermelon with curly root and muffled sound; while hoping the watermelon is ripe, we also expect some good academic marks this semester after all the hard work on studies. We wish readers to share the same confidence in their studies, but to begin with, let us take an informal discussion on what is machine learning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alpaydin E (2004) Introduction to machine learning. MIT Press, Cambridge
Asmis E (1984) Epicurus’ scientific method. Cornell University Press, Ithaca
Bishop CM (2006) Pattern recognition and machine learning. Springer, New York
Blumer A, Ehrenfeucht A, Haussler D, Warmuth MK (1996) Occam’s razor. Inf Process Lett 24(6):377–380
Carbonell JG (ed) (1990) Machine learning: paradigms and methods. MIT Press, Cambridge
Cohen PR, Feigenbaum EA (eds) (1983) The handbook of artificial intelligence, vol 3. William Kaufmann, New York
Dietterich TG (1997) Machine learning research: four current directions. AI Mag 18(4):97–136
Domingos P (1999) The role of Occam’s razor in knowledge discovery. Data Min Knowl Discov 3(4):409–425
Duda RO, Hart PE, Stork DG (2001) Pattern Classification, 2nd edn. Wiley, New York
Flach P (2012) Machine learning: the art and science of algorithms that make sense of data. Cambridge University Press, Cambridge
Hand D, Mannila H, Smyth P (2001) Principles of data mining. MIT Press, Cambridge
Hastie T, Tibshirani R, Friedman J (2009) The elements of statistical learning, 2nd edn. Springer, New York
Hunt EG, Hovland DI (1963) Programming a model of human concept formation. In: Feigenbaum E, Feldman J (eds) Computers and Thought. McGraw Hill, New York, pp 310–325
Kanerva P (1988) Sparse distributed memory. MIT Press, Cambridge
Michalski RS, Carbonell JG, Mitchell TM (eds) (1983) Machine learning: an artificial intelligence approach. Tioga, Palo Alto
Mitchell T (1997) Machine learning. McGraw Hill, New York
Mitchell TM (1977) Version spaces: a candidate elimination approach to rule learning. In: Proceedings of the 5th international joint conference on artificial intelligence (IJCAI), pp 305–310. Cambridge, MA
Mjolsness E, DeCoste D (2001) Machine learning for science: state of the art and future prospects. Science 293(5537):2051–2055
Pan SJ, Yang Q (2010) A survey of transfer learning. IEEE Trans Knowl Data Eng 22(10):1345–1359
Shalev-Shwartz S, Ben-David S (2014) Understanding machine learning. Cambridge University Press, Cambridge
Simon HA, Lea G (1974) Problem solving and rule induction: a unified view. In: Gregg LW (ed) Knowledge and cognition. Erlbaum, New York, pp 105–127
Vapnik VN (1998) Statistical learning theory. Wiley, New York
Webb GI (1996) Further experimental evidence against the utility of Occam’s razor. J Artif Intell Res 43:397–417
Winston PH (1970) Learning structural descriptions from examples. Technical Report AI-TR-231, AI Lab, MIT, Cambridge, MA
Witten IH, Frank E, Hall MA (2011) Data mining: practical machine learning tools and techniques, 3rd edn. Elsevier, Burlington
Wolpert DH (1996) The lack of a priori distinctions between learning algorithms. Neural Comput 8(7):1341–1390
Wolpert DH, Macready WG (1995) No free lunch theorems for search. Technical Report SFI-TR-05-010, Sante Fe Institute, Sante Fe
Zhou Z-H (2003) Three perspectives of data mining. Artif Intell 143(1):139–146
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Zhou, ZH. (2021). Introduction. In: Machine Learning. Springer, Singapore. https://doi.org/10.1007/978-981-15-1967-3_1
Download citation
DOI: https://doi.org/10.1007/978-981-15-1967-3_1
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1966-6
Online ISBN: 978-981-15-1967-3
eBook Packages: Computer ScienceComputer Science (R0)