Comparative Analysis of MapReduce Framework for Efficient Frequent Itemset Mining in Social Network Data
Keywords:
social networks, frequent itemsets mining, apriori algorithm, mapreduce framework, eclat algorithm
Abstract
Social networking sites are the virtual community for sharing information among the people It raises its popularity tremendously over the past few years Many social networking sites like Twitter Facebook WhatsApp Instragram LinkedIn generates tremendous amount data Mining such huge amount of data can be very useful Frequent itemset mining plays a significant role to extract knowledge from the dataset Traditional frequent itemsets method is ineffective to process this exponential growth of data almost terabytes on a single computer Map Reduce framework is a programming model that has emerged for mining such huge amount of data in parallel fashion In this paper we have discussed how different MapReduce techniques can be used for mining frequent itemsets and compared each other s to infer greater scalability and speed in order to find out the meaningful information from large datasets
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2016-07-15
Issue
Section
License
Copyright (c) 2016 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.