B., Bhargavi and Rani, K. (2020) Finding Frequent Subgraphs and Subpaths through Static and Dynamic Window Filtering Techniques. EAI Endorsed Transactions on Scalable Information Systems.
![[thumbnail of 40848.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "40848.pdf")
PDF
40848.pdf
Download (2MB)
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 grou
| Item Type: | Article |
|---|---|
| Date Deposited: | 04 Mar 2026 13:40 |
| Last Modified: | 11 Apr 2026 23:01 |
| URI: | http://eprints.eai.eu/id/eprint/30974 |
Actions (login required)
- View Item