Stock photo: cover may vary
Compression Schemes for Mining Large Datasets: A Machine Learning Perspective (Advances in Computer Vision and Pattern Recognition) Hardback - 2013
by Ravindra Babu, T
- Used
A$118.01
A$5.82
Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Standard delivery: 2 to 14 days
Ships from GreatBookPrices (Maryland, United States)
Details
- Title Compression Schemes for Mining Large Datasets: A Machine Learning Perspective (Advances in Computer Vision and Pattern Recognition)
- Author Ravindra Babu, T
- Binding Hardback
- Condition New
- Pages 197
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2013-12-04
- Features Glossary
- Bookseller's Inventory # 20388452
- 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 5
About GreatBookPrices Maryland, United States
Biblio member since 2024
Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.
Reader reviews for Compression Schemes for Mining Large Datasets: A Machine Learning Perspective (Advances in Computer Vision and Pattern Recognition)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
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.
