
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
As data mining algorithms are typically applied to sizable volumes of high-dimensional data, these can result in large storage requirements and inefficient computation times. This unique text/reference addresses the challenges of data abstraction generation using a least number of database scans, compressing data through novel lossy and non-lossy schemes, and carrying out clustering and classification directly in the compressed domain. Schemes are presented which are shown to be efficient both in terms of space and time, while simultaneously providing the same or better classification accuracy, as illustrated using high-dimensional handwritten digit data and a large intrusion detection dataset. Topics and features: Presents a concise introduction to data mining paradigms, data compression, and mining compressed data Describes a non-lossy compression scheme based on run-length encoding of patterns with binary valued features Proposes a lossy compression scheme that recognizes a pattern as a sequence of features and identifying subsequences Examines whether the identification of prototypes and features can be achieved simultaneously through lossy compression and efficient clustering Discusses ways to make use of domain knowledge in generating abstraction Reviews optimal prototype selection using genetic algorithms Suggests possible ways of dealing with big data problems using multiagent systems A must-read for all researchers involved in data mining and big data, the book proposes each algorithm within a discussion of the wider context, implementation details and experimental results. These are further supported by bibliographic notes and a glossary.
This book addresses the significant challenges of data abstraction generation, compression, and direct analysis within compressed domains for large, high-dimensional datasets. The author, S. V. Subrahmanya, a researcher in data mining, presents novel lossy and non-lossy compression schemes designed to reduce storage requirements and improve computation times. The text details methods for achieving this with minimal database scans, enabling clustering and classification directly on compressed data, often yielding equivalent or superior accuracy compared to traditional approaches.
The book is positioned as a valuable resource for researchers in data mining and big data, offering a unique perspective on compression techniques. It aims to provide algorithms within their broader context, supported by implementation details, experimental results, bibliographic notes, and a glossary. The text is designed to be a comprehensive reference for those grappling with the computational and storage demands of large datasets.
Page Count:
197
Publication Date:
2013-01-01
ISBN-10:
1447156064
ISBN-13:
9781447156062
No comments yet. Be the first to share your thoughts!