Jump to ratings and reviews
Rate this book

The Top Ten Algorithms in Data Mining

Rate this book
Identifying some of the most influential algorithms that are widely used in the data mining community, The Top Ten Algorithms in Data Mining provides a description of each algorithm, discusses its impact, and reviews current and future research. Thoroughly evaluated by independent reviewers, each chapter focuses on a particular algorithm and is written by either the original authors of the algorithm or world-class researchers who have extensively studied the respective algorithm. The book concentrates on the following important C4.5, k -Means, SVM, Apriori, EM, PageRank, AdaBoost, k NN, Naive Bayes, and CART. Examples illustrate how each algorithm works and highlight its overall performance in a real-world application. The text covers key topics―including classification, clustering, statistical learning, association analysis, and link mining―in data mining research and development as well as in data mining, machine learning, and artificial intelligence courses. By naming the leading algorithms in this field, this book encourages the use of data mining techniques in a broader realm of real-world applications. It should inspire more data mining researchers to further explore the impact and novel research issues of these algorithms.

230 pages, Hardcover

First published April 1, 2009

3 people are currently reading
27 people want to read

About the author

Xindong Wu

13 books

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
5 (45%)
4 stars
4 (36%)
3 stars
1 (9%)
2 stars
0 (0%)
1 star
1 (9%)
Displaying 1 - 2 of 2 reviews
23 reviews2 followers
March 19, 2013
Great introduction to the subject for a reader with good mathematical background looking for theoretical foundations of data mining methods as well as for their practical side.
Displaying 1 - 2 of 2 reviews

Can't find what you're looking for?

Get help and learn more about the design.