Robust Local Community Detection: On Free Rider Effect and Its Elimination 1 Case Western Reserve University Yubao Wu 1, Ruoming Jin 2, Jing Li 1, Xiang.

Slides:

Advertisements

Similar presentations

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.

Advertisements

Charalampos (Babis) E. Tsourakakis KDD 2013 KDD'131.

Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tianyu Wo Capturing Topology in Graph Pattern Matching University of Edinburgh.

Distance-Constraint Reachability Computation in Uncertain Graphs Ruoming Jin, Lin Liu Kent State University Bolin Ding UIUC Haixun Wang MSRA.

Spectral graph reduction for image and streaming video segmentation Fabio Galasso 1 Margret Keuper 2 Thomas Brox 2 Bernt Schiele 1 1 Max Planck Institute.

Mauro Sozio and Aristides Gionis Presented By:

Modularity and community structure in networks

Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,

Clustering Social Networks Isabelle Stanton, University of Virginia Joint work with Nina Mishra, Robert Schreiber, and Robert E. Tarjan.

Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.

Frequent Subgraph Pattern Mining on Uncertain Graph Data

An Efficient Parallel Approach for Identifying Protein Families from Large-scale Metagenomics Data Changjun Wu, Ananth Kalyanaraman School of Electrical.

Yubao Wu 1, Ruoming Jin 2, Xiang Zhang 1

Finding Dense and Connected Subgraphs in Dual Networks

Clustering Social Networks Isabelle Stanton, University of Virginia Joint work with Nina Mishra, Robert Schreiber, and Robert E. Tarjan.

Efficiently Answering Reachability Queries on Large Directed Graphs Ruoming Jin Kent State University Joint work with Yang Xiang (KSU), Ning Ruan (KSU),

The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.

Structure based Data De-anonymization of Social Networks and Mobility Traces Shouling Ji, Weiqing Li, and Raheem Beyah Georgia Institute of Technology.

Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.

Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.

The Relative Vertex-to-Vertex Clustering Value 1 A New Criterion for the Fast Detection of Functional Modules in Protein Interaction Networks Zina Mohamed.

Log Dimension Hypothesis1 The Logarithmic Dimension Hypothesis Anthony Bonato Ryerson University MITACS International Problem Solving Workshop July 2012.

Neighbourhood Sampling for Local Properties on a Graph Stream A. Pavan, Iowa State University Kanat Tangwongsan, IBM Research Srikanta Tirthapura, Iowa.

Improved Sparse Covers for Graphs Excluding a Fixed Minor Ryan LaFortune (RPI), Costas Busch (LSU), and Srikanta Tirthapura (ISU)

Hao-Shang Ma and Jen-Wei Huang Knowledge and Information Discovery Lab, Dept. of Electrical Engineering, National Cheng Kung University The 7th Workshop.

Outlier Detection Using k-Nearest Neighbour Graph Ville Hautamäki, Ismo Kärkkäinen and Pasi Fränti Department of Computer Science University of Joensuu,

Mehdi Kargar Aijun An York University, Toronto, Canada Discovering Top-k Teams of Experts with/without a Leader in Social Networks.

Mehdi Kargar Aijun An York University, Toronto, Canada Keyword Search in Graphs: Finding r-cliques.

Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.

Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.

Discovery from Linking Open Data (LOD) Annotated Datasets Louiqa Raschid University of Maryland PAnG/PSL/ANAPSID/Manjal.

Xiangnan Kong,Philip S. Yu Department of Computer Science University of Illinois at Chicago KDD 2010.

Mehdi Kargar Aijun An York University, Toronto, Canada Keyword Search in Graphs: Finding r-cliques.

Xiaowei Ying, Xintao Wu Univ. of North Carolina at Charlotte PAKDD-09 April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks.

Page 1 Inferring Relevant Social Networks from Interpersonal Communication Munmun De Choudhury, Winter Mason, Jake Hofman and Duncan Watts WWW ’10 Summarized.

A Local Seed Selection Algorithm for Overlapping Community Detection 1 A Local Seed Selection Algorithm for Overlapping Community Detection Farnaz Moradi,

