Abstract
This chapter presents four widely used data mining algorithms and treats their four aspects: essence, applications, advantages, and disadvantages. The algorithms are neural networks, rule induction, tree algorithms, and neighborhood-based reasoning. This chapter is a basic introduction with an overview of important issues. It includes links to relevant algorithmic details related to the mathematical treatment of the selected four algorithms explained in Chapter 2, links to issues on fast and energy-efficient implementations using the dataflow technology of Maxeler, which is explained in Chapter 3, and links to the part on possible applications of selected algorithms treated in Chapter 4.
Reference20 articles.
1. Privacy-preserving data mining.;R.Agrawal;ACM SIGMOD International Conference on Management of Data,2000
2. Berry, M. J., & Linoff, G. S. (n.d.). Data mining techniques: for marketing, sales, and customer relationship management. John Wiley & Sons.
3. BersonA.ThearlingK. (1999). Building data mining applications for CRM. McGraw-Hill.
4. Buck, J. T., & Lee, E. A. (1993). Scheduling dynamic dataflow graphs with bounded memory using the token flow model. IEEE International Conference on Acoustics, Speech, and Signal Processing, 429-432.
5. First version of a data flow procedure language.;J. B.Dennis;Programming Symposium,1974