Efficient mining of association rules using closed itemset lattices
Information Systems
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Concept Data Analysis: Theory and Applications
Concept Data Analysis: Theory and Applications
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
Periodic subgraph mining in dynamic networks
Knowledge and Information Systems
Speedup for a periodic subgraph miner
Information Processing Letters
| Hi-index | 0.00 |
Given a sequence G= of simple graphs over uniquely labeled vertices from a set V, the periodic subgraph mining problem consists in discovering maximal subgraphs that recur at regular intervals in G. For a periodic subgraph to be maximal, it is intended here that it cannot be enriched by adding edges nor can its temporal span be expanded in any direction. We give algorithms that improve the theoretical complexity of solutions previously available for this problem. In particular, we show an optimal solution based on an implicit description of the output subgraphs that takes time O(|V|+|E@?|xT^2/@s)-where |E@?| is the average number of edges over the entire sequence G-to publish all maximal periodic subgraphs that meet or exceed a minimum occurrence threshold @s.