University at BuffaloThe State University of New York Lei Shi Department of Computer Science and Engineering State University of New York at Buffalo Frequent.

1 Panther: Fast Top-K Similarity Search on Large Networks Jing Zhang 1, Jie Tang 1, Cong Ma 1, Hanghang Tong 2, Yu Jing 1, and Juanzi Li 1 1 Department.

Guided Learning for Role Discovery (GLRD) Presented by Rui Liu Gilpin, Sean, Tina Eliassi-Rad, and Ian Davidson. "Guided learning for role discovery (glrd):

1 Epidemic Spreading Parameters: External Model based on population density and travel statistics.

University at BuffaloThe State University of New York Detecting Community Structure in Networks.

Panther: Fast Top-k Similarity Search in Large Networks JING ZHANG, JIE TANG, CONG MA, HANGHANG TONG, YU JING, AND JUANZI LI Presented by Moumita Chanda.

Community Discovery in Social Network Yunming Ye Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.

Melbourne, Australia, Oct., 2015 gSparsify: Graph Motif Based Sparsification for Graph Clustering Peixiang Zhao Department of Computer Science Florida.

Kijung Shin Jinhong Jung Lee Sael U Kang

Overlapping Community Detection in Networks

Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.

Bo Zong, Yinghui Wu, Ambuj K. Singh, Xifeng Yan 1 Inferring the Underlying Structure of Information Cascades

Yinghui Wu, SIGMOD Incremental Graph Pattern Matching Wenfei Fan Xin Wang Yinghui Wu University of Edinburgh Jianzhong Li Jizhou Luo Harbin Institute.

Network applications Sushmita Roy BMI/CS 576 Dec 9 th, 2014.

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

A Connectivity-Based Popularity Prediction Approach for Social Networks Huangmao Quan, Ana Milicic, Slobodan Vucetic, and Jie Wu Department of Computer.

Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.

Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.

Outline Introduction State-of-the-art solutions Equi-Truss Experiments

Cohesive Subgraph Computation over Large Graphs

Finding Dense and Connected Subgraphs in Dual Networks

Groups of vertices and Core-periphery structure

Lecture 11 Graph Algorithms

Saliency detection with background model

Distributed Representations of Subgraphs

Large Graph Mining: Power Tools and a Practitioner’s guide

Jinhong Jung, Woojung Jin, Lee Sael, U Kang, ICDM ‘16

Overcoming Resolution Limits in MDL Community Detection

Haitao Wang Utah State University SoCG 2017, Brisbane, Australia

Affiliation Network Models of Clusters in Networks

Lecture 10 Graph Algorithms

Lecture 28 Approximation of Set Cover

Distance-Constraint Reachability Computation in Uncertain Graphs

Introduction Dataset search

Presentation transcript:

Robust Local Community Detection: On Free Rider Effect and Its Elimination 1 Case Western Reserve University Yubao Wu 1, Ruoming Jin 2, Jing Li 1, Xiang Zhang 1 2 Kent State University

Generic Local Community Detection Problem [1] M. Sozio, et al. KDD’10. [2] W. Cui, et al. SIGMOD’14. [3] L. Ma, et al. DaWak’13. [4] B. Saha, et al. RECOMB’10. [5] C. Tsourakakis, et al. SIGMOD’14. [6] A. Clauset, PRE’05. [7] F. Luo, et al. WIAS’08. [8] R. Andersen, et al. FOCS’06. A

Community Goodness Metrics [1] B. Saha, et al. RECOMB’10. [2] C. Tsourakakis, et al. SIGMOD’14. [3] M. Sozio, et al. KDD’10. [4] W. Cui, et al. SIGMOD’14. [5] F. Luo, et al. WIAS’08. [6] K. J. Lang, CIKM’07. [7] R. Andersen, et al. FOCS’06. [8] A. Clauset, PRE’05. IntuitionsGoodness metricsRef. Internal denseness Classic density[1] Edge-surplus[2] Minimum degree[3,4] Internal denseness & external sparseness Subgraph modularity[5] Density-isolation[6] External conductance[7] Boundary sharpness Local modularity[8]

