Nowadays, in almost all fields such as social networking, sensor networks, and biological spheres, etc., generates enormous amounts of data, and we can extract useful knowledge from such data by creating graphs. Using the graph, we can extract data which is more frequent by applying frequent sun mining (FSM) algorithm. FSM algorithm can get all subgraphs from a single large graph with a more significant number of edge connections. The graph consists of vertex and edges, and sometimes these graphs cabs are uncertain due to more and a smaller number of edges. In uncertain graphs, some vertex may have a considerable amount of edges, so to find frequent subgraphs from the uncertain graph. We have two algorithms, such as Evaluation probabilistic and Evaluation Estimate.
Volume 12 | Issue 6
Pages: 2034-2038
DOI: 10.5373/JARDCS/V12I2/S20201409