Compression Schemes for Mining Large Datasets, 1st Edition

  • Published By:
  • ISBN-10: 1447156072
  • ISBN-13: 9781447156079
  • DDC: 006.4
  • Grade Level Range: College Freshman - College Senior
  • 197 Pages | eBook
  • Original Copyright 2013 | Published/Released May 2014
  • This publication's content originally published in print form: 2013

  • Price:  Sign in for price



This book 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. Features: 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.

Table of Contents

Front Cover.
Other Frontmatter.
Title Page.
Copyright Page.
1: Introduction.
2: Data Mining Paradigms.
3: Run-Length-Encoded Compression Scheme.
4: Dimensionality Reduction by Subsequence Pruning.
5: Data Compaction through Simultaneous Selection of Prototypes and Features.
6: Domain Knowledge-Based Compaction.
7: Optimal Dimensionality Reduction.
8: Big Data Abstraction through Multiagent Systems.
Appendix: Intrusion Detection Dataset—Binary Representation.