CommunityStructure

CommunityStructure - Computational Molecular Biology...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Computational Molecular Biology Community Structures
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
My T. Thai mythai@cise.ufl.edu 2 What is Community Structure Definition: A community is a group of nodes in which: There are more edges (interactions) between nodes within the group than to nodes outside of it
Background image of page 2
My T. Thai mythai@cise.ufl.edu 3 Why Community Structure (CS)? Many systems can be expressed by a network, in which nodes represent the objects and edges represent the relations between them: Social networks: collaboration, online social networks Technological networks: IP address networks, WWW, software dependency Biological networks: protein interaction networks, metabolic networks, gene regulatory networks
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Why CS? My T. Thai mythai@cise.ufl.edu 4 Yeast Protein interaction networks
Background image of page 4
Why CS? My T. Thai mythai@cise.ufl.edu 5 IP address network
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
My T. Thai mythai@cise.ufl.edu 6 Why Community Structure? Nodes in a community have some common properties Communities represent some properties of a networks Examples: In social networks, represent social groupings based on interest or background In citation networks, represent related papers on one topic In metabolic networks, represent cycles and other functional groupings
Background image of page 6
My T. Thai mythai@cise.ufl.edu 7 How to detect a community?
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
My T. Thai mythai@cise.ufl.edu 8 Early Work Using hierarchical clustering Overview of this method: For each pair (u,v), calculate weight w uv which represents how closely connected u and v are Initialize G = (V, emptyset) At each iteration, add an edge with the strongest weight
Background image of page 8
My T. Thai mythai@cise.ufl.edu 9 Early Work
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
My T. Thai mythai@cise.ufl.edu 10 Early Work How to define the weight w uv Many different methods have been proposed: Number disjoint paths between u and v Number of possible paths between u and v Disadvantages: Tendency to separate the boundary vertices from the communities (to which they should belong)
Background image of page 10
My T. Thai mythai@cise.ufl.edu 11 An Overview of Recent Work
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/20/2011 for the course CAP 5515 taught by Professor Ungor during the Spring '08 term at University of Florida.

Page1 / 40

CommunityStructure - Computational Molecular Biology...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online