Detecting Localized Categorical Attributes on Graphs

• Published in: IEEE transactions on signal processing Vol. 65; no. 10; pp. 2725 - 2740
• Main Authors: Siheng Chen, Yaoqing Yang, Shi Zong, Singh, Aarti, Kovacevic, Jelena
• Format: Journal Article
• Language: English
• Published: IEEE 15.05.2017
• Subjects: Attribute graph; Facebook; graph scan statistic; graph wavelet basis; Noise measurement; ranking; Ranking (statistics); Signal processing; Testing; Topology
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2017.2666772

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.