Research indexBook chapter
Quantization based Sequence Generation and Subsequence Pruning for Data Mining Applications
Babu, Murty, Subrahmanya
IGI Global eBooks6 Dec 2012
NobleIDark:/48914/w1/20260525/C75B32EEDOI10.4018/978-1-4666-2455-9.ch038
Quantization based Sequence Generation and Subsequence Pruning for Data Mining Applications
Babu, Murty, Subrahmanya · IGI Global eBooks · 2012 · Subscription
NobleIDark:/48914/w1/20260525/C75B32EEDOI10.4018/978-1-4666-2455-9.ch038
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Data Mining deals with efficient algorithms for dealing with large data. When such algorithms are combined with data compaction, they would lead to superior performance. Approaches to deal with large data include working with representatives of data instead of entire data. The representatives should preferably be generated with minimal data scans. In the current chapter we discuss working with methods of lossy and non-lossy data compression methods combined with clustering and classification of large datasets. We demonstrate the working of such schemes on two large data sets.