Free Rider Effect Goodness metricsA Classic density Edge-surplus Minimum degree 444 Subgraph modularity Density-isolation Ext. conductance Local modularity [1] B. Saha, et al. RECOMB’10. [2] C. Tsourakakis, et al. SIGMOD’14. [3] M. Sozio, et al. KDD’10. [4] W. Cui, et al. SIGMOD’14. [5] F. Luo, et al. WIAS’08. [6] K. J. Lang, CIKM’07. [7] R. Andersen, et al. FOCS’06. [8] A. Clauset, PRE’05.

Free Rider Effect in Real Networks (a) Co-author network(b) Biological network Barna, Saha, et al. Dense subgraphs with restrictions and applications to gene annotation graphs. RECOMB, One existing method: classic density

Query Biased Node Weighting Query biased density: Subgraph A becomes the query biased densest subgraph Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

QDC Problem Query biased densest connected subgraph (QDC) problem: Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

QDCQDC’QDC’’ Input ComplexityNP-hardPolynomial QDC Problem and Two Related Problems Optimal Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

Finding the QDC’’ 1. Removing Low Degree Nodes 2. Detect the Densest Subgraph Finding the QDC’ Subgraph contraction Reduce the search space Retain the densest subgraph On the reduced search space Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

Finding the QDC Greedy Node DeletionLocal Expansion 1)Delete low degree nodes 2)Maintain the connectivity 1)Connect the query nodes with a Steiner tree 2)Greedy local expansion Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

Experiments——Datasets Dataset# Nodes# Edges# Communities Amazon00,334,8630,000,925,8720,151,037 DBLP00,317,0800,001,049,8660,013,477 Youtube01,134,8900,002,987,6240,008,385 Orkut03,072,4410,117,185,0836,288,363 LiveJournal03,997,9620,034,681,1890,287,512 Friendster65,608,3661,806,067,1350,957,154 [1] J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In ICDM, [2] snap.stanford.edu

Experiments——State-of-the-Art Methods ClassesAbbr.Ref.Key Idea Internal denseness DS[1]Densest subgraph with query constraint OQC[2]Optimal quasi-clique; edge-surplus MDG[3]Minimum degree Internal denseness & external sparseness PRN[4]External conductance LS[5]Local spectral EMC[6]More internal edges than external edges SM[7]Subgraph modularity BoundaryLM[8]Local modularity [1] B. Saha, et al. RECOMB’10. [2] C. Tsourakakis, et al. SIGMOD’14. [3] M. Sozio, et al. KDD’10. [4] R. Andersen, et al. FOCS’06. [5] M. W. Mahoney, et al. JMLR’12. [6] G. W. Flake, KDD’00. [7] F. Luo, et al. WIAS’08. [8] A. Clauset, PRE’05.

Experiments——Effectiveness Evaluat. Metrics MetricsFormulas F-score Community goodness metrics Density Cohesiveness Separability Consistency [1] J. Yang and J. Leskovec. Dening and evaluating network communities based on ground-truth. In ICDM, pages , [2] Ma, Lianhang, et al. GMAC: A seed-insensitive approach to local community detection. In DaWak, pages , 2013.

Effectiveness Evaluation —— F-Score F-scoreQDCDSOQCMDGPRNLSEMCSMLM Amazon DBLP Youtube Orkut LiveJournal Friendster Avg. F-score Avg. Precision Avg. Recall Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

Effectiveness Evaluation——Goodness Metrics Community goodness metrics on LiveJournal graph Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

Effectiveness Evaluation——Consistency ConsistencyQDCDSOQCMDGPRNLSEMCSMLM Amazon DBLP Youtube Orkut LiveJournal Friendster Average Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , 2015.

Conclusions 1) Free rider effect is a serious problem; Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. Robust local community detection: on free rider effect and its elimination. PVLDB, 8(7): , ) Query biased node weighting scheme can effectively eliminate the free rider effect thus improve the accuracy.