BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Compression Schemes for Mining Large Datasets: A Machine Learning Perspective

Compression Schemes for Mining Large Datasets: A Machine Learning Perspective

Compression Schemes for Mining Large Datasets: A Machine Learning Perspective Hardback - 2013

by T. Ravindra Babu

Add to wish list
  • New
  • Hardback
New

Description

Hardcover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; N/A
Ask the seller a question Add to wish list
A$105.18
A$15.57 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

  • Title Compression Schemes for Mining Large Datasets: A Machine Learning Perspective
  • Author T. Ravindra Babu
  • Binding Hardback
  • Condition New
  • Pages 197
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2013-12-04
  • Features Glossary
  • Bookseller's Inventory # ria9781447156062_inp
  • ISBN 9781447156062 / 1447156064
  • Weight 1.06 lbs (0.48 kg)
  • Dimensions 9.21 x 6.14 x 0.56 in (23.39 x 15.60 x 1.42 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Computers - General Information
  • Dewey Decimal Code 006.312
  • Quantity available 117

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for Compression Schemes for Mining Large Datasets: A Machine Learning Perspective

From the publisher

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.

From the rear cover

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 multiagentsystems

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.

About the author

Dr. T. Ravindra Babu is a Principal Researcher in the E-Commerce Research Labs at Infosys Ltd., Bangalore, India. Mr. S.V. Subrahmanya is Vice President and Research Fellow at the same organization. Dr. M. Narasimha Murty is a Professor in the Department of Computer Science and Automation at the Indian Institute of Science, Bangalore, India.

tracking-