BN.com Gift Guide

Introduction to Data Mining / Edition 1

Hardcover (Print)
Rent
Rent from BN.com
$42.95
(Save 72%)
Est. Return Date: 02/20/2015
Used and New from Other Sellers
Used and New from Other Sellers
from $132.52
Usually ships in 1-2 business days
(Save 12%)
Other sellers (Hardcover)
  • All (14) from $132.52   
  • New (11) from $139.43   
  • Used (3) from $132.52   

Overview

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.

Read More Show Less

Product Details

  • ISBN-13: 9780321321367
  • Publisher: Addison-Wesley
  • Publication date: 5/2/2005
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 769
  • Sales rank: 136,311
  • Product dimensions: 7.70 (w) x 9.30 (h) x 1.60 (d)

Table of Contents

1 Introduction

1.1 What is Data Mining?

1.2 Motivating Challenges

1.3 The Origins of Data Mining

1.4 Data Mining Tasks

1.5 Scope and Organization of the Book

1.6 Bibliographic Notes

1.7 Exercises

2 Data

2.1 Types of Data

2.2 Data Quality

2.3 Data Preprocessing

2.4 Measures of Similarity and Dissimilarity

2.5 Bibliographic Notes

2.6 Exercises

3 Exploring Data

3.1 The Iris Data Set

3.2 Summary Statistics

3.3 Visualization

3.4 OLAP and Multidimensional Data Analysis

3.5 Bibliographic Notes

3.6 Exercises

4 Classification: Basic Concepts, Decision Trees, and Model Evaluation

4.1 Preliminaries

4.2 General Approach to Solving a Classification Problem

4.3 Decision Tree Induction

4.4 Model Overfitting

4.5 Evaluating the Performance of a Classifier

4.6 Methods for Comparing Classifiers

4.7 Bibliographic Notes

4.8 Exercises

5 Classification: Alternative Techniques

5.1 Rule-Based Classifier

5.2 Nearest-Neighbor Classifiers

5.3 Bayesian Classifiers

5.4 Artificial Neural Network (ANN)

5.5 Support Vector Machine (SVM)

5.6 Ensemble Methods

5.7 Class Imbalance Problem

5.8 Multiclass Problem

5.9 Bibliographic Notes

5.10 Exercises

6 Association Analysis: Basic Concepts and Algorithms

6.1 Problem Definition

6.2 Frequent Itemset Generation

6.3 Rule Generation

6.4 Compact Representation of Frequent Itemsets

6.5 Alternative Methods for Generating Frequent Itemsets

6.6 FP-Growth Algorithm

6.7 Evaluation of Association Patterns

6.8 Effect of Skewed Support Distribution

6.9 Bibliographic Notes

6.10 Exercises

7 Association Analysis: Advanced Concepts

7.1 Handling Categorical Attributes

7.2 Handling Continuous Attributes

7.3 Handling a Concept Hierarchy

7.4 Sequential Patterns

7.5 Subgraph Patterns

7.6 Infrequent Patterns

7.7 Bibliographic Notes

7.8 Exercises

8 Cluster Analysis: Basic Concepts and Algorithms

8.1 Overview

8.2 K-means

8.3 Agglomerative Hierarchical Clustering

8.4 DBSCAN

8.5 Cluster Evaluation

8.6 Bibliographic Notes

8.7 Exercises

9 Cluster Analysis: Additional Issues and Algorithms

9.1 Characteristics of Data, Clusters, and Clustering Algorithms

9.2 Prototype-Based Clustering

9.3 Density-Based Clustering

9.4 Graph-Based Clustering

9.5 Scalable Clustering Algorithms

9.6 Which Clustering Algorithm?

9.7 Bibliographic Notes

9.8 Exercises

10 Anomaly Detection

10.1 Preliminaries

10.2 Statistical Approaches

10.3 Proximity-Based Outlier Detection

10.4 Density-Based Outlier Detection

10.5 Clustering-Based Techniques

10.6 Bibliographic Notes

10.7 Exercises

Appendix A Linear Algebra

Appendix B Dimensionality Reduction

Appendix C Probability and Statistics

Appendix D Regression

Appendix E Optimization

Author Index

Subject Index

Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star

(1)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted August 1, 2005

    superb description of clusters

    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.

    2 out of 2 people found this review helpful.

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)