earticle

논문검색

Generic Associative Classification Rules : A Comparative Study

초록

영어

Associative classification is a supervised classification approach, integrating association mining and classification. Several studies in data mining have shown that associative classification achieves higher classification accuracy than do traditional classification techniques. However, the associative classification suffers from a major drawback: The huge number of the generated classification rules which takes efforts to select the best ones in order to construct the classifier. To overcome such drawback, we have proposed an associative classification method that reduces associative classification rules without jeopardizing the classification accuracy. Moreover, we will introduce in this paper two different strategies to classify new instances based on some interestingness measures that arise from data mining literature in order to select the best rules during classification. A detailed description of this method is presented in this paper, as well as the experimentation study on 12 benchmark data sets proving that our approach is highly competitive in terms of accuracy in comparison with popular classification approaches.

목차

Abstract
 1. Introduction
 2. Basic Notions and Related Work
  2.1 Basic Notions
  2.2 Related Work
 3. Our Proposed Approach Based on Generic Associative Classification Rules
  3.1 Basic Definitions
  3.2 Learning Stage
  3.3 Classifying Stage
 4. Experimental Study
  4.1 Variation of Interestingness Measures Thresholds
  4.2 Generic Classification Rules Impact
  4.3 Robustness of Our Proposed Approach
 5. Conclusion
 References

저자정보

  • I. Bouzouita Computer Science Department, 1060 Tunis, Tunisia.
  • S. Elloumi Computer Science Department, 1060 Tunis, Tunisia.

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.