Data Compression for Data Mining Algorithms

Erscheinungsjahr 2026
ISBN: 978-0-443-40541-9
Verlag: Elsevier Science

Buch, Englisch, 250 Seiten, Format (B × H): 191 mm x 235 mm, Gewicht: 449 g

Data Compression for Data Mining Algorithms tackles the important problems in the design of more efficient data mining algorithms by way of data compression techniques and provides the first systematic and comprehensive description of the relationships between data compression mechanisms and the computations involved in data mining algorithms. Data mining algorithms are powerful analytical techniques used across various disciplines, including business, engineering, and science. However, in the big data era, tasks such as association rule mining and classification often require multiple scans of databases, while clustering and outlier detection methods typically depend on Euclidean distance for similarity measures, leading to high computational costs.

Data Compression for Data Mining Algorithms addresses these challenges by focusing on the scalarization of data mining algorithms, leveraging data compression techniques to reduce dataset sizes and applying information theory principles to minimize computations involved in tasks such as feature selection and similarity computation. The book features the latest developments in both lossless and lossy data compression methods and provides a comprehensive exposition of data compression methods for data mining algorithm design from multiple points of view.

Key discussions include Huffman coding, scalar and vector quantization, transforms, subbands, wavelet-based compression for scalable algorithms, and the role of neural networks, particularly deep learning, in feature selection and dimensionality reduction. The book’s contents are well-balanced for both theoretical analysis and real-world applications, and the chapters are well organized to compose a solid overview of the data compression techniques for data mining. To provide the reader with a more complete understanding of the material, projects and problems solved with Python are interspersed throughout the text.

Autoren/Hrsg.

Wang, Xiaochun

Fachgebiete

• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Automatische Datenerfassung, Datenanalyse
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering

Inhaltsverzeichnis

Part I: Foundation
1. Overview and Contributions
2. Introduction to Data Mining Algorithms
3. Introduction to Data Compression Methods

Part II: Association Rule Mining
4. Huffman Coding for Association Rule Mining
5. Arithmetic Coding for Maximal Frequent Itemsets Mining

Part III: Classification
6. Feature Subset Selection for Decision Tree Construction
7. Neural Networks for Decision Tree Construction
8. Principal Component Analysis for Decision Tree Construction
9. Dictionary Techniques for Support Vector Machine
10. Quantization for Support Vector Machine

Part IV: Clustering and Outlier Detection
11. A Sparse Data Representation for Clustering
12. Dictionary Coding Based Compression for Clustering
13. Nearest Neighbor Based Compression for Outlier Detection
14. Huffman Coding for Outlier Detection
15. Arithmetic Coding for Outlier Detection

Über Autor(innen)

Wang, Xiaochun
Dr. Xiaochun Wang received her BS degree from Beijing University and her MS degree in data compression and PhD degree in mobile robotics from the Department of Electrical Engineering and Computer Science at Vanderbilt University. She was an associate professor at the School of Software Engineering at Xi'an Jiaotong University and taught Database Management and Data Mining courses from 2010 to 2021. She currently works as a senior scientist at Xi'an Tuowei Hi-Tech Corporation. Her research interests include data mining, pattern recognition, signal processing, and computer vision.