首页> 外文学位 >Beyond simple relations: Mining and search in temporal, composite and semantic graphs.
【24h】

Beyond simple relations: Mining and search in temporal, composite and semantic graphs.

机译:超越简单关系:在时间图,合成图和语义图中进行挖掘和搜索。

获取原文
获取原文并翻译 | 示例

摘要

The current "Big Data" boom coincides with the realization that data entities across systems are not independent. In order to allow realistic discovery in many domains like natural sciences, on-line social systems and media, transportation and economics, one needs to consider their underlying networks. Graphs and corresponding mining and analysis algorithms provide a powerful framework for analysis of big networked data. All graph application domains, however, include more facets than simply binary relations among entities. Networks may (i) evolve over time; (ii) incorporate multiple layers; and (iii) exhibit special node/edge semantics such as collaboration compatibility, opposition/agreement and others. While, taking such rich information into account allows for more realistic analysis and mining for characteristic domain phenomena, it also introduces novel computational challenges.;In this thesis, I develop methods for mining and search in large graphs that observe temporal evolution of edge/node values, multi-type edges or special semantics of tie strength. In the area of temporal networks, I introduce the problem of the heaviest dynamic subgraph and corresponding mining methods that scale to large real world instances. I consider composite networks for function prediction in biology and multi-criteria proximity search in social and information multi-mode networks. I employ signed and labeled relations to study agreement and disagreement and for mining group effectiveness in collaboration networks. The urgent need to incorporate such rich information in graph analysis and mining is the commonality among the above three directions in my thesis. My primary focus in every chapter is on algorithms that scale to real-world networks and simultaneously maintain high quality of the obtained results.;Overall, I propose core mining and search algorithms that extend the current state of the art in computer science research. The utility of rich network information such as time, multi-modality and special semantics acts as a unifying theme in all chapters and across the various applications domains including, but not limited to, bioinformatics, communication graphs, social networks and media, collaboration and effectiveness of teams, sensor networks, and transportation networks.
机译:当前的“大数据”热潮恰逢人们意识到跨系统的数据实体不是独立的。为了允许在自然科学,在线社会系统和媒体,运输和经济学等许多领域进行现实发现,人们需要考虑其基础网络。图以及相应的挖掘和分析算法为分析大型网络数据提供了强大的框架。但是,所有图形应用程序领域都包含多个方面,而不仅仅是实体之间的二进制关系。网络可能(i)随着时间的推移而发展; (ii)合并多层; (iii)具有特殊的节点/边缘语义,例如协作兼容性,对立/协议等。同时,考虑到如此丰富的信息,可以对特征域现象进行更现实的分析和挖掘,同时也带来了新的计算挑战。;在本文中,我开发了用于在观察边沿/节点时间演化的大图中进行挖掘和搜索的方法值,多种类型的边或连接强度的特殊含义。在时态网络领域,我介绍了最重的动态子图的问题以及相应的挖掘方法,这些方法可以扩展到大型现实世界实例。我考虑了用于生物学功能预测的复合网络以及社会和信息多模式网络中的多标准邻近搜索。我采用已签名和加标签的关系来研究协议和分歧,以及在协作网络中挖掘小组的有效性。在本文的上述三个方向中,迫切需要将如此丰富的信息纳入图分析和挖掘中。在每一章中,我的主要重点是可扩展到实际网络并同时保持所获得结果的高质量的算法。总体而言,我提出了核心挖掘和搜索算法,这些算法扩展了计算机科学研究的最新水平。丰富的网络信息(例如时间,多模式和特殊语义)的实用性在所有章节中以及包括但不限于生物信息学,通信图,社交网络和媒体,协作与有效性的各个应用领域中都是统一的主题。团队,传感器网络和运输网络。

著录项

  • 作者

    Bogdanov, Petko.;

  • 作者单位

    University of California, Santa Barbara.;

  • 授予单位 University of California, Santa Barbara.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2012
  • 页码 259 p.
  • 总页数 259
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

  • 入库时间 2022-08-17 11:42:31

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号