Map Reduce Frequent Sub graphs Mining on Cloud System | ||
| Sohag Journal of Sciences | ||
| Volume 2, Issue 3, September 2017, Pages 27-40 PDF (1.1 M) | ||
| Document Type: Regular Articles | ||
| DOI: 10.21608/sjsci.2017.233216 | ||
| Authors | ||
| Marghny H. Mohamed* 1; Hosam E. Refaat2; Hanan H. Amin3 | ||
| 1Dept. of Computer Science, Faculty of Computers and Information, Assiut University, Egypt. | ||
| 2Dept. of Information System, Faculty of Computers and Informatics, Suez Canal University, Egypt | ||
| 3Dept. of Math, Faculty of Science, Sohag University, Egypt | ||
| Abstract | ||
| Analyzing frequent subgraph mining (FSM) is considered as the most important challenge to graph mining domain. Many algorithms have been proposed for this problem. The plurality of these algorithms assumes that the graph data can be handled in computer memory. Actually, FSM is a primal operation in many applications such as Social Networks or chemical components, which contains a huge number of edges and vertices. The previous algorithms give insufficient solutions for the massive data. Accordingly, MapReduce paradigm introduces a distributed solution to massive data computation. Hence, the proposed algorithm in this paper, which is called MRFSG, uses an iterative MapReduce-based framework. Moreover, MRFSG is balanced the load among the system workers and reduces dependency between the workers. Our experiments evaluate the performance of MRFSG using various of datasets. The results of experiment demonstrate that the proposed algorithm can scale well and efficiently process large graph datasets on the cloud system. | ||
| Keywords | ||
| Graph mining; Frequent subgraph mining; Parallel system; FSG Algorithm | ||
|
Statistics Article View: 38 PDF Download: 84 |
||
