About this book
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.
- DOI https://doi.org/10.1007/978-1-4471-5607-9
- Copyright Information Springer-Verlag London 2013
- Publisher Name Springer, London
- eBook Packages Computer Science Computer Science (R0)
- Print ISBN 978-1-4471-5606-2
- Online ISBN 978-1-4471-5607-9
- Series Print ISSN 2191-6586
- Series Online ISSN 2191-6594
- Buy this book on publisher's site