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
Results 1-5 of 91
... tuples) in comparison with mining a small amount of data (such as a few hundred tuple data set)? Outline the major research challenges of data mining in one specific application domain, such as stream/sensor data analysis ...
... tuples have no recorded value. For your analysis, you would like to include information as to whether each item purchased was advertised as on sale, yet you discover that this information has not been recorded. Furthermore, users of ...
... tuples, ai and bi are the respective values of A and B in tuple i, A and B are the respective mean values of A and B, σA and σB are the respective standard deviations of A and B (as defined in Section 2.2.2), and Σ(ai) is the sum of the ...
... tuples they represent (or to the actual tuples). An index tree can therefore store aggregate and detail data at varying levels of resolution or abstraction. It provides a hierarchy of clusterings of the data set, where each cluster has ...
... tuples from D (s < N), where the probability of drawing any tuple in D is 1/N, that is, all tuples are equally likely to be sampled. Simple random sample with replacement (SRSWR) of size s: This is similar to SRSWOR, except that each time a ...
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 |