Computing triangle and open-wedge heavy-hitters in large networks

A. Pavan, P. Quint, S. Scott, N. V. Vinodchandran, J. Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We formalize notions of triangle and open-wedge heavy-hitters in large networks. Intuitively, a node of a network G is a triangle heavy-hitter if it participates in relatively many triangles of G (analogously for open wedges). These notions have applications in social network analysis. We consider the triangle and open-wedge heavy-hitter problems: the computational problems of maintaining a set of nodes of a network that participate in many triangles and open wedges. We give sampling-based algorithms for these problems when the input network G comes as an edge stream. We prove theoretical guarantees on the quality of solutions, time and space complexity of these algorithms. This is the first work that studies the triangle and open-wedge heavy hitters problem on massive streaming networks. We evaluate the performance of our proposed algorithms by running on several real-world data sets. These experiments indicate that our algorithms efficiently detect heavy hitters while keeping both the false-positive and the false-negative errors very low.

Original languageEnglish (US)
Title of host publicationProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
EditorsRonay Ak, George Karypis, Yinglong Xia, Xiaohua Tony Hu, Philip S. Yu, James Joshi, Lyle Ungar, Ling Liu, Aki-Hiro Sato, Toyotaro Suzumura, Sudarsan Rachuri, Rama Govindaraju, Weijia Xu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages998-1005
Number of pages8
ISBN (Electronic)9781467390040
DOIs
StatePublished - Jan 1 2016
Event4th IEEE International Conference on Big Data, Big Data 2016 - Washington, United States
Duration: Dec 5 2016Dec 8 2016

Publication series

NameProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

Other

Other4th IEEE International Conference on Big Data, Big Data 2016
CountryUnited States
CityWashington
Period12/5/1612/8/16

Fingerprint

Electric network analysis
Sampling
Experiments

Keywords

  • link and graph mining
  • social network analysis
  • stream data mining
  • triangle heavy hitters

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Hardware and Architecture

Cite this

