2014-ICDE论文集总结.docx

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

2014-ICDE论文集 ICDE RESEARCH SESSIONS Research Papers Session 1 Clustering? Incremental Cluster Evolution Tracking from Highly Dynamic Network Data(s hxy) Pei Lee* (UBC) Laks V.S. Lakshmanan (UBC) Evangelos Milios (Dalhousie University) 摘要: Dynamic networks are commonly found in the current web age. In scenarios like social networks and social media,dynamic networks are noisy, are of large-scale and evolve quickly.In this paper, we focus on the cluster evolution tracking problemon highly dynamic networks, with clear application to eventevolution tracking. There are several previous works on datastream clustering using a node-by-node approach for maintainingclusters. However, handling of bulk updates, i.e., a subgraphat a time, is critical for achieving acceptable performance oververy large highly dynamic networks. We propose a subgraph-by subgraph incremental tracking framework for cluster evolutionin this paper. To effectively illustrate the techniques in ourframework, we take the event evolution tracking task in socialstreams as an application, where a social stream and an eventare modeled as a dynamic post network and a dynamic clusterrespectively. By monitoring through a fading time window, weintroduce a skeletal graph to summarize the information in thedynamic network, and formalize cluster evolution patterns usinga group of primitive evolution operations and their algebra. Twoincremental computation algorithms are developed to maintainclusters and track evolution patterns as time rolls on and thenetwork evolves. Our detailed experimental evaluation on largeTwitter datasets demonstrates that our framework can effectivelytrack the complete set of cluster evolution patterns in the wholelife cycle from highly dynamic networks on the fly. 大意:动态网络(如社交网络)在网络时代非常常见。本文主要解决的是在动态网络上cluster演化的跟踪问题(事件的演化跟踪)。在本文之前的跟踪方法(节点的更新)涉及到很多的更新操作。本文提出了一个基于子图的增量追踪框架。通过对社交流(skeletal graph)和事件的单独建模来解决此问题。 Finding Common Ground among Experts’ Opinions on Data Clustering: with Applications i

文档评论(0)

haihang2017 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档