Locating Common Styles Based Totally On Quantitative Binary Attributes Using FP-Growth Algorithm
RAVULA KARTHEEK, B. SAMPATH BABU, CH. HARI KRISHNA, ,
Affiliations Assistant professor, Rise Krishna Sai Gandhi Group of Institutions: Ongole,
Discovery of frequent patterns from outsized information is taken into account as a crucial facet of data mining. There is always associate degree ever increasing demand to search out the frequent patterns. This paper introduces a technique to handle the categorical attributes associate degree numerical attributes in an economical means. Within the planned methodology, the ordinary database is reborn into quantitative information and thus it's reborn into binary values reckoning on the condition of the coed information. From the binary patterns of all attributes bestowed within the student information, the frequent patterns are known exploitation FP-growth; the conversion reveals all the frequent patterns within the student database.
RAVULA KARTHEEK et al. ," Locating Common Styles Based Totally On Quantitative Binary Attributes Using
FP-Growth Algorithmâ€, International Journal of Computer Engineering In Research Trends, 3(10):561-567,October-2016.
Keywords : Quantitative attributes, Data mining, FP-growth algorithm, frequent patterns.
 Bo Wu, Defu Zhang, Qihua Lan, Jiemin Zheng ,An Efficient Frequent Patterns Mining Algorithm based on Apriori Algorithm and the FP-tree Structure Department of Computer Science, Xiamen University, Xiamen
 Lei Want, Xing-Juan Fan2, Xing-Long Lot, Huan Zha Mining data association based on a revised FP-growth Algorithm Proceedings of the 2012 International Conference on Machine Learning and Cybernetics, Xian, 15- 17 July,
 R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDBY94, pp. 487-499.
 R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc.1993 ACM-SIGMOD Int. Conf. Management of Data, Washington, D.C., May 1993, pp 207216
 A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. Proceedings of the 21st International Conference on Very large Database,1995.
 J.S .Park ,M.S.Chen and P.S.Yu.An effective hash-based algorithm for mining association rules. In SIGMOD1995, pp 175-186.
 J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation(PDF), (Slides), Proc. 2000 ACM-SIGMOD Int. May 2000.
 A.B.M.Rezbaul Islam, Tae-Sun Chung An Improved Frequent Pattern Tree Based Association Rule Mining Techniques Department of Computer Engineering Ajou University Suwon, Republic of Korea
 Agarwal R,Aggarwal C,Prasad V V V.A tree projection algorithm for generation of frequent item sets. In Journal of Parallel and Distributed Computing (Special Issue on High-Performance Data Mining),2000
 E. Ramaraj and N. Venkatesan, â€• Bit Stream Mask Search Algorithm in Frequent Itemset Mining,â€– European Journal of Scientific Research,â€– Vol. 27 No.2 (2009).
 Qihua Lan, Defu Zhang, Bo Wu ,A New Algorithm For Frequent Itemsets Mining Based On Apriori And FP-Tree,Department of Computer Science, Xiamen University, Xiamen China 2009 IEEE
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.