针对分布式k团社区检测引起的超大社区问题,提出了具有节点退出机制的τ-window社区检测方法,相应提出了τ-、window中心性估计。通过实验发现τ-window社区和τ-window中心性具有周期演化特性,利用该特性,提出TTL(time to live)社区检...
详细信息
针对分布式k团社区检测引起的超大社区问题,提出了具有节点退出机制的τ-window社区检测方法,相应提出了τ-、window中心性估计。通过实验发现τ-window社区和τ-window中心性具有周期演化特性,利用该特性,提出TTL(time to live)社区检测和TTL中心性估计,以更准确预测消息生存期上节点的相遇。随后,利用TTL社区和TTL中心性作为转发测度,设计了新的机会移动网络路由算法PerEvo。实验结果表明,与现有的基于社会特征的路由算法比较,PerEvo在保持基本不变的传输开销的同时,有效提高了机会移动网络消息投递的成功率。
为实现命名数据网络(NDN,name data networking)域间内容互访,提出了一种NDN域间多路径路由机制——MIRNDN。该机制使任意自治系统(AS,autonomous system)仅维护自身及客户AS可达内容的路由信息并聚合路由信息以缓解域间路由的可扩展性...
详细信息
为实现命名数据网络(NDN,name data networking)域间内容互访,提出了一种NDN域间多路径路由机制——MIRNDN。该机制使任意自治系统(AS,autonomous system)仅维护自身及客户AS可达内容的路由信息并聚合路由信息以缓解域间路由的可扩展性问题;采用"无谷底"路由策略引导请求非自身和客户AS内容的Interest报文从多路径探索内容,且请求聚合、网络缓存和自适应转发能优化探索;维护多路径路由信息以支持Interest多路径转发。从理论上分析了MIRNDN机制下FIB大小、路由更新的收敛时间和通信开销,在实际因特网AS级别拓扑上的仿真实验表明MIRNDN缓解了域间路由的可扩展性问题,路由更新的收敛时间较短,通信开销适量,并有效地减少了Interest报文的不必要转发。
To improve the similarity measurement between users, a similarity measurement approach incorporating clusters of intrinsic user groups（ SMCUG） is proposed considering the social information of users. The approach co...
详细信息
To improve the similarity measurement between users, a similarity measurement approach incorporating clusters of intrinsic user groups（ SMCUG） is proposed considering the social information of users. The approach constructs the taxonomy trees for each categorical attribute of users. Based on the taxonomy trees, the distance between numerical and categorical attributes is computed in a unified framework via a proper weight. Then, using the proposed distance method, the nave k-means cluster method is modified to compute the intrinsic user groups. Finally, the user group information is incorporated to improve the performance of traditional similarity measurement. A series of experiments are performed on a real world dataset, M ovie Lens. Results demonstrate that the proposed approach considerably outperforms the traditional approaches in the prediction accuracy in collaborative filtering.
暂无评论