- 1、本文档共36页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Introduction to Graph Mining Gaolin School of Computer Science and Technology Xidian University Course Information Instructors: Lin Gao Office: Main building I-427 Email: lgao@mail.xidian.edu.cn Phone:Course Information Prerequisites Database systems, Introduction to Data Mining Methods of instruction Teaching Students are expected to read some research papers Evaluation Attendance and participation 20% Presentation and talks 80% Outline Why graph mining Graph theoretic concepts Graph pattern mining Graph clustering Graph classification Application and exploration with graph mining Future work Why Graph Mining and Searching? Graphs are ubiquitous Chemical compounds (Cheminformatics) Protein structures, biological pathways/networks (Bioinformactics) Program control flow, traffic flow, and workflow analysis XML databases, Web, and social network analysis Graph is a general model Trees, lattices, sequences, and items are degenerated graphs the graph easily represents entities, attributes, and relationships Diversity of graphs Directed vs. undirected, labeled vs. unlabeled (edges vertices), weighted, with angles geometry (topological vs. 2-D/3-D) Complexity of algorithms: many problems are of high complexity Graph, Graph, Everywhere Graph theoretic concepts Basic concept: distance, diameter, path, neighborhood, clique, degree, cut, core, adjacency matrix Advanced measurement Density of a graph Clustering coefficient Centrality Connectivity Degree of a node vi The number of links from vi to other nodes Incoming degree and outgoing degree for directed networks Adjacent neighbors, N(vi), of a node vi A set of nodes linked from vi Degree distribution, P(k) Probability that a node has exactly k links The number of nodes whose degree is k over the total number of nodes * Connectivity may be of interest for a single node (e.g., degree or clustering coefficient) as well as the entire netw
文档评论(0)