Data Mining, Southeast Asia EditionElsevier, 2006 M04 6 - 800 pages Our ability to generate and collect data has been increasing rapidly. Not only are all of our business, scientific, and government transactions now computerized, but the widespread use of digital cameras, publication tools, and bar codes also generate data. On the collection side, scanned text and image platforms, satellite remote sensing systems, and the World Wide Web have flooded us with a tremendous amount of data. This explosive growth has generated an even more urgent need for new techniques and automated tools that can help us transform this data into useful information and knowledge. Like the first edition, voted the most popular data mining book by KD Nuggets readers, this book explores concepts and techniques for the discovery of patterns hidden in large data sets, focusing on issues relating to their feasibility, usefulness, effectiveness, and scalability. However, since the publication of the first edition, great progress has been made in the development of new data mining methods, systems, and applications. This new edition substantially enhances the first edition, and new chapters have been added to address recent developments on mining complex types of data— including stream data, sequence data, graph structured data, social network data, and multi-relational data.
|
From inside the book
... Partitioning Methods 401 7.4.1 Classical Partitioning Methods: k-Means and k-Medoids 402 7.4.2 Partitioning Methods in Large Databases: From k-Medoids to CLARANS 407 Hierarchical Methods 408 7.5.1 Agglomerative and Divisive Hierarchical ...
... partitions, which are processed in parallel. The results from the partitions are then merged. Moreover, the high cost of some data mining processes promotes the need for incremental data mining algorithms that incorporate database ...
... partitioning the data into smaller subsets, computing the measure for each subset, and then merging the results in order to arrive at the measure's value for the original (entire) data set. Both sum() and count() are distributive ...
... partition Thus the computation of the variance and standard deviation is scalable in large databases. Graphic ... Partitioning rules for constructing histograms for numerical attributes are discussed in Section 2.5.4. In an equal-width ...
... Partition into (equal-frequency) bins: Bin 1:4, 8, 15 Bin 2:21, 21, 24 Bin 3:25, 28, 34 Smoothing by bin means: Bin ... partitioned into equal-frequency bins of size 3 (i.e., each bin contains three values). In smoothing by bin means ...
Contents
1 | |
47 | |
105 | |
4 Data Cube Computation and Data Generalization | 157 |
5 Mining Frequent Patterns Associations and Correlations | 227 |
6 Classification and Prediction | 285 |
7 Cluster Analysis | 383 |
8 Mining Stream TimeSeries and Sequence Data | 467 |
9 Graph Mining Social Network Analysis and Multirelational Data Mining | 535 |
10 Mining Object Spatial Multimedia Text and Web Data | 591 |
11 Applications and Trends in Data Mining | 649 |
An Introduction to Microsofts OLE DB for Data Mining | 691 |
Bibliography | 703 |
Other editions - View all
Common terms and phrases
Popular passages
References to this book
Geographic Data Mining and Knowledge Discovery Harvey J. Miller,Jiawei Han No preview available - 2003 |