Cluster Analysis in Graph Theory Rutgers University聚类分析在图论罗格斯大学.ppt

下载文档 降价啦

3
0
约8.29千字
约 15页
2016-12-30 发布于上海
举报
版权申诉
保障服务

Cluster Analysis in Graph Theory Rutgers University聚类分析在图论罗格斯大学.ppt

1、本文档共15页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Presented by: Alassane Ngaide, Frederic Anglade Clustering and Applications to Biodiversity Presented by: Alassane Ngaide, Frederic Anglade Mentors: Dr. Urmi Ghosh Dastidar, Dr. Gene Fiorini Basic Graph Definitions Graph: a graph G is a set of vertex (nodes) v connected by edges (links) e. Thus G=(v , e). Vertex (Node): Element of v Edge (Link): An edge e is a link between two nodes. Directed graph or directed graph: consists of vertices and edges with a flow of direction Undirected graph: consists of a set of vertices and a set of edges with no direction Cluster: Also called community, it refers to a group of nodes having denser relations with each other than with the rest of the network. A wide range of methods are used to reveal clusters in a network. FOOD WEB Food web: A directed graph representing an ecological community with arrow pointing from the preys towards the predators Each organism in a food web depends for food on one or many other organisms in an ecosystem. Predators: Eat preys Preys: Provide energy for predators Example of Food web Digraph A digraph is a directed Graph. Shark Sea otters Small fish kelp Sea urchins Large crab COMPETITION GRAPH Competition Graph: is a graph where the vertices are species in the ecosystem and there is an edge between two vertices if they have a common prey. If vertices are isolated, they either do not have any prey in common with the other species of the ecosystem or they are primary producers Weighted Competition graph: A graph that associates a weight with every edge in the competition graph. Weight shows the number of shared preys among the associated predators (nodes). How to Obtain a competition Graph Food web Diagraph Weighted Competition Graph 1 2 3 4 5 6 7 8 2 4 7 3 1 5 6 8 2 1 1 1 Adjacent Matrix of theWeighted competition Graph Laplacian Given A, the Laplacian matrix L is defined as: Normalized Laplacian Presented by: Alassane Ngaide, Frederic Anglade Spectral clustering Uses information obtai