INFORMATION CHANGE THE WORLD

International Journal of Modern Education and Computer Science (IJMECS)

ISSN: 2075-0161 (Print), ISSN: 2075-017X (Online)

Published By: MECS Press

IJMECS Vol.12, No.5, Oct. 2020

Data Mining with Associated Methods to Predict Consumer Purchasing Patterns

Full Text (PDF, 557KB), PP.16-28


Views:44   Downloads:9

Author(s)

Hena Lisnawati, Ardiles Sinaga

Index Terms

Data Mining, Algorithm CT-Pro, CFP-Tree, Sales Analysis, Mining Results

Abstract

Technology is developed and utilized as an honest computer in order that it can provide useful information. With the aim of developing and meeting business objectives, the utilization of sales transaction data in minimarket GP is processed into information or knowledge as a recommendation to ascertain the possible value of purchased simultaneously. This processing uses data mining.
Database buildup in computerized systems is justified by getting added value from this data set. Data mining can predicts trends and therefore the nature of business behavior which is extremely useful to support important deciding.
The algorithm wont to form the association rules during this study is CT-Pro. CT-Pro algorithm may be a development of FP-Growth. The difference is within the second step where FP-Growth creates the FP-Tree arrangement while CT-Pro makes the Compressed FP-Tree (CFP-Tree) arrangement. The CT-Pro algorithm process by analyzing employing a tree system where the things most frequently purchased become root and other items will follow the basis. The CFP-Tree process will provide levels for every transaction and facilitate mining results.
CT-Pro algorithm implementation with CFP-Tree arrangement applied to data mining systems is in a position to research sales data for 3 months, namely January 2020 – March 2020 with a complete data record of 1.303 and 320 sales transactions at minimarket GP  become information or knowledge. The results of this study are the relationship between the tendency of products that are bought together based on categories in a kind of percentage to be used as a recommendation in structuring the position of items that are mutually frequent in certain categories.

Cite This Paper

Hena Lisnawati, Ardiles Sinaga, " Data Mining with Associated Methods to Predict Consumer Purchasing Patterns", International Journal of Modern Education and Computer Science(IJMECS), Vol.12, No.5, pp. 16-28, 2020.DOI: 10.5815/ijmecs.2020.05.02

Reference

[1]Jeffrey A. Hoffer, Mary B. Prescott, and Fred R. Mcfadden, Modern Database Management, 7th ed.: Prentice, 2004.

[2]Bharat B. Gupta and Deepak Garg, "FP-Tree Based Algorithms Analysis: FP- Growth, COFI-Tree and CT-PRO," International Journal on Computer Science and Engineering (IJCSE), vol. 3, pp. 2691-2699, July 2011.

[3]Jiawei Han, Jian Pei, and Yiwen Yin, "Mining Frequent Patterns Without Candidate Generation," ACM sigmod record, pp. 1-12, 2000.

[4]Rakesh Agrawal and Ramakrishnan Srikant, "Fast Algoritms for Mining Association rules," Proc. 20th int. conf. very large data bases, VLDB, pp. 487-499, 1994.

[5]Jiawei Han and Micheline Kamber, Data Mining-Concepts and Techniques. Sam Francisco: Morgan Kanufmann Publishers, 2009.

[6]Rakesh Agrawal, Tomasz Imieliński, and Arun Swami, "Mining association rules between sets of items in large databases," Proceedings of the 1993 ACM SIGMOD international conference on Management of data, pp. 207-216, June 1993.

[7]M-L Antonie and Osmar R Zaiane, "Text document categorization by term association," in IEEE International Conference on Data Mining, pp. 19-26, December 2002.

[8]Bing Liu, Wynne Hsu, and Yiming Ma, "Integrating classification and association rule mining," Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, 1998.

[9]Qihua Lan, Defu Zhang, and Bo Wu, "A New Algorithm For Frequent Itemsets Mining," Proceeding on IEEE National Conference on Global Congress on Intelligent Systems, pp. 360-364, 2009.

[10]Yudho Giri Sucahyo and Raj P Gopalan, "CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure," FIMI, pp. 212-223, 2004.

[11]Liu J, Pan Y, Wang K, and Han J, Mining Frequent Item Sets by Opportunistic Projection. Canada: Proceedings of ACM SIGKKD, 2002.

[12]Christian Borgelt, "Efficient Implementations of Apriori and eclat," Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI), Melbourne, Florida, 2003.

[13]Fimi. (2003) Fimi Repository. [Online]. http://fimi.cs.helsinki.fi

[14]Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques.: Elsevier, 2006.

[15]Efraim Turban, Jay E Aronson, and Ting Peng Liang, Decision Support Systems and Intelligent Systems, 7th ed.: Prentice Hall, 2004.

[16]Mehmed Kantardzic, Data Mining: Concepts, Models, Methods, and Algorithms, 2nd ed.: John Wiley & Sons, 2011.

[17]Daniel T Larose, Discovering Knowledge In Data : An Introduction to Data Mining. Canada: John Wiley & Sons, Inc., 2005.

[18]Raj P Gopalan and Yudho Giri Sucahyo, "High performance frequent patterns extraction using compressed FP-tree," Proceedings of SIAM International Workshop on High Performance and Distributed Mining (HPDM), Orlando, USA, 2004.

[19]Yudho Giri Sucahyo and Raj P Gopalan, "CT-ITL: Efficient Frequent Item Set Mining Using a Compressed Prefix Tree With Pattern Growth," Proceedings of the 14th Australasian database conference-Volume 17, pp. 95-104, 2003.

[20]SP Latha and N Ramaraj, "Algorithm for Efficient Data Mining," Proceeding on IEEE International Computational Intelligence and Multimedia Applications, vol. 2, pp. 66-70, 2007.

[21]Ramesh C. Agarwal, Charu C. Aggarwal, and V.V.V. Prasad, "A Tree Projection Algorithm for Generation of Frequent Item Sets," Journal of Parallel and Dis- tributed Computing (Special Issue on High Per- formance Data Mining), 2000.

[22]Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach," Data Mining and Knowl- edge Discovery: An International Journal, Kluwer Academic Publishers, vol. 8, pp. 53-87, 2004.

[23]W. Cheung and O. R. Zaiane, "Incremental mining of frequent patterns without candidate generation or support constraint," Proceedings of Seventh International Database Engineering and Applications Symposium, July 2003.

[24]Jochen Hipp, Ulrich Güntzer, and Gholamreza Nakhaeizad, "Algorithms for association rule mining—a general survey and comparison," ACM sigkdd explorations newsletter, vol. 2, no. 1, pp. 58-64, June 2000.

[25]Aiman Moyaid Said, PDD Dominic, and Azween B Abdullah, "A comparative study of fp-growth variations," International journal of computer science and network security, vol. 9, no. 5, pp. 266-272, may 2009.