The week's pick
Random Articles
Reseach Article
A Survey on Achieving Best Knowledge from Frequent Item set Mining using Fidoop
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 171 - Number 9 |
| Year of Publication: 2017 |
| Authors: Sandhya S. Waghere, Pothuraju Rajarajeswari |
10.5120/ijca2017915068
|
Sandhya S. Waghere, Pothuraju Rajarajeswari . A Survey on Achieving Best Knowledge from Frequent Item set Mining using Fidoop. International Journal of Computer Applications. 171, 9 ( Aug 2017), 16-18. DOI=10.5120/ijca2017915068
Abstract
Data mining mostly use for data analysis and identifying frequent dataset. Now a days cloud computing is used for data storage and many other data operations like data mining, data retrieval, data distribution etc. As data increasing very rapidly on server day by day, many complications are introduced. Most common problems are load balancing on server and time optimization. To overcome these limitations parallel frequent dataset mining is very effective method. Fidoop parallel frequent dataset mining algorithm which is based on mapreduce framework helps to improve load balancing and FiDoop-HD, speed up the mining performance for high-dimensional data analysis. Fidoop is very efficient and scalable algorithm for large clusters of data.
References
- D. Chen et al., “Tree partition based parallel frequent pattern mining on shared memory systems,” in Proc.20th IEEE Int. Parallel Distrib. Process. Symp.(IPDPS), Rhodes Island, Greece, 2006, pp. 1–8.
- Y.-J. Tsay, T.-J. Hsu, and J.-R. Yu, “FIUT: A newmethod for mining frequent itemsets,” Inf. Sci., vol.179, no. 11, pp. 1724–1737, 2009.
- E.-H. Han, G. Karypis, and V. Kumar, “Scalableparallel data mining for association rules,” IEEE Trans. Knowl. Data Eng., vol. 12, no. 3, pp. 337–352,May/Jun. 2000.
- K.-M. Yu, J. Zhou, T.-P. Hong, and J.-L. Zhou, “Aload-balanced Distributed parallel mining algorithm,”Expert Syst. Appl., vol. 37, no. 3, pp. 2459–2464, 2010.
- L. Zhou et al., “Balanced parallel FP-growth withMapReduce,” in Proc. IEEE Youth Conf. Inf. Comput. Telecommun. (YC-ICT), Beijing, China, 2010, pp.243–246.
- “ECLAT Algorithm for Frequent Itemsets Generation”ManjitkaurUrvashi Grag Computer Science and Technology, Lovely Professional University Phagwara, Punjab, India . InternationalJournal of Computer Systems (ISSN: 2394-1065), Volume 01– Issue 03, December, 2014 Available at http://www.ijcsonline.com/
- “Implementation Of Parallel Apriori Algorithm On Hadoop Cluster”A. Ezhilvathani1, Dr. K. Raja. International Journal of ComputerScience and Mobile Computing.
- M. Chen, X. Gao and H. Li, "An efficient parallel FP-Growth algorithm," 2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, Zhangijajie, 2009,pp.283-286.DOI: 10.1109/CYBERC.2009.5342148
Index Terms
Keywords