You are here
Workshop Details
DaMNet: Workshop on Data Mining in Networks
Organized by Giuseppe Di Fatta and Antonio Liotta
09:00 - 17:00
Room: Watteau I
http://damnet.reading.ac.uk
The complexity of numerous social, biological, and communication systems is driving many researchers towards the adoption of data mining approaches. The International Workshop on Data Mining in Networks looks specifically at how data mining is currently used for the characterization, management and control of complex networks. This aim is particularly challenging, as it requires a cross-disciplinary approach, pulling together efforts from a variety of research communities with an interest in the analysis and control of complex networks by means of Data Mining approaches.
| 09:00 - 09:10 | Welcoming and Introduction Antonio Liotta |
event_type == 2) {?>
09:00 - 09:10 | Welcoming and Introduction Antonio Liotta |
event_type == 3) {?>
09:00 - 09:10 | Welcoming and Introduction | event_type == 4) {?>Welcoming and Introduction | event_type == 5) {?>09:00 - 09:10 | Welcoming and Introduction Antonio Liotta |
|
| 09:10 - 09:35 | Motif Mining in Weighted Networks Sarvenz Choobdar, Pedro Ribeiro and Fernando Silva |
event_type == 2) {?>
09:10 - 09:35 | Motif Mining in Weighted Networks Sarvenz Choobdar, Pedro Ribeiro and Fernando Silva |
event_type == 3) {?>
09:10 - 09:35 | Motif Mining in Weighted Networks | event_type == 4) {?>Motif Mining in Weighted Networks | event_type == 5) {?>09:10 - 09:35 | Motif Mining in Weighted Networks Sarvenz Choobdar, Pedro Ribeiro and Fernando Silva |
|
| 09:35 - 10:00 | Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing Tomasz Kajdanowicz |
event_type == 2) {?>
09:35 - 10:00 | Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing Tomasz Kajdanowicz |
event_type == 3) {?>
09:35 - 10:00 | Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing | event_type == 4) {?>Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing | event_type == 5) {?>09:35 - 10:00 | Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing Tomasz Kajdanowicz |
|
| 10:00 - 10:30 | Coffee Break |
event_type == 2) {?>
10:00 - 10:30 | Coffee Break |
event_type == 3) {?>
10:00 - 10:30 | Coffee Break | event_type == 4) {?>Coffee Break | event_type == 5) {?>10:00 - 10:30 | Coffee Break |
|
| 10:35 - 11:00 | Canonical Correlation Analysis for Detecting Changes in Network Structure Aidan O'Sullivan, Niall Adams and Iead Rezek |
event_type == 2) {?>
10:35 - 11:00 | Canonical Correlation Analysis for Detecting Changes in Network Structure Aidan O'Sullivan, Niall Adams and Iead Rezek |
event_type == 3) {?>
10:35 - 11:00 | Canonical Correlation Analysis for Detecting Changes in Network Structure | event_type == 4) {?>Canonical Correlation Analysis for Detecting Changes in Network Structure | event_type == 5) {?>10:35 - 11:00 | Canonical Correlation Analysis for Detecting Changes in Network Structure Aidan O'Sullivan, Niall Adams and Iead Rezek |
|
| 11:00 - 11:25 | Uncovering the Spatio-Temporal Structure of Social Networks using Cell Phone Records Luis G. Moyano, Oscar Ricardo Moll Thomae and Enrique Frias-Martinez |
event_type == 2) {?>
11:00 - 11:25 | Uncovering the Spatio-Temporal Structure of Social Networks using Cell Phone Records Luis G. Moyano, Oscar Ricardo Moll Thomae and Enrique Frias-Martinez |
event_type == 3) {?>
11:00 - 11:25 | Uncovering the Spatio-Temporal Structure of Social Networks using Cell Phone Records | event_type == 4) {?>Uncovering the Spatio-Temporal Structure of Social Networks using Cell Phone Records | event_type == 5) {?>11:00 - 11:25 | Uncovering the Spatio-Temporal Structure of Social Networks using Cell Phone Records Luis G. Moyano, Oscar Ricardo Moll Thomae and Enrique Frias-Martinez |
|
| 11:25 - 11:50 | Maximizing Information Spread Through Influence Structures in Social Networks Saurav Pandit, Yang Yang and Nitesh Chawla |
event_type == 2) {?>
11:25 - 11:50 | Maximizing Information Spread Through Influence Structures in Social Networks Saurav Pandit, Yang Yang and Nitesh Chawla |
event_type == 3) {?>
11:25 - 11:50 | Maximizing Information Spread Through Influence Structures in Social Networks | event_type == 4) {?>Maximizing Information Spread Through Influence Structures in Social Networks | event_type == 5) {?>11:25 - 11:50 | Maximizing Information Spread Through Influence Structures in Social Networks Saurav Pandit, Yang Yang and Nitesh Chawla |
|
| 12:00 - 14:30 | Lunch Break |
event_type == 2) {?>
12:00 - 14:30 | Lunch Break |
event_type == 3) {?>
12:00 - 14:30 | Lunch Break | event_type == 4) {?>Lunch Break | event_type == 5) {?>12:00 - 14:30 | Lunch Break |
|
| 14:35 - 15:00 | Sampling Online Social Networks Using Coupling From The Past Kenton White, Guichong Li and Nathalie Japkowicz |
event_type == 2) {?>
14:35 - 15:00 | Sampling Online Social Networks Using Coupling From The Past Kenton White, Guichong Li and Nathalie Japkowicz |
event_type == 3) {?>
14:35 - 15:00 | Sampling Online Social Networks Using Coupling From The Past | event_type == 4) {?>Sampling Online Social Networks Using Coupling From The Past | event_type == 5) {?>14:35 - 15:00 | Sampling Online Social Networks Using Coupling From The Past Kenton White, Guichong Li and Nathalie Japkowicz |
|
| 15:00 - 15:25 | EigenSP: A More Accurate Shortest Path Distance Estimation on Large-Scale Networks Koji Maruhashi, Junichi Shigezumi, Nobuhiro Yugami and Christos Faloutsos |
event_type == 2) {?>
15:00 - 15:25 | EigenSP: A More Accurate Shortest Path Distance Estimation on Large-Scale Networks Koji Maruhashi, Junichi Shigezumi, Nobuhiro Yugami and Christos Faloutsos |
event_type == 3) {?>
15:00 - 15:25 | EigenSP: A More Accurate Shortest Path Distance Estimation on Large-Scale Networks | event_type == 4) {?>EigenSP: A More Accurate Shortest Path Distance Estimation on Large-Scale Networks | event_type == 5) {?>15:00 - 15:25 | EigenSP: A More Accurate Shortest Path Distance Estimation on Large-Scale Networks Koji Maruhashi, Junichi Shigezumi, Nobuhiro Yugami and Christos Faloutsos |
|
| 15:30 - 16:00 | Coffee Break |
event_type == 2) {?>
15:30 - 16:00 | Coffee Break |
event_type == 3) {?>
15:30 - 16:00 | Coffee Break | event_type == 4) {?>Coffee Break | event_type == 5) {?>15:30 - 16:00 | Coffee Break |
|
| 16:05 - 16:30 | Sensor Network Localization for Moving Sensors Arvind Agarwal, Hal Daume, Jeff M. Phillips and Suresh Venkatasubramanian |
event_type == 2) {?>
16:05 - 16:30 | Sensor Network Localization for Moving Sensors Arvind Agarwal, Hal Daume, Jeff M. Phillips and Suresh Venkatasubramanian |
event_type == 3) {?>
16:05 - 16:30 | Sensor Network Localization for Moving Sensors | event_type == 4) {?>Sensor Network Localization for Moving Sensors | event_type == 5) {?>16:05 - 16:30 | Sensor Network Localization for Moving Sensors Arvind Agarwal, Hal Daume, Jeff M. Phillips and Suresh Venkatasubramanian |
|
| 16:30 - 16:55 | Effect of Data Repair on Mining Network Streams Ji Meng Loh and Tamraparni Dasu |
event_type == 2) {?>
16:30 - 16:55 | Effect of Data Repair on Mining Network Streams Ji Meng Loh and Tamraparni Dasu |
event_type == 3) {?>
16:30 - 16:55 | Effect of Data Repair on Mining Network Streams | event_type == 4) {?>Effect of Data Repair on Mining Network Streams | event_type == 5) {?>16:30 - 16:55 | Effect of Data Repair on Mining Network Streams Ji Meng Loh and Tamraparni Dasu |
|
| 16:55 - 17:00 | Conclusive remarks Antonio Liotta |
event_type == 2) {?>
16:55 - 17:00 | Conclusive remarks Antonio Liotta |
event_type == 3) {?>
16:55 - 17:00 | Conclusive remarks | event_type == 4) {?>Conclusive remarks | event_type == 5) {?>16:55 - 17:00 | Conclusive remarks Antonio Liotta |
|