Accepted Papers

• Time-Based Sampling of Social Network Activity Graphs
  Nesreen Ahmed, Fredrick Berchmans, Jennifer Neville and Ramana Kompella
   
• Structure, Tie Persistence and Event Detection in Large Phone and SMS Networks
  Leman Akoglu and Bhavana Dalvi
   
• SVM Optimization for Lattice Kernels
  Cyril Allauzen, Corinna Cortes and Mehryar Mohri
   
• A Compact Representation of Graph Databases
  Sandra Álvarez, Nieves R. Brisaboa, Susana Ladra and Óscar Pedreira
   
• Binary Bit String Representation for Networks based on Exchangeable Graph Modeling
  Hossein Azari, Edoardo Airoldi and Vahid Tarokh
   
• A Community-Based Model of Online Social Networks
  Leendert Botha and Steve Kroon
   
• Enhancing Link-Based Similarity Through the Use of Non-Numerical Labels and Prior Information
  Christian Desrosiers and George Karypis
   
• Network Community Discovery: Solving Modularity Clustering via Normalized Cut
  Chris Ding and Linbin Yu
   
• Analyzing Graph Databases by Aggregate Queries
  Anton Dries and Siegfried Nijssen
   
• Multi-Network Fusion for Collective Inference
  Hoda Eldardiry and Jennifer Neville
   
• Bayesian Block Modelling for Weighted Networks
  Ian Gallagher
   
• An efficient block model for clustering sparse graphs
  Adam Gyenge, Janne Sinkkonen and Andras A. Benczur
   
• Centrality Metric for Dynamic Networks
  Kristina Lerman, Rumi Ghosh and Jeon Hyung Kang
   
• Design Patterns for Efficient Graph Algorithms in MapReduce
  Jimmy Lin and Michael Schatz
   
• Prioritizing Candidate Genes by Network Analysis of Differential Expression using Machine Learning Approaches
  Daniela Nitsch
   
• Document Classification Utilising Ontologies and Relations between Documents
  Katariina Nyberg, Tapani Raiko, Teemu Tiinanen and Eero Hyvönen
   
• Graph Visualization With Latent Variable Models
  Juuso Parkkinen, Kristian Nybo, Jaakko Peltonen and Samuel Kaski
   
• Relational motif discovery via graph spectral ranking
  Alberto Pinto
   
• Symmetrizations for Clustering Directed Graphs
  Venu Satuluri and Srinivasan Parthasarathy
   
• Pruthak- mining and analyzing graph substructures
  Swapnil Shrivastava, Kriti Kulshrestha, Pratibha Singh and Supriya N Pal
   
• Structural Correlation Pattern Mining for Large Graphs
  Arlei Silva, Wagner Meira Jr. and Mohammed J. Zaki
   
• Meaningful Selection of Temporal Resolution for Dynamic Networks
  Rajmonda Sulo, Tanya Berger-Wolf and Robert Grossman
   
• Community Evolution Detection in Dynamic Heterogeneous Information Networks
  Yizhou Sun, Jie Tang, Jiawei Han, Manish Gupta and Bo Zhao
   
• Network Quantification Despite Biased Labels
  Lei Tang, Huiji Gao and Huan Liu
   
• Frequent Subgraph Discovery in Dynamic Networks
  Bianca Wackersreuther, Peter Wackersreuther, Annahita Oswald, Christian Böhm and Karsten Borgwardt
   
• Querying Graphs with Uncertain Predicates
  Hao Zhou, Anna Shaverdian, H. V. Jagadish and George Michailidis
   
• Frequent Subgraph Mining on a Single Large Graph Using Sampling Techniques
  Ruoyu Zou and Lawrence Holder
   

Web Accessibility