Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary




Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

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,
:under process


Abstract
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.


Citation
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.

References
[1] 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 
[2] 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,
[3] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDBY94, pp. 487-499.
[4] 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
[5] 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.
[6] J.S .Park ,M.S.Chen and P.S.Yu.An effective hash-based algorithm for mining association rules. In SIGMOD1995, pp 175-186.
[7] J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation(PDF), (Slides), Proc. 2000 ACM-SIGMOD Int. May 2000.
[8] 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
[9] 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
[10] E. Ramaraj and N. Venkatesan, ― Bit Stream Mask Search Algorithm in Frequent Itemset Mining,‖ European Journal of Scientific Research,‖ Vol. 27 No.2 (2009).
[11] 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


DOI Link : Not yet assigned

Download :
  V3I1005.pdf


Refbacks : There are currently no refbacks

Support Us


We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links



DOI:10.22362/ijcert


Science Central

Score: 13.30





Submit your paper to editorijcert@gmail.com