Applied data mining
By: authors, Guandong Xu, Yu Zong, Zhenglu Yang
Contributors: Zong, Yu (Computer scientist); Yang, Zhenglu
Publisher: CRC Press
Published: 2013
Language: eng
Number of pages: 272
ISBN-13: 9781466585836
Subjects: Data mining
Description: "In past decades, data mining has witnessed substantial advances by efforts from various communities. On the other hand, new research questions and practical challenges are continuously presented due to newly emerging topics and applications within the various fields closely related to human daily life, e.g. social media and social networking. This book aims to bridge the gap between the existing research and application progresses in traditional data mining and the latest advances in newly emerging information services. It explores the extension of well-studied algorithms and approaches into these new research arenas"--
Notes: Includes bibliographical references and index.
Table of contents: title: Pt. I Fundamentals; title: 1.Introduction; title: 1.1.Background; title: 1.1.1.Data Mining-Definitions and Concepts; title: 1.1.2.Data Mining Process; title: 1.1.3.Data Mining Algorithms; title: 1.2.Organization of the Book; title: 1.2.1.Part 1: Fundamentals; title: 1.2.2.Part 2: Advanced Data Mining; title: 1.2.3.Part 3: Emerging Applications; title: 1.3.The Audience of the Book; title: 2.Mathematical Foundations; title: 2.1.Organization of Data; title: 2.1.1.Boolean Model; title: 2.1.2.Vector Space Model; title: 2.1.3.Graph Model; title: 2.1.4.Other Data Structures; title: 2.2.Data Distribution; title: 2.2.1.Univariate Distribution; title: 2.2.2.Multivariate Distribution; title: 2.3.Distance Measures; title: 2.3.1.Jaccard distance; title: 2.3.2.Euclidean Distance; title: 2.3.3.Minkowski Distance; title: 2.3.4.Chebyshev Distance; title: 2.3.5.Mahalanobis Distance; title: 2.4.Similarity Measures; title: 2.4.1.Cosine Similarity; title: 2.4.2.Adjusted Cosine Similarity; title: 2.4.3.Kullback-Leibler Divergence; title: 2.4.4.Model-based Measures; title: 2.5.Dimensionality Reduction; title: Contents note continued: 2.5.1.Principal Component Analysis; title: 2.5.2.Independent Component Analysis; title: 2.5.3.Non-negative Matrix Factorization; title: 2.5.4.Singular Value Decomposition; title: 2.6.Chapter Summary; title: 3.Data Preparation; title: 3.1.Attribute Selection; title: 3.1.1.Feature Selection; title: 3.1.2.Discretizing Numeric Attributes; title: 3.2.Data Cleaning and Integrity; title: 3.2.1.Missing Values; title: 3.2.2.Detecting Anomalies; title: 3.2.3.Applications; title: 3.3.Multiple Model Integration; title: 3.3.1.Data Federation; title: 3.3.2.Bagging and Boosting; title: 3.4.Chapter Summary; title: 4.Clustering Analysis; title: 4.1.Clustering Analysis; title: 4.2.Types of Data in Clustering Analysis; title: 4.2.1.Data Matrix; title: 4.2.2.The Proximity Matrix; title: 4.3.Traditional Clustering Algorithms; title: 4.3.1.Partitional methods; title: 4.3.2.Hierarchical Methods; title: 4.3.3.Density-based methods; title: 4.3.4.Grid-based Methods; title: 4.3.5.Model-based Methods; title: 4.4.High-dimensional clustering algorithm; title: 4.4.1.Bottom-up Approaches; title: 4.4.2.Top-down Approaches; title: Contents note continued: 4.4.3.Other Methods; title: 4.5.Constraint-based Clustering Algorithm; title: 4.5.1.COP K-means; title: 4.5.2.MPCK-means; title: 4.5.3.AFCC; title: 4.6.Consensus Clustering Algorithm; title: 4.6.1.Consensus Clustering Framework; title: 4.6.2.Some Consensus Clustering Methods; title: 4.7.Chapter Summary; title: 5.Classification; title: 5.1.Classification Definition and Related Issues; title: 5.2.Decision Tree and Classification; title: 5.2.1.Decision Tree; title: 5.2.2.Decision Tree Classification; title: 5.2.3.Hunt's Algorithm; title: 5.3.Bayesian Network and Classification; title: 5.3.1.Bayesian Network; title: 5.3.2.Backpropagation and Classification; title: 5.3.3.Association-based Classification; title: 5.3.4.Support Vector Machines and Classification; title: 5.4.Chapter Summary; title: 6.Frequent Pattern Mining; title: 6.1.Association Rule Mining; title: 6.1.1.Association Rule Mining Problem; title: 6.1.2.Basic Algorithms for Association Rule Mining; title: 6.2.Sequential Pattern Mining; title: 6.2.1.Sequential Pattern Mining Problem; title: Contents note continued: 6.2.2.Existing Sequential Pattern Mining Algorithms; title: 6.3.Frequent Subtree Mining; title: 6.3.1.Frequent Subtree Mining Problem; title: 6.3.2.Data Structures for Storing Trees; title: 6.3.3.Maximal and closed frequent subtrees; title: 6.4.Frequent Subgraph Mining; title: 6.4.1.Problem Definition; title: 6.4.2.Graph Representation; title: 6.4.3.Candidate Generation; title: 6.4.4.Frequent Subgraph Mining Algorithms; title: 6.5.Chapter Summary; title: pt. II Advanced Data Mining; title: 7.Advanced Clustering Analysis; title: 7.1.Introduction; title: 7.2.Space Smoothing Search Methods in Heuristic Clustering; title: 7.2.1.Smoothing Search Space and Smoothing Operator; title: 7.2.2.Clustering Algorithm based on Smoothed Search Space; title: 7.3.Using Approximate Backbone for Initializations in Clustering; title: 7.3.1.Definitions and Background of Approximate Backbone; title: 7.3.2.Heuristic Clustering Algorithm based on Approximate Backbone; title: 7.4.Improving Clustering Quality in High Dimensional Space; title: Contents note continued: 7.4.1.Overview of High Dimensional Clustering; title: 7.4.2.Motivation of our Method; title: 7.4.3.Significant Local Dense Area; title: 7.4.4.Projective Clustering based on SLDAs; title: 7.5.Chapter Summary; title: 8.Multi-Label Classification; title: 8.1.Introduction; title: 8.2.What is Multi-label Classification; title: 8.3.Problem Transformation; title: 8.3.1.Binary Relevance and Label Powerset; title: 8.3.2.Classifier Chains and Probabilistic Classifier Chains; title: 8.3.3.Decompose the Label Set; title: 8.3.4.Transform Original Label Space to Another Space; title: 8.4.Algorithm Adaptation; title: 8.4.1.KNN-based methods; title: 8.4.2.Learn the Label Dependencies by the Statistical Models; title: 8.5.Evaluation Metrics and Datasets; title: 8.5.1.Evaluation Metrics; title: 8.5.2.Benchmark Datasets and the Statistics; title: 8.6.Chapter Summary; title: 9.Privacy Preserving in Data Mining; title: 9.1.The K-Anonymity Method; title: 9.2.The 1-Diversity Method; title: 9.3.The t-Closeness Method; title: 9.4.Discussion and Challenges; title: 9.5.Chapter Summary; title: Contents note continued: pt. III Emerging Applications; title: 10.Data Stream; title: 10.1.General Data Stream Models; title: 10.2.Sampling Approach; title: 10.2.1.Random Sampling; title: 10.2.2.Cluster Sampling; title: 10.3.Wavelet Method; title: 10.4.Sketch Method; title: 10.4.1.Sliding Window-based Sketch; title: 10.4.2.Count Sketch; title: 10.4.3.Fast Count Sketch; title: 10.4.4.Count Min Sketch; title: 10.4.5.Some Related Issues on Sketches; title: 10.4.6.Applications of Sketches; title: 10.4.7.Advantages and Limitations of Sketch Strategies; title: 10.5.Histogram Method; title: 10.5.1.Dynamic Construction of Histograms; title: 10.6.Discussion; title: 10.7.Chapter Summary; title: 11.Recommendation Systems; title: 11.1.Collaborative Filtering; title: 11.1.1.Memory-based Collaborative Recommendation; title: 11.1.2.Model-based Recommendation; title: 11.2.PLSA Method; title: 11.2.1.User Pattern Extraction and Latent Factor Recognition; title: 11.3.Tensor Model; title: 11.4.Discussion and Challenges; title: 11.4.1.Security and Privacy Issues; title: 11.4.2.Effectiveness Issue; title: 11.5.Chapter Summary; title: Contents note continued: 12.Social Tagging Systems; title: 12.1.Data Mining and Information Retrieval; title: 12.2.Recommender Systems; title: 12.2.1.Recommendation Algorithms; title: 12.2.2.Tag-Based Recommender Systems; title: 12.3.Clustering Algorithms in Recommendation; title: 12.3.1.K-means Algorithm; title: 12.3.2.Hierarchical Clustering; title: 12.3.3.Spectral Clustering; title: 12.3.4.Quality of Clusters and Modularity Method; title: 12.3.5.K-Nearest-Neighboring; title: 12.4.Clustering Algorithms in Tag-Based Recommender Systems; title: 12.5.Chapter Summary.