Efficient Processing of Network Proximity Queries via Chebyshev Acceleration

COŞKUN M., Koyuturk M., Grama A.

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD ’xx16, San Francisco, California, USA, 13 - 17 Ağustos 2016 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1145/2939672.2939828
  • Basıldığı Şehir: San Francisco, California, USA
  • Anahtar Kelimeler: Network proximity, Random walk with restarts, Chebyshev polynomials, RANDOM-WALK, PAGERANK
  • Ankara Üniversitesi Adresli: Evet

Özet

Network proximity is at the heart arge class of network analytics and information retrieval techniques, including node,/ edge rankings, network alignment, and random walk based proximity queries, among many others. Owing to its importance, significant effort has been devoted to accelerating iterative processes underlying network proximity computations. These techniques rely on numerical properties of power iterations, as well as structural properties of the networks to reduce the runtime of iterative algorithms.