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

Bhargavi, B. and Swarupa Rani, K. (2020) Finding Frequent Subgraphs and Subpaths through Static and Dynamic Window Filtering Techniques. EAI Endorsed Transactions on Scalable Information Systems, 7 (27): e11. ISSN 2032-9407

[img]
Preview
Text
eai.13-7-2018.163986.pdf - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (2MB) | Preview

Abstract

Big data era has large volumes of data generated at high velocity from different data sources. Finding frequent subgraphs from the graph streams can be a challenging task as streams are non-uniformly distributed and continuously processed. Its applications include finding strongly interacting groups in social networks and sensor networks. To find frequent subgraphs, we proposed static single-window technique and dynamic sliding window techniques. We also proposed enhancements by extending proposed static approach with its variations 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 include finding congested sections in traffic analysis. We applied our proposed static and dynamic techniques to extract the frequent subpaths from sequence of paths. We experimented the proposed dynamic and static approaches with real and benchmark datasets.

Item Type: Article
Uncontrolled Keywords: graph stream, frequent subgraphs, subpath
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor II.
Date Deposited: 22 Oct 2020 12:32
Last Modified: 22 Oct 2020 12:32
URI: https://eprints.eudl.eu/id/eprint/731

Actions (login required)

View Item View Item