Xiaochun Wang – författare

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.Covers popular data compression methods and their solutions to aid in the development and application of data mining algorithmsIncludes projects and problems solved with Python to help readers create programs for both data compression and data mining problemsFocuses on the scalarization of data mining algorithms, leveraging data compression techniques to reduce dataset sizes and applying information theory principles to minimize computationsSimplifies the content of the field of data compression by covering topics that are widely useful from a data mining perspective

This book advances research on mobile robot localization in unknown environments by focusing on machine-learning-based natural scene recognition. The respective chapters highlight the latest developments in vision-based machine perception and machine learning research for localization applications, and cover such topics as: image-segmentation-based visual perceptual grouping for the efficient identification of objects composing unknown environments; classification-based rapid object recognition for the semantic analysis of natural scenes in unknown environments; the present understanding of the Prefrontal Cortex working memory mechanism and its biological processes for human-like localization; and the application of this present understanding to improve mobile robot localization. The book also features a perspective on bridging the gap between feature representations and decision-making using reinforcement learning, laying the groundwork for future advances in mobile robot navigation research.

This book advances research on mobile robot localization in unknown environments by focusing on machine-learning-based natural scene recognition.

This book enriches unsupervised outlier detection research by proposing several new distance-based and density-based outlier scores in a k-nearest neighbors’ setting. The respective chapters highlight the latest developments in k-nearest neighbor-based outlier detection research and cover such topics as our present understanding of unsupervised outlier detection in general; distance-based and density-based outlier detection in particular; and the applications of the latest findings to boundary point detection and novel object detection. The book also offers a new perspective on bridging the gap between k-nearest neighbor-based outlier detection and clustering-based outlier detection, laying the groundwork for future advances in unsupervised outlier detection research.The authors hope the algorithms and applications proposed here will serve as valuable resources for outlier detection researchers for years to come.

This book enriches unsupervised outlier detection research by proposing several new distance-based and density-based outlier scores in a k-nearest neighbors’ setting. The respective chapters highlight the latest developments in k-nearest neighbor-based outlier detection research and cover such topics as our present understanding of unsupervised outlier detection in general; distance-based and density-based outlier detection in particular; and the applications of the latest findings to boundary point detection and novel object detection. The book also offers a new perspective on bridging the gap between k-nearest neighbor-based outlier detection and clustering-based outlier detection, laying the groundwork for future advances in unsupervised outlier detection research.The authors hope the algorithms and applications proposed here will serve as valuable resources for outlier detection researchers for years to come.