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 i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
European Alliance for Innovation (EAI)
2020-10-01
|
| Series: | EAI Endorsed Transactions on Scalable Information Systems |
| Subjects: | |
| Online Access: | https://eudl.eu/pdf/10.4108/eai.13-7-2018.163986 |