Quantization of Continuous Data for Pattern Based Rule Extraction

Quantization of Continuous Data for Pattern Based Rule Extraction

Author: 
Hamilton-Wright, Andrew
Place: 
Hershey
Publisher: 
IGI Global
Date published: 
2008
Responsibility: 
Stashuk, Daniel W., jt.author
Editor: 
Wang, John
Journal Title: 
Encyclopedia of Data Warehousing and Mining, Second Edition
Source: 
Encyclopedia of Data Warehousing and Mining, Second Edition
Abstract: 

A great deal of interesting real-world data is encountered through the analysis of continuous variables, however many of the robust tools for rule discovery and data characterization depend upon the underlying data existing in an ordinal, enumerable or discrete data domain. Tools that fall into this category include much of the current work in fuzzy logic and rough sets, as well as all forms of event-based pattern discovery tools based on probabilistic inference. Through the application of discretization techniques, continuous data is made accessible to the analysis provided by the strong tools of discrete-valued data mining. The most common approach for discretization is quantization, in which the range of observed continuous valued data are assigned to a fixed number of quanta, each of which covers a particular portion of the range within the bounds provided by the most extreme points observed within the continuous domain. This chapter explores the effects such quantization may have, and the techniques that are available to ameliorate the negative effects of these efforts, notably fuzzy systems and rough sets.

CITATION: Hamilton-Wright, Andrew. Quantization of Continuous Data for Pattern Based Rule Extraction edited by Wang, John . Hershey : IGI Global , 2008. Encyclopedia of Data Warehousing and Mining, Second Edition - Available at: https://library.au.int/quantization-continuous-data-pattern-based-rule-extraction