Introduction to Data Mining [Hardcover]

Pang-Ning Tan (Author), Michael Steinbach (Author), Vipin Kumar (Author)

Book Description

Publication Date: May 12, 2005 | ISBN-10: 0321321367 | ISBN-13: 978-0321321367 | Edition: 1

Introduction to Data Mining presents fundamental concepts and algorithms for those learning data mining for the first time. Each major topic is organized into two chapters, beginning with basic concepts that provide necessary background for understanding each data mining technique, followed by more advanced concepts and algorithms.

Product Details

• Hardcover: 769 pages
• Publisher: Addison-Wesley; 1 edition (May 12, 2005)
• Language: English
• ISBN-10: 0321321367
• ISBN-13: 978-0321321367
• Product Dimensions: 7.8 x 1.3 x 9.4 inches
• Shipping Weight: 3.1 pounds (View shipping rates and policies)
• Average Customer Review: 4.2 out of 5 stars  See all reviews (21 customer reviews)
• Amazon Best Sellers Rank: #30,371 in Books (See Top 100 in Books)
  • #2 in Books > Computers & Technology > Databases > Beginning & Introductory
  • #17 in Books > Computers & Technology > Databases > Data Warehousing
  • #25 in Books > Computers & Technology > Networking > Network Administration

Most Helpful Customer Reviews

63 of 64 people found the following review helpful

5.0 out of 5 stars Data mining book focusing on clustering September 20, 2006

By Sandro Saitta

Format:Hardcover

I decided to start with this book as I think it is the most convenient to start in the data mining field. One big advantage of the book is the way data mining techniques are explained. It is mainly based on textual and graphical explanations. There is little equations, only what is necessary to implement the algorithms.

This book widely cover areas such as data preparation and understanding, classification, anomaly detection, association analysis and clusering. Although the book has a strong emphasis on the two last ones, nearly all standard data mining techniques are at least briefly discussed. However, this book does only have a fiew pages about kernel methods for example. Indeed, it is normal, as kernel methods are more suitable for machine learning (I mean making prediction) than data mining (I mean looking for description).

Therefore, this book is:

* able to explain data mining without thousands of equations

* a good way to start with data mining

* covering nearly all standard data mining techniques

* focused on association analysis and clustering

and it is not:

* a good book for kernel methods and other advanced techniques

* written in the statistical nor in the database perspective

My comment: if you are in the data mining field and not comming from mathematics or databases, then you really should buy this book.

51 of 54 people found the following review helpful

5.0 out of 5 stars superb description of clusters July 31, 2005

By W Boudville HALL OF FAMETOP 500 REVIEWERVINE™ VOICE

Format:Hardcover

As databases keep growing unabatedly, so too has the need for smart data mining. For a competitive edge in business, it helps to be able to analyse your data in unique ways. This text gives you a thorough education in state of the art data mining. Appropriate for both a student and a professional in the field.

The extensive problem sets are well suited for the student. These often expand on concepts in the narrative, and are worth tackling.

The central theme in the book is how to classify data, or find associations or clusters within it.

Cluster analysis gets two chapters that are superbly done. These summarise decades of research into methods of grouping data into clusters. Usually hard to do, because an element of subjectivity can creep into the results. If your data is scattered in some n-dimensional space, then clusters might exist. But how to find them? The chapters show that the number of clusters and the constituents of these can depend on which method you adopt, and various initial conditions, like [essentially] seed values for clusters, if you choose a prototype cluster method like K-means.

The descriptions of the cluster algorithms are succinct. Why is this useful? Because it helps you easily understand the operations of the algorithms, without drowning you in low level detail. Plus, by presenting a meta-level comparison between the algorithms, you can develop insight into rolling your own methods, specific to your data.

Part of my research involves finding new ways to make clusters, and the text was very useful in explaining the existing ideas.

39 of 43 people found the following review helpful

4.0 out of 5 stars Good overview, but needs to include real-world case studies April 17, 2006

