Scribd
Upload
33 views15 pages

UNIT - II - Community Analysis

The document discusses types of social communities including explicit and implicit communities. It also discusses community detection algorithms including member-based and group-based detection as well as characteristics like node similarity, degree, and reachability. Finally, it discusses community evolution patterns like segmentation, densification, and diameter shrinkage over time.

Uploaded by

vani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
33 views15 pages

UNIT - II - Community Analysis

The document discusses types of social communities including explicit and implicit communities. It also discusses community detection algorithms including member-based and group-based detection as well as characteristics like node similarity, degree, and reachability. Finally, it discusses community evolution patterns like segmentation, densification, and diameter shrinkage over time.

Uploaded by

vani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

UNIT – II

COMMUNITY ANALYSIS
Social Communities:
formation of any community requires
(1) a set of at least two nodes sharing some interest and
(2) interactions with respect to that interest
Types of communities:
1. Explicit communities – emic community
Should satisfy following criteria:
• Community members understand that they are its members.
• Nonmembers understand who the community members are
• Community members often have more interactions with each other than with
nonmembers.
1. Implicit communities - etic communities, individuals tacitly interact with
others in the form of an unacknowledged community
Social Communities
• Examples of explicit communities in well-known social media sites
include the following:
• Facebook.
• Yahoo! Groups.
• LinkedIn.
Community Detection Algorithms
Community Detection Algorithms
• Communities can be detected based on
• (1) specific members or
• (2) specific forms of communities.

• Types of communities:
1. member-based community detection
2. group-based commu nity detection.
Community Detection Algorithms
Member-Based Community Detection
• characteristics that are frequently used are,
• Node similarity,
• Node degree(familiarity), and
• node reachability

• Example of node reachability


Node degree
• The most common subgraph searched for in networks based on node
degrees is a clique.
• A clique is a maximum complete subgraph in which all pairs of nodes
inside the subgraph are connected.
• Node Reachability:
• There should be a path between them.
• They are so close as to be immediate neighbors.
• Node similarity – similarity between nodes.
Brute force clique identification algorithm
Clique Percolation Method (CPM)
K-clique,k-club,k-clan
• K- clique and k-club are same.
• K-clan – is a clique with shortest path.

• Node similarity
Community Evolution
• In community detection - assume that networks are static; that is,
their nodes and edges are fixed and do not change over time.
• Community detection algorithms have to be extended to deal with
evolving networks.
• three common patterns that are observed in evolving networks:
• 1.segmentation,
• 2.densification, and
• 3.diameter shrinkage.
Network Segmentation
• In evolving networks, segmentation takes place, where the large
network is decomposed over time into three parts:
Graph Densification
• It is observed in evolving graphs that the density of the graph
increases as the network grows.
• Density – the number of edges increases faster than the number of
nodes. This is called densification.
Network Segmentation
Diameter Shrinkage
• Another property observed in large networks is that the network
diameter shrinks in time. This property has been observed in random
graphs.

You might also like