読者です 読者をやめる 読者になる 読者になる

KDD 2013

  • Research Session 3: Big data frameworks
    • #52 TurboGraph: A Fast Parallel Graph Engine Handling Billion-scale Graphs in a Single PC
    • Research Session 4: Graph mining
    • #583 Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
    • #1083 Redundancy-Aware Maximal Cliques
  • Research Session 11: Graph clustering
    • #569 Selective Sampling on Graphs for Classification
    • #93 Flexible and Robust Co-regularized Multi-Domain Graph Clustering
    • #1186 Clustered Graph Randomization: Network Exposure to Multiple Universes
  • Research Session 12: Diffusion in social networks
    • #556 Social Influence Based Clustering of Heterogeneous Information Networks
    • #1136 Confluence: Conformity Influence in Large Social Networks
    • #1006 Information Cascade at Group Scale
    • #120 Extracting Social Events for Learning Better Information Diffusion Models
  • Research Session 15: Social and information networks
  • Research Session 16: Graph mining and sampling
    • #752 Optimal Algorithms for Network Inference
    • #1148 Mining Discriminative Subgraphs from Global-state Networks

あれ?

http://arxiv.org/abs/1306.1153

To appear in KDD 2013 のはずなのにプログラムに無い……

おまけ

  • #543 Succinct Interval-Splitting Tree for Scalable Similarity Search of Compound-Protein Pairs with Property Constraints
    • Authors: Yasuo Tabei, JST; Akihiro Kishimoto, IBM Research, Dublin; Masaaki Kotera, Kyoto University; Yoshihiro Yamanishi, Kyushu university

田部井さん神