Finding Frequent Subgraphs and Subpaths through Static and Dynamic Window Filtering Techniques

Big data era has large volumes of data generated at high velocity from different data sources. Finding frequentsubgraphs from the graph streams can be a challenging task as streams are non-uniformly distributed andcontinuously processed. Its applications include finding strongly interacting groups in social networks andsensor networks. To find frequent subgraphs, we proposed static single-window technique and dynamicsliding window techniques. We also proposed enhancements by extending proposed static approach with itsvariations and extending dynamic approach in variations of incremental strategy to find frequent subgraphs.We also solved the sub problem to extract frequent subpaths from sequence of paths. Its applications includefinding congested sections in traffic analysis. We applied our proposed static and dynamic techniques toextract the frequent subpaths from sequence of paths. We experimented the proposed dynamic and staticapproaches with real and benchmark datasets.