首页> 外文学位 >Models and algorithms for event-driven networks.
【24h】

Models and algorithms for event-driven networks.

机译:事件驱动网络的模型和算法。

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

摘要

Many real-world systems can be represented as networks driven by discrete events, each event identified by the time at which it occurs and the parties involved. An event could be a meeting, a stock trade, a phone call, an email, a gang fight, an online or off-line purchase, a blog post, a conference, or the transmission of an IP packet. Innovations in technology have increased our ability to collect massive amounts of digital data from such networks, which presents both new opportunities and new challenges. In this work, we develop new theoretical models and efficient algorithms that leverage the temporal and relational information inherent in the data to better understand and analyze real-world networks. In particular, we consider three problems: (1) detecting correlated events in communication networks; (2) discovering functional communities; and (3) modeling collaboration in academia.;First we present a new stochastic model for event-driven networks, and with it develop two algorithms -- a streaming local algorithm, and an efficient global algorithm -- to detect statistically correlated activity. We demonstrate that our approach, which models each communication channel as its own stochastic process, is better able to accommodate the temporal variability present in real-world communication networks than existing methods.;Next we study diffusion processes in information networks, identifying functional communities as groups of individuals who participate in the dissemination of common content by reframing the problem as one of co-clustering sparse matrices. We propose a new co-clustering algorithm that does not require user-specified parameters, and leverages sparsity in the data to run in sublinear time in the size of the matrix.;Finally, we build a game-theoretic model for academic collaboration, representing the academic environment as a repeated game in which each researcher tries to maximize his or her academic success. We find analytically that limitations of existing collaboration models may result in misleading predictions about people's behavior.
机译:许多现实世界的系统可以表示为由离散事件驱动的网络,每个事件都由事件发生的时间和所涉及的各方来标识。事件可以是会议,股票交易,电话,电子邮件,帮派斗争,在线或离线购买,博客文章,会议或IP数据包的传输。技术创新提高了我们从此类网络收集大量数字数据的能力,这既带来了新的机遇,也带来了新的挑战。在这项工作中,我们开发了新的理论模型和有效的算法,它们利用数据中固有的时间和关系信息来更好地理解和分析现实世界的网络。特别地,我们考虑三个问题:(1)检测通信网络中的相关事件; (2)发现功能社区; (3)在学术界中为协作建模。首先,我们为事件驱动的网络提供了一种新的随机模型,并据此开发了两种算法-流式本地算法和高效的全局算法-以检测统计上相关的活动。我们证明了我们的方法(将每个通信渠道建模为自己的随机过程)比现有方法能够更好地适应现实世界通信网络中存在的时间变异性;接下来,我们研究信息网络中的扩散过程,将功能性社区识别为通过将问题重新定义为共同聚类的稀疏矩阵之一来参与分发公共内容的个人群体。我们提出了一种新的共聚算法,该算法不需要用户指定的参数,并利用数据的稀疏性在矩阵大小的亚线性时间内运行;最后,我们建立了一个用于学术合作的博弈模型,表示作为重复性游戏的学术环境,每个研究人员都试图在其中最大化自己的学术成就。从分析上我们发现,现有协作模型的局限性可能导致对人们行为的误导性预测。

著录项

  • 作者

    Thompson, Brian Evan.;

  • 作者单位

    Rutgers The State University of New Jersey - New Brunswick.;

  • 授予单位 Rutgers The State University of New Jersey - New Brunswick.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2014
  • 页码 117 p.
  • 总页数 117
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号