排序方式: 共有51条查询结果,搜索用时 15 毫秒
1.
查找与查询点相关的top-K相关社区具有现实的研究意义。文中定义团和相关社区的概念,探寻一种快速检测查询点的top-K相关社区的方法。提出一个向下探测扩展算法,从查询点出发探测团结构,由团结构向外延伸扩展得到社区,通过循环迭代快速得到查询点的top-K相关社区。同时为减少搜索空间和计算时间,改进提出的向下探测搜索算法。通过全面的实验对比,验证算法的有效性和改进算法的高效性。 相似文献
2.
D. Zuckerman 《Algorithmica》1996,16(4-5):367-391
We show how to simulate BPP and approximation algorithms in polynomial time using the output from a -source. A -source is a weak random source that is asked only once forR bits, and must output anR-bit string according to some distribution that places probability no more than 2–R
on any particular string. We also give an application to the unapproximability of MAX CLIQUE.This paper appeared in preliminary form in theProceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 79–89. Most of this research was done while the author was at U.C. Berkeley, and supported by an AT&T Graduate Fellowship, NSF PYI Grant No. CCR-8896202, and NSF Grant No. IRI-8902813. Part of this research was done while the author was at MIT, supported by an NSF Postdoctoral Fellowship, NSF Grant No. 92-12184 CCR, and DARPA Grant No. N00014-92-J-1799. Part of this research was done at UT Austin, where the author was supported by NSF NYI Grant No. CCR-9457799. 相似文献
3.
4.
Many kinds of information are hidden in email data, such as the information being exchanged, the time of exchange, and the user IDs participating in the exchange. Analyzing the email data can reveal valuable information about the social networks of a single user or multiple users, the topics being discussed, and so on. In this paper, we describe a novel approach for temporally analyzing the communication patterns embedded in email data based on time series segmentation. The approach computes egocentric communication patterns of a single user, as well as sociocentric communication patterns involving multiple users. Time series segmentation is used to uncover patterns that may span multiple time points and to study how these patterns change over time. To find egocentric patterns, the email communication of a user is represented as an item-set time series. An optimal segmentation of the item-set time series is constructed, from which patterns are extracted. To find sociocentric patterns, the email data is represented as an item-setgroup time series. Patterns involving multiple users are then extracted from an optimal segmentation of the item-setgroup time series. The proposed approach is applied to the Enron email data set, which produced very promising results. 相似文献
5.
徐志兴 《徐州工程学院学报》2005,20(4):101-107
探究李可染先生与徐州历史文化、徐州前彭城画派、徐州艺专及解放后徐州美术界的各种联系,阐述李可染先生在二十世纪徐州美术事业发展进程中所产生的巨大影响及其对徐州彭城画派的形成与发展所起到的重要作用。 相似文献
6.
7.
概率图模型推理方法的研究进展 总被引:1,自引:0,他引:1
近年来概率图模型已成为不确定性推理的研究热点,在人工智能、机器学习与计算机视觉等领域有广阔的应用前景.根据网络结构与查询问题类型的不同,系统地综述了概率图模型的推理算法.首先讨论了贝叶斯网络与马尔可夫网络中解决概率查询问题的精确推理算法与近似推理算法,其中主要介绍精确推理中的VE算法、递归约束算法和团树算法,以及近似推理中的变分近似推理和抽样近似推理算法,并给出了解决MAP查询问题的常用推理算法;然后分别针对混合网络的连续与混合情况阐述其推理算法,并分析了暂态网络的精确推理、近似推理以及混合情况下的推理;最后指出了概率图模型推理方法未来的研究方向. 相似文献
8.
9.
研究在已知目标团伙中某节点以及目标团伙特征的前提下,基于通讯痕迹特征寻找社会网络团伙。研究过程中引入了社会圈、节点中心度和事件集合关联矩阵等概念,重点将聚类分析方法与社会团伙发现相结合,以期得到一种基于通讯痕迹的社会网络团伙分析模型。 相似文献
10.
An Ad Hoc network consists of mobile hosts that can dynamically construct a wireless network without base stations. Due to the limited communication range, a source host usually needs other hosts to relay messages to the destination in a multi-hop manner. Consequently, establishing a routing path from the source to the destination is a basic requirement for providing communication service between any pair of mobile hosts. This study proposes a two-level management approach for efficiently constructing and maintaining a QoS routing path in Ad Hoc wireless networks, significantly reducing the quantity of control packets. In the first phase, the mobile hosts are partitioned into a number of complete graphs, each represented by a Supernode managed by an agent. The Ad Hoc network topology is thus transformed to an Agent-based Graph (AG). In the second phase, some agents of a larger degree than neighboring agents are selected as core nodes. The core nodes then virtually construct a Core Graph (CG). The proposed two-level hierarchical management and bandwidth-looking-ahead technologies can efficiently establish and maintain a QoS communication path at a low control packet cost. Simulation results indicate that the proposed management model significantly reduces the number of control packets in areas with very large numbers of mobile hosts. 相似文献