Nivesh Mittapally working with Prof. P Krishna Reddy presented a paper on Mining of Top-K Subgraphs From Uncertain Graph Data at IEEE International Conference on Fuzzy Systems (FUZZ-IEEE, 2025) held at Reims, France from 6 to 9 July. Here is the summary of the paper as explained by the authors Ishan Choubey, Nivesh Mittapally, Uday Kiran Kiran Rage and Prof.  P Krishna Reddy:

A graph transactional database (GTD) is a collection of graphs. Frequent Top-k Subgraph Pattern Mining involves finding the complete set of top-k frequently occurring subgraph patterns in a GTD. Most previous studies focused on finding these patterns in certain graphs by disregarding the crucial information regarding the existential probabilities that may exist between the edges of any two nodes. With this motivation, this paper proposes a novel model to discover top-k (frequently occurring) subgraphs in an uncertain graph transactional database. We introduce a novel algorithm, top-k uncertain subgraph miner (TUSM), to find all top-k subgraphs in the data. We also introduce an approximate top-k uncertain subgraph miner (ATUSM) algorithm to tackle the computational expansiveness of TUSM. Experimental results on synthetic and protein-protein interaction datasets demonstrate that the proposed model finds valuable information and the algorithms are efficient.

 July 2025