Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati.

Slides:



Advertisements
Similar presentations
Presenter: Guoliang Liu Date:4/25/2012. Background Introduction Definition Basic idea of partition Quality Function Classification Based On Algorithms.
Advertisements

Network analysis Sushmita Roy BMI/CS 576
School of Computer Science Carnegie Mellon University Duke University DeltaCon: A Principled Massive- Graph Similarity Function Danai Koutra Joshua T.
The Connectivity and Fault-Tolerance of the Internet Topology
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,
Community Detection Algorithm and Community Quality Metric Mingming Chen & Boleslaw K. Szymanski Department of Computer Science Rensselaer Polytechnic.
Xiaowei Ying, Xintao Wu, Daniel Barbara Spectrum based Fraud Detection in Social Networks 1.
Information Networks Small World Networks Lecture 5.
Niloy Ganguly Complex Networks Research Group Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Kharagpur Collaborators.
1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.
Los Angeles September 27, 2006 MOBICOM Localization in Sparse Networks using Sweeps D. K. Goldenberg P. Bihler M. Cao J. Fang B. D. O. Anderson.
Discovering Overlapping Groups in Social Media Xufei Wang, Lei Tang, Huiji Gao, and Huan Liu Arizona State University.
Neighborhood Formation and Anomaly Detection in Bipartite Graphs Jimeng Sun Huiming Qu Deepayan Chakrabarti Christos Faloutsos Speaker: Jimeng Sun.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Distributed Coloring in Õ(  log n) Bit Rounds COST 293 GRAAL and.
Fast algorithm for detecting community structure in networks.
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Clustering Social Networks Isabelle Stanton, University of Virginia Joint work with Nina Mishra, Robert Schreiber, and Robert E. Tarjan.
Topologically biased random walks with application for community finding Vinko Zlatić Dep. Of Physics, “Sapienza”, Roma, Italia Theoretical Physics Division,
The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.
Social-Aware Collaborative Visualization for Large Scientific Projects Kwan-Liu Ma and Chaoli Wang CTS’085/21/2008.
1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.
Lecture 3 Power Law Structure Ding-Zhu Du Univ of Texas at Dallas.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Correctness of Gossip-Based Membership under Message Loss Maxim Gurevich, Idit Keidar Technion.
Midterm Presentation Undergraduate Researchers: Graduate Student Mentor: Faculty Mentor: Jordan Cowart, Katie Allmeroth Krist Culmer Dr. Wenjun (Kevin)
1 Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction Zequian shen, Kwan-Liu Ma, Tina Eliassi-Rad Department.
Social Network Analysis via Factor Graph Model
A Survey on Graph Visualization 1 Presented by Yang Zhang Dave Fuhry.
Dimacs Graph Mining (via Similarity Measures) Ye Zhu Stephanie REU-DIMACS, July 17, 2009 Mentor : James Abello.
Hao-Shang Ma and Jen-Wei Huang Knowledge and Information Discovery Lab, Dept. of Electrical Engineering, National Cheng Kung University The 7th Workshop.
Presentation: Random Walk Betweenness, J. Govorčin Laboratory for Data Technologies, Faculty of Information Studies, Novo mesto – September 22, 2011 Random.
Graph Abstraction for Simplified Proofreading of Slice-based Volume Segmentation Ronell Sicat 1, Markus Hadwiger 1, Niloy Mitra 1,2 1 King Abdullah University.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Jon Kleinberg (Cornell), Christos.
Discovering Community Structure
December 7-10, 2013, Dallas, Texas
A Discrepancy Detector James Abello, CCICADA-DIMACS FACULTY ( Student: Nishchal Devanur CS Dept Rutgers Goal To detect the most influential.
IEEE Int'l Symposium on Signal Processing and its Applications 1 An Unsupervised Learning Approach to Content-Based Image Retrieval Yixin Chen & James.
A Discrepancy Detector James Abello, CCICADA-DIMACS FACULTY ( Student: Nishchal Devanur CS Dept Rutgers Goal To detect the most influential.
Xiaowei Ying, Xintao Wu Dept. Software and Information Systems Univ. of N.C. – Charlotte 2008 SIAM Conference on Data Mining, April 25 th Atlanta, Georgia.
Lecture 1-5 Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas.
Exploit of Online Social Networks with Community-Based Graph Semi-Supervised Learning Mingzhen Mo and Irwin King Department of Computer Science and Engineering.
Guided Learning for Role Discovery (GLRD) Presented by Rui Liu Gilpin, Sean, Tina Eliassi-Rad, and Ian Davidson. "Guided learning for role discovery (glrd):
Advanced Software Engineering PROJECT November 2015.
Measuring Behavioral Trust in Social Networks
University at BuffaloThe State University of New York Detecting Community Structure in Networks.
Community Discovery in Social Network Yunming Ye Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs Maleq Khan September 9, 2014 Joint work with: Hasanuzzaman.
1 Optimal Allocation of Electronic Content in Networks Israel Cidon- Technion Shay Kutten- Technion Ran Soffer- Redux.
James Hipp Senior, Clemson University.  Graph Representation G = (V, E) V = Set of Vertices E = Set of Edges  Adjacency Matrix  No Self-Inclusion (i.
Limit theorems for the number of multiple edges in the configuration graph Irina Cheplyukova Karelian Research Centre of Russian Academy of Sciences
Non-Markovian Character in Human Mobility: Online and Offline 报告人:蔡世民 合作者:赵志丹,卢扬.
Lifang He College of Computer Science and Software Engineering
Motoki Shiga, Ichigaku Takigawa, Hiroshi Mamitsuka
Cohesive Subgraph Computation over Large Graphs
Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas
Random walks on complex networks
Sam Somuah REU-DIMACS 2010 Mentor: James Abello
Generative models preserving community structure
Graph and Tensor Mining for fun and profit
Groups of vertices and Core-periphery structure
Network Science: A Short Introduction i3 Workshop
Generative models preserving community structure
Department of Computer Science University of York
A Dynamic System Analysis of Simultaneous Recurrent Neural Network
Algorithms Lecture # 27 Dr. Sohail Aslam.
Fig. 3 Faculty placement distributions.
Presentation transcript:

Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati Faculty Mentors: Dr. James Abello & Dr. Tina Eliassi-Rad Graduate mentor: Monica Babes Vroman Aug 3, 2011

Motivation Complex networks are ubiquitous –Examples: social networks, Internet, WWW, etc. Community discovery & visual tools allow us to “make sense” of the underlying structure of networks InternetFriendship

Les Miserables Character Co-occurrence Network Before After

Goal: Bring Human in the Loop Community Discovery (Fast Modularity*) Input Network Visual Analytics (our contribution) Output Network * [Clauset, et al. 2004]

Maximizes modularity, Q: measures the fraction of all edges within communities minus the expected number in a random graph with the same degrees –m = number of edges in the graph –A vw = 1 if v→w; 0 otherwise –k v = degree of vertex v –δ(i, j) = 1 if i == j; 0 otherwise Part of the Community Analysis Tool (CAT) Fast Modularity [Clauset, et al., Phys. Rev. E. 2004]

Our Contribution So Far (I) Allow user to change the community of a node –Update its color and position –Track changes –Re-compute modularity Add new communities Constraints before clustering

Our Contribution So Far (II) Suggest changes –Which nodes are least “comfortable” in their community –Nodes blink the color of their desired community Provide a more detailed history of changes

Next Steps Find a quicker way to determine a node’s “comfort” Bound distance from local maximum Move groups of nodes at once

References [1] A. Clauset, M.E.J. Newman and C. Moore, "Finding community structure in very large networks." Phys. Rev. E 70, (2004). [2] Keith Henderson, Tina Eliassi-Rad, Spiros Papadimitriou, Christos Faloutsos: HCDF: A Hybrid Community Discovery Framework. SDM 2010: [3] J. Abello, F. van Ham, and N. Krishnan, “Ask-graphview: A large scale graph visualization system”, IEEE TVCG journal, Vol. 12, No. 5, pp. 669– 676, [4] J. Leskovec, K. Lang, M. Mahoney: Empirical Comparison of Algorithms for Network Community Detection. WWW 2010: [5] Zeqian Shen, Kwan-Liu Ma, Tina Eliassi-Rad: Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction. IEEE Trans. Vis. Comput. Graph. 12(6): (2006).

Thank You! Questions?