Detecting localized categorical attributes on graphs

Siheng Chen, Yaoqing Yang, Shi Zong, Aarti Singh, Jelena Kovacevic

Research output: Contribution to journalArticle

Abstract

Do users from Carnegie Mellon University form social communities on Facebook? Do signal processing researchers tightly collaborate with each other? Do Chinese restaurants in Manhattan cluster together? These seemingly different problems share a common structure: an attribute that may be localized on a graph. In other words, nodes activated by an attribute form a subgraph that can be easily separated from other nodes. In this paper, we thus focus on the task of detecting localized attributes on a graph. We are particularly interested in categorical attributes such as attributes in online social networks, ratings in recommender systems, and viruses in cyber-physical systems because they are widely used in numerous data mining applications. To solve the task, we formulate a statistical hypothesis testing problem to decide whether a given attribute is localized or not. We propose two statistics: Graph wavelet statistic and graph scan statistic, both of which are provably effective in detecting localized attributes. We validate the robustness of the proposed statistics on both simulated data and two real-world applications: High air-pollution detection and keyword ranking in a coauthorship network collected from IEEE Xplore. Experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient.

Original languageEnglish (US)
Article number7849228
Pages (from-to)2725-2740
Number of pages16
JournalIEEE Transactions on Signal Processing
Volume65
Issue number10
DOIs
StatePublished - Jan 1 2017

Fingerprint

Statistics
Pollution detection
Recommender systems
Air pollution
Viruses
Data mining
Signal processing
Testing

Keywords

  • Attribute graph
  • graph scan statistic
  • graph wavelet basis
  • ranking

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Detecting localized categorical attributes on graphs. / Chen, Siheng; Yang, Yaoqing; Zong, Shi; Singh, Aarti; Kovacevic, Jelena.

In: IEEE Transactions on Signal Processing, Vol. 65, No. 10, 7849228, 01.01.2017, p. 2725-2740.

Research output: Contribution to journalArticle

Chen, Siheng ; Yang, Yaoqing ; Zong, Shi ; Singh, Aarti ; Kovacevic, Jelena. / Detecting localized categorical attributes on graphs. In: IEEE Transactions on Signal Processing. 2017 ; Vol. 65, No. 10. pp. 2725-2740.
@article{275d422c92da473a8a14f34646251fb8,
title = "Detecting localized categorical attributes on graphs",
abstract = "Do users from Carnegie Mellon University form social communities on Facebook? Do signal processing researchers tightly collaborate with each other? Do Chinese restaurants in Manhattan cluster together? These seemingly different problems share a common structure: an attribute that may be localized on a graph. In other words, nodes activated by an attribute form a subgraph that can be easily separated from other nodes. In this paper, we thus focus on the task of detecting localized attributes on a graph. We are particularly interested in categorical attributes such as attributes in online social networks, ratings in recommender systems, and viruses in cyber-physical systems because they are widely used in numerous data mining applications. To solve the task, we formulate a statistical hypothesis testing problem to decide whether a given attribute is localized or not. We propose two statistics: Graph wavelet statistic and graph scan statistic, both of which are provably effective in detecting localized attributes. We validate the robustness of the proposed statistics on both simulated data and two real-world applications: High air-pollution detection and keyword ranking in a coauthorship network collected from IEEE Xplore. Experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient.",
keywords = "Attribute graph, graph scan statistic, graph wavelet basis, ranking",
author = "Siheng Chen and Yaoqing Yang and Shi Zong and Aarti Singh and Jelena Kovacevic",
year = "2017",
month = "1",
day = "1",
doi = "10.1109/TSP.2017.2666772",
language = "English (US)",
volume = "65",
pages = "2725--2740",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Detecting localized categorical attributes on graphs

AU - Chen, Siheng

AU - Yang, Yaoqing

AU - Zong, Shi

AU - Singh, Aarti

AU - Kovacevic, Jelena

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Do users from Carnegie Mellon University form social communities on Facebook? Do signal processing researchers tightly collaborate with each other? Do Chinese restaurants in Manhattan cluster together? These seemingly different problems share a common structure: an attribute that may be localized on a graph. In other words, nodes activated by an attribute form a subgraph that can be easily separated from other nodes. In this paper, we thus focus on the task of detecting localized attributes on a graph. We are particularly interested in categorical attributes such as attributes in online social networks, ratings in recommender systems, and viruses in cyber-physical systems because they are widely used in numerous data mining applications. To solve the task, we formulate a statistical hypothesis testing problem to decide whether a given attribute is localized or not. We propose two statistics: Graph wavelet statistic and graph scan statistic, both of which are provably effective in detecting localized attributes. We validate the robustness of the proposed statistics on both simulated data and two real-world applications: High air-pollution detection and keyword ranking in a coauthorship network collected from IEEE Xplore. Experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient.

AB - Do users from Carnegie Mellon University form social communities on Facebook? Do signal processing researchers tightly collaborate with each other? Do Chinese restaurants in Manhattan cluster together? These seemingly different problems share a common structure: an attribute that may be localized on a graph. In other words, nodes activated by an attribute form a subgraph that can be easily separated from other nodes. In this paper, we thus focus on the task of detecting localized attributes on a graph. We are particularly interested in categorical attributes such as attributes in online social networks, ratings in recommender systems, and viruses in cyber-physical systems because they are widely used in numerous data mining applications. To solve the task, we formulate a statistical hypothesis testing problem to decide whether a given attribute is localized or not. We propose two statistics: Graph wavelet statistic and graph scan statistic, both of which are provably effective in detecting localized attributes. We validate the robustness of the proposed statistics on both simulated data and two real-world applications: High air-pollution detection and keyword ranking in a coauthorship network collected from IEEE Xplore. Experimental results show that the proposed graph wavelet statistic and graph scan statistic are effective and efficient.

KW - Attribute graph

KW - graph scan statistic

KW - graph wavelet basis

KW - ranking

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

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

U2 - 10.1109/TSP.2017.2666772

DO - 10.1109/TSP.2017.2666772

M3 - Article

AN - SCOPUS:85017640755

VL - 65

SP - 2725

EP - 2740

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 10

M1 - 7849228

ER -