Bültmann & Gerriets
Compression Schemes for Mining Large Datasets
A Machine Learning Perspective
von T. Ravindra Babu, M. Narasimha Murty, S. V. Subrahmanya
Verlag: Springer London
Reihe: Advances in Computer Vision and Pattern Recognition
E-Book / PDF
Kopierschutz: PDF mit Wasserzeichen

Hinweis: Nach dem Checkout (Kasse) wird direkt ein Link zum Download bereitgestellt. Der Link kann dann auf PC, Smartphone oder E-Book-Reader ausgeführt werden.
E-Books können per PayPal bezahlt werden. Wenn Sie E-Books per Rechnung bezahlen möchten, kontaktieren Sie uns bitte.

ISBN: 978-1-4471-5607-9
Auflage: 2013
Erschienen am 19.11.2013
Sprache: Englisch
Umfang: 197 Seiten

Preis: 53,49 €

Biografische Anmerkung
Inhaltsverzeichnis
Klappentext

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.



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



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.


andere Formate
weitere Titel der Reihe