IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 4 - Issue 11, November 2015 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



An Improved Apriori Algorithm Established On Probability Matrix

[Full Text]

 

AUTHOR(S)

K. B. Agyapong, J. B. Hayfron-Acquah

 

KEYWORDS

Index Terms: Association Rule, Probability, Frequent Itemset, AND operation, Matrix.

 

ABSTRACT

Abstract: In this paper, the issue of scanning a large database is addressed by using probability matrix to generate the frequent itemset. The method eliminates the candidate having a subset which is not frequent. Currently in Computer Science and Data Mining, there are numerous mining algorithms of Associate Rule. Some of the supreme prevalent algorithms are the Apriori which extract frequent itemset from a large database. Although the Apriori algorithm is known to be the best for an Association Rule or Market Basket Analysis there are some challenges such as time wasting in scanning all the items found in the database through repetitive activities and the amount of memory space required as a result of having that large database being scanned. A comparison of the proposed algorithm with Apriori shows that the performance of the Improved Apriori is very promising.

 

REFERENCES

[1] Agrawal, R. and Srikant, R. (1994) . Fast algorithms for mining association rules in large databases. Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pages 487-499, Santiago, Chile, September 1994.

[2] Gao Hongbin, Pan Gu, Huan Yiming. An enriched Apriori algorithm based on the character of the frequent itemsets[J]. Computer engineering and design.2007,28(10):2273-2275.

[3] H.H.O. Nasereddin,”Stream Data mining, ”International Journal of Web Applications, vol. 1 no. 4 pp 183-190, 2009.

[4] M. Halkidi, “Quality assessment and uncertainty handling in data mining process” in Proc, EDBT Conference, Konstanz, Germany, 2000.

[5] Qiang Ma. Enriched Algorithm based on Apriori Algorithm[J]. Development and application of computer, 2010,23(2):6-7

[6] Rui Chang and Zhiyi Liu , “ An Enriched Apriori Algorithm,” ICEOE 2011, IEEE International Conference, vol. 1, pp v1-476 -v1-478.

[7] U. Fayyad, G. Piatetsky-Shapiro, and P. Smyth, “From data mining to Knowledge discovery in databases” Al magazine, vol. 17 no. 3 pp. 37, 1996.

[8] Wanjun Yu; Xiaochun Waang; Erkan Wang; Bowen Chen;, ”The research of enrichedapriori algorithm for mining association rules” Communication Technology , 2008.ICCT 2008 11th IEEE International Conference on, vol., pp. 513-516, 10-12 Nov . 2008.

[9] YuboJia, Guanghu Xia, Hongdan Fan, Qian Zhang and Xu Li, “An Enriched Apriori Algorithm Based on Association Analysis,” ICNDC 2012, 3rd IEEE International Conference, pp208-211.

[10] Yiwu Xie ,Yutong Li Chunli Wang, MingyuLu. The Optimization and improvement of the Apriori Algorithm. In proc.Of 2008 Workshop on Education Technology and Training 2008 International Workshop on Geoscience and Remote Sensing.