Name
Abstract | ||
|---|---|---|
Associative classification aims to discover a set of constrained association rules, called Class Association Rules (CARs). The consequent of a CAR is a singleton and is restricted to be a class label. Traditionally, the classifier is built by selecting a subset of CARs based on some interestingness measure. The proposed approach for associative classification, called Associative Classifier based on Closed Itemsets (ACCI), scans the dataset only once and generates a set of CARs based on closed itemsets (ClosedCARs) using a lattice based data structure. Subsequently, rule conflicts are removed and a subset of non-conflicting ClosedCARs which covers the entire training set is chosen as a classifier. The entire process is independent of the interestingness measure. Experimental results on benchmark datasets from UCI machine repository reveal that the achieved classifiers are more accurate than those built using existing approaches. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28490-8_3 | ACIIDS |
Keywords | Field | DocType |
class association rules,closed itemsets,associative classifier,associative classification,entire training set,association rule,uci machine,entire process,interestingness measure,non-conflicting closedcars | Data mining,Associative property,Lattice (order),Computer science,Associative classifier,Artificial intelligence,Classifier (linguistics),Training set,Data structure,Pattern recognition,Association rule learning,Singleton,Machine learning | Conference |
Volume | ISSN | Citations |
7197 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Naveen Kumar | 1 | 93 | 12.32 |
| Anamika Gupta | 2 | 16 | 1.78 |
| Vasudha Bhatnagar | 3 | 181 | 17.69 |