Compression Schemes for Mining Large Datasets
A Machine Learning Perspective
(Sprache: Englisch)
This book addresses the challenges of data abstraction generation using the 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.
Jetzt vorbestellen
versandkostenfrei
Buch (Gebunden)
Fr. 59.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Compression Schemes for Mining Large Datasets “
This book addresses the challenges of data abstraction generation using the 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.
Klappentext zu „Compression Schemes for Mining Large Datasets “
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.
Inhaltsverzeichnis zu „Compression Schemes for Mining Large Datasets “
Introduction.- Data Mining Paradigms.- Run-Length Encoded Compression Scheme.- Dimensionality Reduction by Subsequence Pruning.- Data Compaction through Simultaneous Selection of Prototypes and Features.- Domain Knowledge-Based Compaction.- Optimal Dimensionality Reduction.- Big Data Abstraction through Multiagent Systems.- Intrusion Detection Dataset: Binary Representation.
Autoren-Porträt von T. Ravindra Babu, M. Narasimha Murty, S.V. Subrahmanya
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.
Bibliographische Angaben
- Autoren: T. Ravindra Babu , M. Narasimha Murty , S.V. Subrahmanya
- 2014, 2013, XVI, 197 Seiten, 3 farbige Abbildungen, Masse: 15,9 x 24,4 cm, Gebunden, Englisch
- Verlag: Springer, Berlin
- ISBN-10: 1447156064
- ISBN-13: 9781447156062
- Erscheinungsdatum: 04.12.2013
Sprache:
Englisch
Kommentar zu "Compression Schemes for Mining Large Datasets"
0 Gebrauchte Artikel zu „Compression Schemes for Mining Large Datasets“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Compression Schemes for Mining Large Datasets".
Kommentar verfassen