在线社交网络(online social network,OSN)已经被用于增强服务提供和服务选择。然而,一个关键并且充满挑战的问题便是,如何根据服务消费者的需求有效并且高效地找到那些具有可信任评估结果的社交信任路径,尤其是在包含复杂社会关系的在...在线社交网络(online social network,OSN)已经被用于增强服务提供和服务选择。然而,一个关键并且充满挑战的问题便是,如何根据服务消费者的需求有效并且高效地找到那些具有可信任评估结果的社交信任路径,尤其是在包含复杂社会关系的在线社交网络中。首先提出一个包含社交影响因子的社交网络结构。然后提出了一种NP完全的多约束社交信任路径查询问题。为了解决这个极具挑战的问题,提出了一个名为"强社交图"(strong social graph,SSG)的新概念。接着提出了一种基于SSG的新的索引方法。基于SSG索引,通过运用蒙特卡罗方法和相关优化搜索策略提出了一个名为"基于强社交图和蒙特卡罗算法"(strong social graph-Monte Carlo based algorithm,SSG-MCBA)的高效近似算法。两个真实数据集上的实验结果表明SSG-MCBA在准确率和效率上都极大地优于先前的算法。展开更多
Because of the anonymity and openness of E-commerce, the on-line transaction and the selection of network resources meet new challenges. For this reason, a trust domain-based multi-agent model for network resource sel...Because of the anonymity and openness of E-commerce, the on-line transaction and the selection of network resources meet new challenges. For this reason, a trust domain-based multi-agent model for network resource selection is presented. The model divides the network into numbers of trust domains and prevents the inconsistency of information maintained by different agents through the periodical communication among the agents. The model enables consumers to receive the response from the agents much quicker because the trust values of participators are evalUated and updated dynamically and timely after the completion of each transaction. In order to make users choose the best matching services and give users with trusted services, the model takes into account the similarity between services and the service providers＇ recognition to the services. Finally, the model illustrates the effectiveness and feasibility according to the experiment.展开更多
文摘在线社交网络(online social network,OSN)已经被用于增强服务提供和服务选择。然而,一个关键并且充满挑战的问题便是,如何根据服务消费者的需求有效并且高效地找到那些具有可信任评估结果的社交信任路径,尤其是在包含复杂社会关系的在线社交网络中。首先提出一个包含社交影响因子的社交网络结构。然后提出了一种NP完全的多约束社交信任路径查询问题。为了解决这个极具挑战的问题,提出了一个名为"强社交图"(strong social graph,SSG)的新概念。接着提出了一种基于SSG的新的索引方法。基于SSG索引,通过运用蒙特卡罗方法和相关优化搜索策略提出了一个名为"基于强社交图和蒙特卡罗算法"(strong social graph-Monte Carlo based algorithm,SSG-MCBA)的高效近似算法。两个真实数据集上的实验结果表明SSG-MCBA在准确率和效率上都极大地优于先前的算法。
基金Supported by the National Natural Science Foundation of China （No. 60873203 ）, the Natural Science Foundation of Hebei Province （No F2008000646） and the Guidance Program of the Department of Science and Technology in Hebei Province （No. 72135192）.
文摘Because of the anonymity and openness of E-commerce, the on-line transaction and the selection of network resources meet new challenges. For this reason, a trust domain-based multi-agent model for network resource selection is presented. The model divides the network into numbers of trust domains and prevents the inconsistency of information maintained by different agents through the periodical communication among the agents. The model enables consumers to receive the response from the agents much quicker because the trust values of participators are evalUated and updated dynamically and timely after the completion of each transaction. In order to make users choose the best matching services and give users with trusted services, the model takes into account the similarity between services and the service providers＇ recognition to the services. Finally, the model illustrates the effectiveness and feasibility according to the experiment.