By Dr. Lee D. Carlson HALL OF FAMEVINE™ VOICE

Format:Hardcover|Amazon Verified Purchase

Data mining could be considered to be "Artificial Intelligence Lite", since it deals with many of the same issues in learning, classification, and analysis as they occur in the field of artificial intelligence but does not have as its goal the construction of "thinking machines." Instead, the emphasis is on practical problems that are important in business and industry, even though the solutions of many of these problems makes use of techniques that a thinking machine should be expected to have. Data mining has become an enormous industry, and has even been the subject of political and legal concerns due to the efforts of some governments to mine data on its citizens. This book gives a general overview of data mining with emphasis on classification and associative analysis. Anyone who is interested in data mining could read the book, but some rather sophisticated background in mathematics will be needed to read some of the sections. Pseudocode is given throughout the book to illustrate the different data mining algorithms. There are also exercises at the end of each chapter, but noticeably missing in the book is the inclusion of real case studies in data mining. The inclusion of these case studies would alert the reader to the fact that data mining is of great interest from the standpoint of business and industry, and would lessen the belief that data mining is just another academic field or just another branch of statistics.

Speaking somewhat loosely, the goal of data mining is to find interesting patterns in massive amounts of data or the classification of such patterns. This entails of course that one have a notion of what is "interesting" and one of the main problems in data mining is to find suitable `interestingness measures'. And since one is typically dealing with large amounts of data, one must use various statistical sampling and preprocessing techniques to massage the data and obtain a `representative' sample of the original data. In addition, one must be able to handle data that is `anomalous', i.e. data that has characteristics that are markedly different from most of the other data, or that has attributes that are unusual if compared with typical values for those attributes. These issues and techniques are discussed in detail in the first three chapters of the book, where the authors outline some of the bread-and-butter topics needed for effective manipulation of data.

The real substance and power of data mining comes from its role in classification and for discovering interesting patterns in huge data sets. The authors, in chapters 4 - 7, discuss various powerful techniques for data classification and association analysis. Association analysis in particular has been used quite extensively in recent years, due to the use of market basket transactions in on-line purchasing and the goal of marketers to learn the purchasing behavior of their customers. Association analysis uncovers relationships in the marketing data in the form of `association rules'. For disjoint itemsets X and Y, an association rule is a logical implication expression between these itemsets that has a certain `strength' that is measured by its `support' and `confidence.' The support measures how often a rule is applicable to a given data set, while the confidence measures how frequently the items in Y appear in X. The support reflects the ability of the rule to be not due to chance alone, while the confidence measures the reliability of the rule inference. The collection of all association rules that can be formed from a data set is too large to be practical and so strategies must be developed to prune the number of rules. The authors discuss in detail various methods for dealing with this computational drawback, such as `frequent itemset generation' and `rule generation.'

The detection of anomalies consists of the identification of `outliers', which as the name implies are data objects that lie "far away" from the other data objects. It remains of course to quantity what it means to be "far away" and for this reason this branch of data mining, as the author points out, is sometimes called `deviation detection' or `exception mining'. The omission of outliers is sometimes justified, since they are merely artifacts that only serve to alter the statistics of a particular data set. However, sometimes their presence signals important information, if not a major scientific discovery. Data mining therefore must contain tools that detect anomalies intelligently and efficiently. The authors discuss anomaly detection in fair detail, emphasizing the statistical techniques that are available to do it. They classify the techniques for anomaly detection as being `unsupervised', `supervised', and `semi-supervised'. As the name implies, supervised anomaly detection requires the existence of a training set with both anomalous and "normal" data with each class being labeled as such. When these labels are unavailable, one has to perform unsupervised anomaly detection, and for this approach to work the anomalies must be distinct from one another. If the normal data is labeled but the anomalies are not, one must do semi-supervised anomaly detection. The only weakness in the authors' discussion is that they do not include real-world case studies that illustrate the different techniques, such as clustering and density methods.