A Framework for Fast Classification Algorithms
Year: 2008
Type: article
Abstract: Today, due to globalization of the world the size of data set is increasing, it is necessary to discover the \nknowledge. The discovery of knowledge can be typically in the form of association rules, classification rules, \nclustering, discovery of frequent episodes and deviation detection. Fast and accurate classifiers for large \ndatabases are an important task in data mining. There is growing evidence that integrating classification and \nassociation rules mining, classification approaches based on heuristic, greedy search like decision tree induction. \nEmerging associative classification algorithms have shown good promises on producing accurate classifiers. In \nthis paper we focus on performance of associative classification and present a parallel model for classifier \nbuilding. For classifier building some parallel-distributed algorithms have been proposed for decision tree \ninduction but so far no such work has been reported for associative classification.
Authors: Thakur Ghanshyam, Ramesh Jain
Institution: Universidad Politécnica de Madrid
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2187467777
