HPGM: High Performance Graph Mining

 

More and larger network data sets emerge every year, causing a growing interest in large-scale graph mining. However, exploring and exploiting these large graphs represents a novel challenge, both in terms of knowledge discovery and parallel computation. In order to understand what processes are currently feasible, HPC and AI researchers must collaborate in the design of mining algorithms, processing models and optimization techniques. To help in that regard, the HPGM workshop intends to bring together researchers tackling the same problems from different perspectives; life and earth science researchers working on network related problems, AI researchers designing graph mining tools, and HPC researchers developing efficient graph processing methodologies.

COMMITEE

Workshop chairs

  • Toyotaro Suzumura, IBM T.J.Watson Research Center
  • Ulises Cortés, UPC - Barcelona TECH

Programme chair

  • Dario Garcia-Gasulla, Barcelona Supercomputing Center, BSC

Web:http://hpgm.bsc.es/

Contact: hpgm@bsc.es

Recent Submissions

  • GraSP: distributed streaming graph partitioning 

    Battaglino, Casey; Pienta, Pienta; Vuduc, Richard (2015)
    Conference report
    Open Access
    This paper presents a distributed, streaming graph parti- tioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, sim- ulating an online algorithm that must process ...

  • Parallel k nearest neighbor graph construction using tree-based data structures 

    Rajani, Nazneen; McArdle, Kate; Dhillon, Inderjit S. (2015)
    Conference report
    Open Access
    Construction of a nearest neighbor graph is often a neces- sary step in many machine learning applications. However, constructing such a graph is computationally expensive, es- pecially when the data is high dimensional. ...

  • Fast, exact graph diameter computation with vertex programming 

    Pennycuff, Corey; Weninger, Tim (2015)
    Conference report
    Open Access
    In graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, ...