Class Association Rule Pada Metode Associative Classification

https://doi.org/10.22146/ijccs.5207

Eka Karyawati(1*), Edi Winarko(2),

(1) 
(2) Fakultas matematika dan Ilmu Pengetahuan Alam, Universitas Gadjah Mada
(*) Corresponding Author

Abstract


Frequent patterns (itemsets) discovery is an important problem in associative classification rule mining.  Differents approaches have been proposed such as the Apriori-like, Frequent Pattern (FP)-growth, and Transaction Data Location (Tid)-list Intersection algorithm. This paper focuses on surveying and comparing the state of the art associative classification techniques with regards to the rule generation phase of associative classification algorithms.  This phase includes frequent itemsets discovery and rules mining/extracting methods to generate the set of class association rules (CARs).  There are some techniques proposed to improve the rule generation method.  A technique by utilizing the concepts of discriminative power of itemsets can reduce the size of frequent itemset.  It can prune the useless frequent itemsets. The closed frequent itemset concept can be utilized to compress the rules to be compact rules.  This technique may reduce the size of generated rules.  Other technique is in determining the support threshold value of the itemset. Specifying not single but multiple support threshold values with regard to the class label frequencies can give more appropriate support threshold value.  This technique may generate more accurate rules. Alternative technique to generate rule is utilizing the vertical layout to represent dataset.  This method is very effective because it only needs one scan over dataset, compare with other techniques that need multiple scan over dataset.   However, one problem with these approaches is that the initial set of tid-lists may be too large to fit into main memory. It requires more sophisticated techniques to compress the tid-lists.


Keywords


frequent itemset, CAR, apriori, FP-growth, tid-list, associative classification

Full Text:

PDF


References

[1]     Agrawal, R. & Srikant, R., 1994, Fast Algorithms for Mining Association Rule, In Proceedings of the 20th International Conference on Very Large Data Base, Morgan Kaufmann, Santiago, Chile, September 12-15.

 

[2]     Baralis, E. & Chiosano, S.,  2004, Essential Classification Rule Sets,  Journal of ACM Transactions on Database Systems, vol. 29, no. 4, pp. 635–674

 

[3]     Baralis, E., Chiusano, S. & Graza, P. 2004b, On Support Thresholds in Associative Classification, In Proceedings of the 2004 ACM Symposium on Applied Computin,  Nicosia, Cyprus, March 14 – 17.

 

[4]     Cheng, H., Yan, X., Han, J. & Yu, P.S., 2008,  Direct Discriminative Pattern Mining for Effective Classification,  In Proceedings of the 24th IEEE International Conference on Data Engineering, Cancún, México, April 7-12.

 

[5]     Han, J., Pei, J., Yin, Y. & Mao, R.,  2004,  Mining Frequent Patterns without Candidate Generation: A Frequent Pattern Tree Approach,  Journal of Data Mining and Knowledge Discovery, vol. 8,  pp. 53-87

 

[6]     Li, W., Han, J. & Pei, J.,  2001, CMAR: Accurate and Efficient Classification Based on Multiple-Class Association Rule,  In Proceedings of the International Conference on Data Mining (ICDM’01), San Jose, CA, November 29 – December 2.

 

[7]     Liu, B., Hsu, W. & Ma, Y., 1998, Integrating Classification and Association Rule Mining, In Proceedings of the International Conference on Knowledge Discovery and Data Mining, New York, August 27 – 31.

 

[8]     Liu, B., Ma, Y. & Wong, C.K., 2000, Improving an Association Rule Based Classifier,  In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery,  Lyon, France, September 13-16.

 

[9]     Savasere, A., Omiecinski, E. & Navathe, S., 1995,  An Efficient Algorithm for Mining Association Rules in Large Databases, In Proceedings of the 21st conference on Very Large Databases (VLDB’95), Zurich,Switzerland, September 11-15.

 

[10]  Tang, Z. & Liao, Q., 2007,  A New Class Based Associative Classification Algorithm, IAENG International Journal of Applied Mathematics, vol. 36: 2.

 

[11]  Thabtah, F., Cowling, P. & Peng, Y., 2005, MCAR: Multi-Class Classification Based on Association Rule Approach, In Proceeding of the 3rd IEEE International Conference on Computer Systems and Applications, Cairo, Egypt, January 3-6.

 

[12]  Thabtah, F.,  2007, A Review of Associative Classification Mining,  Journal of The Knowledge Engineering Review, vol. 22:1,  pp. 37-65.

 

[13]  Thabtah, F., Mahmood, Q. & McCluskey, L.,  2008,  Looking at the Class Associative Classification Training Algorithm,  In Proceedings of the 5th International conference on Information Technology: New Generation, Las Vegas, Nevada April 7-9.

 

[14]  Zaki, M., Parthasarathy, S., Ogihara, M. & Li, W., 1997,  New Algorithms for Fast Discovery of Association Rules, In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, Newport Beach, CA, August 14-17.



DOI: https://doi.org/10.22146/ijccs.5207

Article Metrics

Abstract views : 164 | views : 168

Refbacks

  • There are currently no refbacks.




Copyright (c) 2011 IJCCS - Indonesian Journal of Computing and Cybernetics Systems

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.



Indonesian Journal of Computing and Cybernetics Systems
(IJCCS) ISSN 1978-1520 (print); ISSN 2460-7258 (online)
is a scientific journal the results of Computing and Cybernetics Systems
A publication of IndoCEISS.
Gedung S1 Ruang 416 FMIPA UGM, Sekip Utara, Yogyakarta 55281
Fax: +62274 555133
email:ijccs.mipa@ugm.ac.id | http://jurnal.ugm.ac.id/ijccs


Creative Commons License
IJCCS by http://jurnal.ugm.ac.id/ijccs is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
View My Stats1
View My Stats2