Total views : 175

Big Data in Health Care using Frequent Set Extraction


  • Department of IT, VIT University, Vellore – 632014, Tamil Nadu, India


To construct a student healthcare website which is termed as education world and reducing the answer time while bountiful any query towards the database wherever the data are stored. By using this website the consumer can acquire educational related material by queries. In this mission, the website is working to find the available frequent stuff using the procedure called APRIORI. This mission will be valuable in applications wherever the users consuming a set of stuff repeatedly. In order to separate these things from the databank, this process uses APRIORI algorithm. These are the areas where spending the time period to decrease the time using search. The disadvantage of existing scheme is it aimed at each and every demand given through the consumer. It will examine for all records which are not at altogether used and wanted by the consumer. So the total amount of the stuff escalates, the determined time period also escalates which will dynamically escalate the response time which will shrink the concert of the scheme. So the knowledge in which the system is working to the instrument will reduce the reply time in such a condition where the common data are used through the consumers. The system is also refining performance through parallelizing the actions in finding common data items. To shrink the response time period the system is spending the time period to catch the records in the databank. If the penetrating time reduces, mechanically the response period of the consumer query will also reduces. It clues to perform development of the scheme.


Apriori, Biological Data, Candidate Item Set, Eclat, FP-Growth.

Full Text:

 |  (PDF views: 135)


  • Al-Maolegi M, Arkok B. An Improved Apriori Algorithm for Association Rules. arXiv preprint arXiv:1403.3948. 2014.
  • Bachate R, Hingoliwala HA. Improving performance of apriori algorithm using Hadoop. 2014.
  • Borgelt C. An Implementation of the FP-growth Algorithm. In Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations. ACM. 2005; 1-5. CrossRef.
  • Borgelt C. Efficient implementations of apriori and eclat. In FIMI'03: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations. 2003.
  • Goethals B. Memory issues in frequent itemset mining. In Proceedings of the 2004 ACM symposium on Applied computing, ACM. 2004; 530–4. CrossRef.
  • Han J, Kamber M. Data Mining: Concepts and Techniques. IEEE International Conference on Morgan Kaufmann Publishers, Book, 2000.GrC 2008. IEEE. 2008.
  • Kumar BS, Rukmani KV. Implementation of web usage mining using APRIORI and FP growth algorithms. Int J of Advanced Networking and Applications. 2010; 1(06):400– 4.
  • Leung, CK-S, Sun L. Equivalence class transformation based mining of frequent itemsets from uncertain data. In Proceedings of the 2011 ACM Symposium on Applied Computing, ACM. 2011; 983–4. CrossRef. PMid:21444305
  • Li H, Wang Y, Zhang D, Zhang M, Chang EY. Pfp: parallel fp-growth for query recommendation. In Proceedings of the 2008 ACM Conference on Recommender Systems, ACM. 2008. p. 107–14. CrossRef.
  • Li N, Zeng L, He Q, Shi Z. Parallel implementation of apriori algorithm based on mapreduce. 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel and Distributed Computing (SNPD), IEEE. 2012. p. 236–41.
  • Mishra R, Choubey A. Discovery of frequent patterns from web log data by using FP-growth algorithm for web usage mining. International Journal of Advanced Research in Computer Science and Software Engineering. 2012; 2(9).
  • Singh J, Ram H, Sodhi JS. Improving efficiency of apriori algorithm using transaction reduction. International Journal of Scientific and Research Publications. 2013; 3(1):1–4.
  • Song M, Rajasekaran S. A transaction mapping algorithm for frequent itemsets mining. IEEE transactions on Knowledge and Data Engineering. 2006; 18(4):472–81. CrossRef.
  • Vijayarani S, Sathya P. Mining frequent item sets over data streams using eclat algorithm. In IJCA Proceedings on International Conference on Research Trends in Computer Technologies. Foundation of Computer Science (FCS), 2013; 4:27–31. PMid:24426256 PMCid:PMC3650199
  • Wu X, Kumar V, Ross Quinlan J, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng A, Liu B, Yu PS, Zhou Z-H, Steinbach M, Hand DJ, Steinberg D. Top 10 algorithms in datamining. Knowledge and Information Systems. 2007 Dec; 14(1):1– 37. CrossRef.
  • Yu K-M, Zhou J-L. A weighted load-balancing parallel apriori algorithm for association rule mining. IEEE International Conference on Granular Computing, 2008. GrC 2008, IEEE. 2008.
  • Zaki MJ. Parallel and distributed association mining: A survey. IEEE concurrency. 1999; 4:14–25. CrossRef.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.