preview

Efficient Subgraph Mining Algorithm On Big Data Essay

Decent Essays

Efficient Subgraph Mining Algorithm on Big Data Sumit Rajendra Surwase (Author) dept. of Computer Engineering Sardar Patel Institute of Technology, Andheri(west) line 3-Mumbai, India sumitsurwase77@gmail.com Prof. Jyoti Ramteke (Author) dept. of Computer Engineering Sardar Patel Institute of Technology, Andheri(west) Mumbai, India jyoti_ramteke@spit.ac.in Abstract— Frequent subgraph mining (FSM) is a crucial task for explorative information analysis on graph information. Over the years, several algorithms are planned to unravel this task. These algorithms assume that the information structure of the mining task is tiny enough to suit within the main memory of a laptop. However, because the real-world graph information grows, each in size and amount, such Associate in Nursing assumption doesn 't hold any more. to beat this, some graph database-centric strategies are planned in recent years for finding FSM; but, a distributed resolution victimization MapReduce paradigm has not been explored extensively. Since, MapReduce is changing into the defacto paradigm for computation on large information, Associate in Nursing economical FSM algorithmic rule on this paradigm is of big demand. during this work, we have a tendency to propose a frequent subgraph mining algorithmic rule referred to as MIRAGE that uses Associate in Nursing repetitive MapReduce based mostly framework. MIRAGE is complete because it returns all the frequent subgraphs for a given user-defined support,

Get Access