KDD 2015

  • (Paper ID: 53) Panther: Fast Top-k Similarity Search on Large Networks
    • Jing Zhang, Tsinghua university; Jie Tang*, Tsinghua University; Cong Ma, Tsinghua; Hanghang Tong, ASU; Yu Jing, Tsinghua; Juanzi Li, Tsinghua University
  • (Paper ID: 54) COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency
    • Yutao Zhang*, Tsinghua University; Jie Tang, Tsinghua University; Zhilin Yang, Tsinghua University; Jian Pei, Simon Fraser University; Philip Yu, UIC
  • (Paper ID: 77) Online Influence Maximization
    • Siyu Lei, The University of Hong Kong; Silviu Maniu, The University of Hong Kong; Luyi Mo, The University of Hong Kong; Reynold Cheng*, ; Pierre Senellart, Telecom ParisTech
  • (Paper ID: 117) Edge-Weighted Personalized PageRank: Breaking A Decade-Old Performance Barrier
    • Wenlei Xie*, Cornell University; David Bindel, Cornell University; Alan Demers, Cornell University; Johannes Gehrke, Cornell University
  • (Paper ID: 127) Adaptive Message Update for Fast Affinity Propagation
    • Yasuhiro Fujiwara*, NTT; Makoto Nakatsuji, NTT; Hiroaki Shiokawa, NTT; Yasutoshi Ida, NTT; Machiko Toyoda, NTT
  • (Paper ID: 163) MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams
    • Yongsub Lim*, KAIST; U Kang, KAIST
  • (Paper ID: 236) Locally Densest Subgraph Discovery
    • Lu Qin*, UTS; Rong-Hua Li, SZU; Lijun Chang, ; Chengqi Zhang,
  • (Paper ID: 316) Network Lasso: Clustering and Optimization in Large-Scale Graphs
  • (Paper ID: 321) Set Cover at Web Scale
    • Stergios Stergiou*, Yahoo! Labs; Kostas Tsioutsiouliklis, Yahoo! Labs
  • (Paper ID: 342) TimeCrunch: Interpretable Dynamic Graph Summarization
    • Neil Shah*, ; Danai Koutra, Carnegie Mellon University; Tianmin Zou, Carnegie Mellon University; Brian Gallagher, Lawrence Livermore; Christos Faloutsos, Carnegie Mellon University
  • (Paper ID: 411) Integrating Vertex-centric Clustering with Edge-centric Clustering for Meta Path Graph Analysis
    • Yang Zhou*, Georgia Institute of Technology; Ling Liu, Georgia Institute of Technology; David Buttler,
  • (Paper ID: 434) An Evaluation of Parallel -- Eccentricity Estimation Algorithms on Real-World Graphs

Julian Shun*, Carnegie Mellon University

  • (Paper ID: 442) Influence at Scale: Distributed Computation of Complex Contagion in Networks
    • Yaron Singer*, Harvard; Joel Oren, University of Toronto; Brendan Lucier, Microsoft Research
  • (Paper ID: 563) Efficient Algorithms for Public-Private Social Networks
    • Flavio Chierichetti, """Sapienza Univ, Rome"""; Alessandro Epasto, Brown University; Ravi Kumar, Google; Silvio Lattanzi*, Google; Vahab Mirrokni, Google
  • (Paper ID: 621) Improved Bounds on the Dot Product under Random Projection and Random Sign Projection
    • Ata Kaban*, University of Birmingham
  • (Paper ID: 720) Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    • Michael Mitzenmacher, Harvard University; Jakub Pachocki, Carnegie Mellon University; Richard Peng, MIT; Charalampos (Paper ID: Babis) Tsourakakis*, Harvard University; Shen Xu , Carnegie Mellon University
  • (Paper ID: 754) A Learning-based Framework to handle Multi-round Multi-party influence maximization on social networks
    • Su-Chen Lin*, National Taiwan University; Shou-de Lin, National Taiwan University; Ming-Syan Chen, Academic Sinica
  • (Paper ID: 921) Deep Graph Kernels
    • Pinar Yanardag*, Purdue; S.V.N. Vishwanathan, UC Santa Cruz
  • (Paper ID: 872) Reciprocity in Social Networks with Capacity Constraints
    • Bo Jiang*, University of Massachusetts Am; Zhi-Li Zhang, University of Minnesota; Don Towsley, University of Massachusetts Amherst