Pavan, A., Quint, P., Scott, S., Vinodchandran, N. V., & Smith, J. (2016). Computing triangle and open-wedge heavy-hitters in large networks. In R. Ak, G. Karypis, Y. Xia, X. T. Hu, P. S. Yu, J. Joshi, L. Ungar, L. Liu, A-H. Sato, T. Suzumura, S. Rachuri, R. Govindaraju, ... W. Xu (Eds.), Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 (pp. 998-1005). [7840699] (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BigData.2016.7840699

Computing triangle and open-wedge heavy-hitters in large networks. / Pavan, A.; Quint, P.; Scott, S.; Vinodchandran, N. V.; Smith, J.

Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. ed. / Ronay Ak; George Karypis; Yinglong Xia; Xiaohua Tony Hu; Philip S. Yu; James Joshi; Lyle Ungar; Ling Liu; Aki-Hiro Sato; Toyotaro Suzumura; Sudarsan Rachuri; Rama Govindaraju; Weijia Xu. Institute of Electrical and Electronics Engineers Inc., 2016. p. 998-1005 7840699 (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pavan, A, Quint, P, Scott, S, Vinodchandran, NV & Smith, J 2016, Computing triangle and open-wedge heavy-hitters in large networks. in R Ak, G Karypis, Y Xia, XT Hu, PS Yu, J Joshi, L Ungar, L Liu, A-H Sato, T Suzumura, S Rachuri, R Govindaraju & W Xu (eds), Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016., 7840699, Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016, Institute of Electrical and Electronics Engineers Inc., pp. 998-1005, 4th IEEE International Conference on Big Data, Big Data 2016, Washington, United States, 12/5/16. https://doi.org/10.1109/BigData.2016.7840699
Pavan A, Quint P, Scott S, Vinodchandran NV, Smith J. Computing triangle and open-wedge heavy-hitters in large networks. In Ak R, Karypis G, Xia Y, Hu XT, Yu PS, Joshi J, Ungar L, Liu L, Sato A-H, Suzumura T, Rachuri S, Govindaraju R, Xu W, editors, Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 998-1005. 7840699. (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016). https://doi.org/10.1109/BigData.2016.7840699
Pavan, A. ; Quint, P. ; Scott, S. ; Vinodchandran, N. V. ; Smith, J. / Computing triangle and open-wedge heavy-hitters in large networks. Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. editor / Ronay Ak ; George Karypis ; Yinglong Xia ; Xiaohua Tony Hu ; Philip S. Yu ; James Joshi ; Lyle Ungar ; Ling Liu ; Aki-Hiro Sato ; Toyotaro Suzumura ; Sudarsan Rachuri ; Rama Govindaraju ; Weijia Xu. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 998-1005 (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016).
@inproceedings{d47ed25f702a4571ab6f6136fd18260b,
title = "Computing triangle and open-wedge heavy-hitters in large networks",
abstract = "We formalize notions of triangle and open-wedge heavy-hitters in large networks. Intuitively, a node of a network G is a triangle heavy-hitter if it participates in relatively many triangles of G (analogously for open wedges). These notions have applications in social network analysis. We consider the triangle and open-wedge heavy-hitter problems: the computational problems of maintaining a set of nodes of a network that participate in many triangles and open wedges. We give sampling-based algorithms for these problems when the input network G comes as an edge stream. We prove theoretical guarantees on the quality of solutions, time and space complexity of these algorithms. This is the first work that studies the triangle and open-wedge heavy hitters problem on massive streaming networks. We evaluate the performance of our proposed algorithms by running on several real-world data sets. These experiments indicate that our algorithms efficiently detect heavy hitters while keeping both the false-positive and the false-negative errors very low.",
keywords = "link and graph mining, social network analysis, stream data mining, triangle heavy hitters",
author = "A. Pavan and P. Quint and S. Scott and Vinodchandran, {N. V.} and J. Smith",
year = "2016",
month = "1",
day = "1",
doi = "10.1109/BigData.2016.7840699",
language = "English (US)",
series = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "998--1005",
editor = "Ronay Ak and George Karypis and Yinglong Xia and Hu, {Xiaohua Tony} and Yu, {Philip S.} and James Joshi and Lyle Ungar and Ling Liu and Aki-Hiro Sato and Toyotaro Suzumura and Sudarsan Rachuri and Rama Govindaraju and Weijia Xu",
booktitle = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",

}

TY - GEN

T1 - Computing triangle and open-wedge heavy-hitters in large networks

AU - Pavan, A.

AU - Quint, P.

AU - Scott, S.

AU - Vinodchandran, N. V.

AU - Smith, J.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We formalize notions of triangle and open-wedge heavy-hitters in large networks. Intuitively, a node of a network G is a triangle heavy-hitter if it participates in relatively many triangles of G (analogously for open wedges). These notions have applications in social network analysis. We consider the triangle and open-wedge heavy-hitter problems: the computational problems of maintaining a set of nodes of a network that participate in many triangles and open wedges. We give sampling-based algorithms for these problems when the input network G comes as an edge stream. We prove theoretical guarantees on the quality of solutions, time and space complexity of these algorithms. This is the first work that studies the triangle and open-wedge heavy hitters problem on massive streaming networks. We evaluate the performance of our proposed algorithms by running on several real-world data sets. These experiments indicate that our algorithms efficiently detect heavy hitters while keeping both the false-positive and the false-negative errors very low.

AB - We formalize notions of triangle and open-wedge heavy-hitters in large networks. Intuitively, a node of a network G is a triangle heavy-hitter if it participates in relatively many triangles of G (analogously for open wedges). These notions have applications in social network analysis. We consider the triangle and open-wedge heavy-hitter problems: the computational problems of maintaining a set of nodes of a network that participate in many triangles and open wedges. We give sampling-based algorithms for these problems when the input network G comes as an edge stream. We prove theoretical guarantees on the quality of solutions, time and space complexity of these algorithms. This is the first work that studies the triangle and open-wedge heavy hitters problem on massive streaming networks. We evaluate the performance of our proposed algorithms by running on several real-world data sets. These experiments indicate that our algorithms efficiently detect heavy hitters while keeping both the false-positive and the false-negative errors very low.

KW - link and graph mining

KW - social network analysis

KW - stream data mining

KW - triangle heavy hitters

UR - http://www.scopus.com/inward/record.url?scp=85015201452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015201452&partnerID=8YFLogxK

U2 - 10.1109/BigData.2016.7840699

DO - 10.1109/BigData.2016.7840699

M3 - Conference contribution

AN - SCOPUS:85015201452

T3 - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

SP - 998

EP - 1005

BT - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

A2 - Ak, Ronay

A2 - Karypis, George

A2 - Xia, Yinglong

A2 - Hu, Xiaohua Tony

A2 - Yu, Philip S.

A2 - Joshi, James

A2 - Ungar, Lyle

A2 - Liu, Ling

A2 - Sato, Aki-Hiro

A2 - Suzumura, Toyotaro

A2 - Rachuri, Sudarsan

A2 - Govindaraju, Rama

A2 - Xu, Weijia

PB - Institute of Electrical and Electronics Engineers Inc.

ER -