Scalable Algorithms for Mining Maximal Quasi Frequent Subnetworks
Frequent graph mining has received considerable attention from researchers. Existing algorithms for frequent subgraph mining do not scale for large networks, and take hours to finish. Mining multiple gene coexpressions networks allows for identifying context-specific modules. Frequent subnetworks re...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
North Dakota State University
2018
|
| Online Access: | https://hdl.handle.net/10365/28735 |