Graph Mining
Tuesday 16 September
10:40 - 12:20
Location: R001
Session chair: Siegfried Nijssen
| 10:40 | Finding Reliable Subgraphs from Large Probabilistic Graphs
Petteri Hintsanen, Hannu Toivonen
View abstract |
| 11:00 | Effective Pruning Techniques for Mining Quasi-cliques
Guimei Liu, Limsoon Wong
View abstract |
| 11:20 | Mining Frequent Connected Subgraphs Reducing the Number of Candidates
Andrés Gago Alonso, José E. Medina Pagola, J. Ariel Carrasco-Ochoa, J. Fco. Martínez-Trinidad
View abstract |
| 11:40 | Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
Tamas Horvath, Jan Ramon
View abstract |
| 12:00 | SkyGraph: An Algorithm for Important Subgraph Discovery in Relational Graphs
Apostolos Papadopoulos, Apostolos Lyritsis, Yannis Manolopoulos
View abstract |
