基于网络社团分析的协作推荐方法研究
|
摘要
随着各种网络的快速发展,不断增长的信息远远超出人们的处理能力。人们常常会感觉到自己淹没在大量的信息中而无法有效地找到所需要的信息,“信息过载”问题日趋严重。为了给人们提供满意的信息和服务,推荐技术应运而生,成为目前众多学者和网络用户关心的核心技术。
各种网络社区和社会网络服务的发展使得推荐技术已经不能以用户和各种资源对象的简单关系来描述,用户对资源的需求也不能单一地以个性化推荐来解释,而应该考虑用户个性和共性的辩证统一。本文提出利用网络协作来构建整个推荐体系,使人与外部世界更好地在网络协作的基础上进行信息交互。针对协作推荐中的关键问题(稀疏性,冷启动、可扩展性、兴趣变化、认知反馈等),本文基于网络社团分析对网络协作化的推荐方法进行了以下方面的研究：
1从用户与资源对象的网络关系出发,构建了推荐系统的网络体系构架。该推荐网络体系由用户-资源对象二分网络、资源对象关联网络和用户网络构成,分为三个层次：(1)用户-资源对象网络：用户和资源对象构成的关系网络。(2)资源对象关联网络：资源对象之间构成的关系网络。(3)用户社会网络：外部用户的社会网络。通过该三层网络体系可以更好地刻画整个推荐系统。目前常见的多种推荐方法成为该体系的一种特例,另外该体系纳入了社会网络,使推荐更接近当前互联网络发展的现实情况。更重要的是,网络社团构成体系的特殊单位,成为研究和分析推荐问题的理论与现实基础之一。
2.对推荐系统的网络社团进行了分析,讨论了基于网络社团分析的协作推荐研究的理论和现实的意义,并提出了基于代表性能量的网络社团发现方法。网络社团的现实性与网络世界的网络社团效应的统一,使得分析网络社团可以将推荐问题的精度、效率和社会化统一起来。本文在对网络社团发现的基础上,对利用“模块度”进行社团划分的局限性进行了一定的论述,提出了基于代表能量竞争的网络社团发现方法。该方法不需要模块度的优化,而是利用网络节点之间不同的亲疏关系使得社团的代表在竞争中出现,不但可以得到社团的划分个数而且可直接获得每个社团内的结构概貌。由于网络社团内的成员的连接边数比社团间的连接边数多,社团内成员获得本社团成员的代表能量较高。社团代表通过代表竞争过程获得,代表的个数即为社团的个数。当社团的亲疏关系反映整个网络的社团化不明显时,竞争胜出的代表也会减少。所以,与目前基于网络分割的社团发现方法相比,本文提出的代表能量竞争的方法更符合社会、自然的团落发展的规律。
3.提出了基于网络社团发现的协作过滤推荐方法。该方法将网络社团划分与团内协作推荐结合起来,使得推荐在团内依据近邻用户的偏好相似进行一致性逼近。首先利用代表能量竞争的社团发现方法对用户-资源对象的共同评价关系网络进行初步的社团发现,接着对团内评价进行均一化处理,利用偏好相似进行协作推荐。另外按照最近邻用户和最近邻项目来发现离目标预测链接的最近邻网络社团,将该社团映射到最近邻矩阵上。利用基于项目的协作过滤算法对矩阵中的空数据域进行预测填补。鉴于不同项目对目标预测的贡献不同,利用项目相关性在用户邻居候选集中对目标用户的邻居进行精选,实现了对目标评价的超线性预测。
4.提出了基于时间加权的网络推荐方法。该方法利用用户-资源对象的选择(评价)时间对动态资源分配网络的边进行加权,对推荐系统进行动态网络模拟。详细分析了推荐系统中用户对资源对象的兴趣随时间衰减的影响,利用时间衰减因子对带有时间加权的二分资源动态网络进行兴趣衰减分析,最近用户的选择行为对资源对象间的推荐能量的流动权将获得较高的贡献度,充分体现用户兴趣的时间效应特性。而在处理用户在资源对象间的兴趣转移时候,利用时间延迟因子模拟资源之间在单个用户流动的通畅性,时间延迟因子小的资源对象间获得较高的流动权。在对推荐能量进一步分析的基础上,发现资源网络的推荐过程中有一定的冗余能量转移,通过转移节点的网络社团交叠程度来消减推荐过程中冗余能量的转移。基于时间加权的资源分配网络使推荐系统具有网络化的时间动态推荐预测能力。
5.提出了基于网络云团的人机协作聚合推荐方法,构建了贝叶斯反馈云模型。本文在云计算分析的基础上,提出了基于网络云团的协作聚合推荐方法。在网络云团内的人与系统反馈认知中将人类认知的先验性和云模型的特点结合起来,构建了贝叶斯反馈云模型。对不确定性推荐反馈概念的定量和定性测度在人机之间相互转化进行了分析,对云滴校验进行了详细的设计,给出了贝叶斯反馈云的统计描述。利用该模型得到云团内的推荐偏好云,基于协作实体进行云团聚合协作推荐。在项目云团基础上,对推荐中的新用户冷启动问题进行了应用分析。
With the development of networks, the amount of information increases beyond our ability to process it. The clients may feel that they are submerging in the information sea and difficult to find what they need. The information overload is getting worse and worse. Recommendation technology attracts more attentions of scholars and internet users in that it is expected to help clients efficiently find what they need online.
The development of recent social network services (SNS) and network communities hinders recommendation technology to work well under simple relationships between various resource objects and users. The user's requirement for resources cannot be simply fulfilled by personal recommendation. Better recommendation can be regarded as a dialectic integration of users'personalities and their overall characters. This paper builds the entire recommendation system with network collaboration, which will affect the information exchange between people and others. As for many problems in collaborative recommendation: sparseness, cold start, scalability, interest change, cognitive feedback and other issues, this article presents some methods to solve those problems based on the theory of network community. The research works are listed as follows:
1. The network architecture of recommendation system on expanding user-object network is presented. The recommendation network system is divided into three layers:user-resource object bipartite network, resource object network and user social network. (1) User-resource object network:users and resource objects constitute the network of relationships. (2) Resource object network:resource object network can be established with the relationships of resource objects. (3) User social network:the online relationships among different users.The three-tier network better describes the recommendation system because some recommendation methods can be looked as special cases of the system. Significantly, the network community constitutes special unit of recommendation system, being regarded as theoretical and practical base for solving many recommendation problems.
2. The network communities of recommendation system are analyzed and theoretical and practical significance of network community-based collaborative recommendation are discussed in detail. A new network community detecting algorithm based on representative energy is presented. The integration of reality and the theory of network community i.e. socialization of recommendation system makes the study of issues be more accurate and efficient. In this paper, the limited resolution of network community discovery based on the use of "modularity" is described in detail. A new network community discovery method based on competing representative energy is proposed. This method does not require modularity optimization; rather it depends on the behavior of competing for community representatives. The method can divides network into those communities, it can also draw the skeleton of each community directly. Since the network connections within community are denser than those between communities, the members can obtain higher representative energy from those nodes in same community than from nodes in other communities. Community representatives emerge through competitive process naturally, and the number of representatives is the number of communities. When community affinities of entire network community are not obvious, the number of representatives who win out in the competition will decrease. Therefore, compared with other methods of network division, this method based on energy competition can show the natural law of evolving groups.
3.In this work, a network community-based collaborative filtering recommendation method is proposed. The method is the combination of two tasks i.e. division of the network and collaboration recommendation within community, which consistently predicts the preference of user depending on his nearest neighbors. First of all, representative energy analysis is employed to discover the community in co-rating network. Then, the community ratings are normalized so that collaborative recommendation can implement with the similarity of preferences between users. The nearest user neighbors and the nearest object neighbors constitute the nearest community which is the nearest space to target prediction, and the community can be projected into the nearest neighbor matrix. Moreover, some empty data in the matrix can be filled with values which are predicted with object-based collaborative filtering algorithm. User's nearest neighbors are selected from candidates, which contributes to predict different objects. The nearest community-based collaborative filtering can approximate the target forecast in a super-linear way.
4. A time-weighted network recommendation method is presented. This method weighs the edge of resource allocation network with time and models the dynamic network of recommendation system, and analyses the influence of interest varied with time in user-object network, which describes the decay of interest through time attenuation. The latter selecting can make bigger contribution to the energy of recommendation. As the interest diversion is concerned, the paper presents diversion delay factor to model the recommendation flow among different resource objects. Redundant energy transition is discovered by analyzing recommendation energy; the paper tries to eliminate the redundant energy with overlapping degree of transfer node. The recommendation method based time-weighted network enable the recommendation system with structural dynamic prediction ability.
5. This paper proposes a method of human-machine collaborative aggregating recommendation based on network cloud community, and constructs a Bayesian feedback cloud model. Under the analysis of cloud computing, an aggregating recommendation method based on network cloud community is presented. A Bayesian feedback cloud model is constructed with the combination of human being's apriority and feature of cloud model. Based on analysis of transformation between quantitative and qualitative measurement of uncertain concepts, the paper designs cloud drop tester in detail, and presents statistical description of Bayesian feedback cloud. Preferences cloud can be obtained by using the model within the clouds community, and the prediction for recommendation can be aggregated on cloud community with preference. The method based on object cloud community has been applied in alleviating new user cold-start problem in recommendation.
各种网络社区和社会网络服务的发展使得推荐技术已经不能以用户和各种资源对象的简单关系来描述,用户对资源的需求也不能单一地以个性化推荐来解释,而应该考虑用户个性和共性的辩证统一。本文提出利用网络协作来构建整个推荐体系,使人与外部世界更好地在网络协作的基础上进行信息交互。针对协作推荐中的关键问题(稀疏性,冷启动、可扩展性、兴趣变化、认知反馈等),本文基于网络社团分析对网络协作化的推荐方法进行了以下方面的研究：
1从用户与资源对象的网络关系出发,构建了推荐系统的网络体系构架。该推荐网络体系由用户-资源对象二分网络、资源对象关联网络和用户网络构成,分为三个层次：(1)用户-资源对象网络：用户和资源对象构成的关系网络。(2)资源对象关联网络：资源对象之间构成的关系网络。(3)用户社会网络：外部用户的社会网络。通过该三层网络体系可以更好地刻画整个推荐系统。目前常见的多种推荐方法成为该体系的一种特例,另外该体系纳入了社会网络,使推荐更接近当前互联网络发展的现实情况。更重要的是,网络社团构成体系的特殊单位,成为研究和分析推荐问题的理论与现实基础之一。
2.对推荐系统的网络社团进行了分析,讨论了基于网络社团分析的协作推荐研究的理论和现实的意义,并提出了基于代表性能量的网络社团发现方法。网络社团的现实性与网络世界的网络社团效应的统一,使得分析网络社团可以将推荐问题的精度、效率和社会化统一起来。本文在对网络社团发现的基础上,对利用“模块度”进行社团划分的局限性进行了一定的论述,提出了基于代表能量竞争的网络社团发现方法。该方法不需要模块度的优化,而是利用网络节点之间不同的亲疏关系使得社团的代表在竞争中出现,不但可以得到社团的划分个数而且可直接获得每个社团内的结构概貌。由于网络社团内的成员的连接边数比社团间的连接边数多,社团内成员获得本社团成员的代表能量较高。社团代表通过代表竞争过程获得,代表的个数即为社团的个数。当社团的亲疏关系反映整个网络的社团化不明显时,竞争胜出的代表也会减少。所以,与目前基于网络分割的社团发现方法相比,本文提出的代表能量竞争的方法更符合社会、自然的团落发展的规律。
3.提出了基于网络社团发现的协作过滤推荐方法。该方法将网络社团划分与团内协作推荐结合起来,使得推荐在团内依据近邻用户的偏好相似进行一致性逼近。首先利用代表能量竞争的社团发现方法对用户-资源对象的共同评价关系网络进行初步的社团发现,接着对团内评价进行均一化处理,利用偏好相似进行协作推荐。另外按照最近邻用户和最近邻项目来发现离目标预测链接的最近邻网络社团,将该社团映射到最近邻矩阵上。利用基于项目的协作过滤算法对矩阵中的空数据域进行预测填补。鉴于不同项目对目标预测的贡献不同,利用项目相关性在用户邻居候选集中对目标用户的邻居进行精选,实现了对目标评价的超线性预测。
4.提出了基于时间加权的网络推荐方法。该方法利用用户-资源对象的选择(评价)时间对动态资源分配网络的边进行加权,对推荐系统进行动态网络模拟。详细分析了推荐系统中用户对资源对象的兴趣随时间衰减的影响,利用时间衰减因子对带有时间加权的二分资源动态网络进行兴趣衰减分析,最近用户的选择行为对资源对象间的推荐能量的流动权将获得较高的贡献度,充分体现用户兴趣的时间效应特性。而在处理用户在资源对象间的兴趣转移时候,利用时间延迟因子模拟资源之间在单个用户流动的通畅性,时间延迟因子小的资源对象间获得较高的流动权。在对推荐能量进一步分析的基础上,发现资源网络的推荐过程中有一定的冗余能量转移,通过转移节点的网络社团交叠程度来消减推荐过程中冗余能量的转移。基于时间加权的资源分配网络使推荐系统具有网络化的时间动态推荐预测能力。
5.提出了基于网络云团的人机协作聚合推荐方法,构建了贝叶斯反馈云模型。本文在云计算分析的基础上,提出了基于网络云团的协作聚合推荐方法。在网络云团内的人与系统反馈认知中将人类认知的先验性和云模型的特点结合起来,构建了贝叶斯反馈云模型。对不确定性推荐反馈概念的定量和定性测度在人机之间相互转化进行了分析,对云滴校验进行了详细的设计,给出了贝叶斯反馈云的统计描述。利用该模型得到云团内的推荐偏好云,基于协作实体进行云团聚合协作推荐。在项目云团基础上,对推荐中的新用户冷启动问题进行了应用分析。
With the development of networks, the amount of information increases beyond our ability to process it. The clients may feel that they are submerging in the information sea and difficult to find what they need. The information overload is getting worse and worse. Recommendation technology attracts more attentions of scholars and internet users in that it is expected to help clients efficiently find what they need online.
The development of recent social network services (SNS) and network communities hinders recommendation technology to work well under simple relationships between various resource objects and users. The user's requirement for resources cannot be simply fulfilled by personal recommendation. Better recommendation can be regarded as a dialectic integration of users'personalities and their overall characters. This paper builds the entire recommendation system with network collaboration, which will affect the information exchange between people and others. As for many problems in collaborative recommendation: sparseness, cold start, scalability, interest change, cognitive feedback and other issues, this article presents some methods to solve those problems based on the theory of network community. The research works are listed as follows:
1. The network architecture of recommendation system on expanding user-object network is presented. The recommendation network system is divided into three layers:user-resource object bipartite network, resource object network and user social network. (1) User-resource object network:users and resource objects constitute the network of relationships. (2) Resource object network:resource object network can be established with the relationships of resource objects. (3) User social network:the online relationships among different users.The three-tier network better describes the recommendation system because some recommendation methods can be looked as special cases of the system. Significantly, the network community constitutes special unit of recommendation system, being regarded as theoretical and practical base for solving many recommendation problems.
2. The network communities of recommendation system are analyzed and theoretical and practical significance of network community-based collaborative recommendation are discussed in detail. A new network community detecting algorithm based on representative energy is presented. The integration of reality and the theory of network community i.e. socialization of recommendation system makes the study of issues be more accurate and efficient. In this paper, the limited resolution of network community discovery based on the use of "modularity" is described in detail. A new network community discovery method based on competing representative energy is proposed. This method does not require modularity optimization; rather it depends on the behavior of competing for community representatives. The method can divides network into those communities, it can also draw the skeleton of each community directly. Since the network connections within community are denser than those between communities, the members can obtain higher representative energy from those nodes in same community than from nodes in other communities. Community representatives emerge through competitive process naturally, and the number of representatives is the number of communities. When community affinities of entire network community are not obvious, the number of representatives who win out in the competition will decrease. Therefore, compared with other methods of network division, this method based on energy competition can show the natural law of evolving groups.
3.In this work, a network community-based collaborative filtering recommendation method is proposed. The method is the combination of two tasks i.e. division of the network and collaboration recommendation within community, which consistently predicts the preference of user depending on his nearest neighbors. First of all, representative energy analysis is employed to discover the community in co-rating network. Then, the community ratings are normalized so that collaborative recommendation can implement with the similarity of preferences between users. The nearest user neighbors and the nearest object neighbors constitute the nearest community which is the nearest space to target prediction, and the community can be projected into the nearest neighbor matrix. Moreover, some empty data in the matrix can be filled with values which are predicted with object-based collaborative filtering algorithm. User's nearest neighbors are selected from candidates, which contributes to predict different objects. The nearest community-based collaborative filtering can approximate the target forecast in a super-linear way.
4. A time-weighted network recommendation method is presented. This method weighs the edge of resource allocation network with time and models the dynamic network of recommendation system, and analyses the influence of interest varied with time in user-object network, which describes the decay of interest through time attenuation. The latter selecting can make bigger contribution to the energy of recommendation. As the interest diversion is concerned, the paper presents diversion delay factor to model the recommendation flow among different resource objects. Redundant energy transition is discovered by analyzing recommendation energy; the paper tries to eliminate the redundant energy with overlapping degree of transfer node. The recommendation method based time-weighted network enable the recommendation system with structural dynamic prediction ability.
5. This paper proposes a method of human-machine collaborative aggregating recommendation based on network cloud community, and constructs a Bayesian feedback cloud model. Under the analysis of cloud computing, an aggregating recommendation method based on network cloud community is presented. A Bayesian feedback cloud model is constructed with the combination of human being's apriority and feature of cloud model. Based on analysis of transformation between quantitative and qualitative measurement of uncertain concepts, the paper designs cloud drop tester in detail, and presents statistical description of Bayesian feedback cloud. Preferences cloud can be obtained by using the model within the clouds community, and the prediction for recommendation can be aggregated on cloud community with preference. The method based on object cloud community has been applied in alleviating new user cold-start problem in recommendation.
引文
[1].许海玲,吴潇,李晓东,阎保平.互联网推荐系统比较研究[J].软件学报,2009.20(2)：350-262
[2].刘建国,周涛,汪秉宏.个性化推荐系统的研究进展[J].自然科学进展,2009 19(1)：1-15
[3]. Barabasi A L.The origin of bursts and heavy tails in human dynamics[J].Nature,2005, 435(7039):207-211
[4]. Lazer D, Pentland A, Adamic L,et al. Computational social science[J].science,2009,323:721-723
[5]. Resnick P, Varian H R. Recommender systems [J]. Communications of the ACM,1997,40(3):56-58.
[6]. Glodberg D,Nichols D,Oki B M,et al.Using collaborative filtering to weave an information Tapestry[J].Communication of the ACM.1992,Volume 35 (12):61-70
[7]. Resnick P,Iacovou N,Suchak M. et al.GroupLens:An open architecture for collaborative filtering of netnews[C].In proceedings of the conference on computer supported cooperative work,North Carolina:ACM,1994:175-186
[8]. Shardanand U, Maes P. Social information filtering:algorithms for automating "word of mouth"[C]. In proceedings of the 1995 ACM SIGCHI Conference on Human Factors in Computing Systems. Colorado:ACM Press,1995:210-217
[9]. Konstan J, Miller B,Maltz D.,et al.GRoupLens:Applying collaborative filtering to usenet News[J]. Communications of the ACM,1997,40(3):77-87
[10].Goldberg K, Roeder T, Gupta D, et al.EigenTaste:a constant time collaborative filtering algorithm [J]. Information retrieval,2001,4(2):133-151
[11].Breese J,Hecherman D,Kadie C.Empirical analysis of predictive algorithms for collaborative
filtering[C],In proceeding of the 14th conference on Uncertainty in Artificial intelligence, San Francisco:Morgan Kaufmann,1998:43-52
[12].Sarwar B,Karypis G, Konstan J,Riedl J. Item-based collaborative filtering recommendation algorithm[C].In proceedings of the 10th international World Wide Web Conference, New York:ACM Press,2001:285-295
[13].邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法[J].软件学报,2003,14(9)：1621-1628
[14].周军锋,汤显,郭景峰.一种优化的协同过滤推荐算法[J].计算机研究与发展,2004,41(10)：1842-1847
[15].陈华月,余刚,朱征宇.基于加权关联规则的用户关注项目推荐算法[J].计算机工程,2006,32(6)：86-88
[16].Papagelis M, Plexousakis D,Rousidis I, et al.Qualitative analysis of user-based and item-based prediction algorithm for recommendation agents[J].Engineering Application of artificial intelligence,2005,18(7),781-789
[17].Pennock D M,Horvitz E.Lawrence S,et al.Collaborative Filtering by Personality Diagnosis:A Hybrid Memory- and Model-Based Approach[C]. In proceeding of the 16th Conference on Uncertainty in Artificial Intelligence, UAI 2000, San Francisco Morgan Kaufmann,2000:473-480
[18]. Lee S, Yang J, Park S.Discovery of hidden similarity on collaborative Filtering to overcome sparsity problem[C].In Proceedings of discovery science:7th international conference, Discovery Science, 2004,3245:396-402
[19].Lee Ming-Yu, Huang Chiung-Wei, Lee Hahn-Ming. Associating expertized information to alleviate sparsity problem in personalization[C]. IEEE International Conference on E-Business Engineering, Shanghai,china,2006: 479-482
[20].张峰,常会友.使用BP神经网络缓解协同过滤推荐算法的稀疏性问题[J].计算机研究与发展.2006,43(4)：667-672
[21].董丽,邢春晓,王克宏.协作过滤稀疏性算法[J],清华大学学报,2009,49(10)：154-157
[22].Sarwar B. Karypis G., Konstan J, et al.Application of dimensionality reduction in recommendation systems:a case study[C]. In Proceeding of the webKDD workshop at the ACM SIGKKD.New York ACM,2006
[23].张光卫 ,李德毅,李鹏等.基于云模型的协同过滤推荐算法[J].软件学报,2007,18(10)：2403-2411
[24].陈志敏,沈洁,赵耀.基于相关均值的协同过滤推荐算法[J],计算机工程,2009,35(22)：53-55
[25].吴颜,沈洁,顾天竺等.协同过滤推荐系统中数据稀疏问题的解决[J].计算机应用研究.2007,24(6)：94-97
[26].陈健,印鉴.基于影响集的协作过滤推荐算法[J].软件学报,2007,18(7)：1685-1694
[27]. Bridge D, Kelleher J. Experiments in sparsity reduction:using clustering in collaborative recommenders[C].In proceediings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science. London:Springer-Verlag,2002:144-149
[28].李涛,王建东,叶飞跃等.一种基于用户聚类的协同过滤推荐算法[J].系统工程与电子技术,2007,29(7)：1178-1182
[29].李涛,王建东.基于多层相似性用户聚类的推荐算法[J].南京航空航天大学学报,2006,38(6)：718-721
[30].邓爱林,左子叶,朱扬勇.基于项目聚类的协同过滤推荐算法[J].小型微型计算机系统,2004,25(9)：1665-1670
[31].陈冬林,聂规划.基于商品属性隐性评分的协同过滤算法研究[J].计算机应用,2006,26(4)：966-968
[32].Oyanagi S, Kubota K, Nakase A. Application of matrix clustering to web log analysis and access prediction[C], In proceeding of the third International Workshop on WEBKDD, San Francisco,2001：13-21
[33].余力,刘鲁,罗掌华.我国电子商务推荐策略的比较分析[J].系统工程理论与实践,2004,24(8)：96-101
[34].黎星星,黄小琴,朱庆生.电子商务推荐系统研究[J].计算机工程与科学,2004,26(5)：7-10
[35].孙小华.协同过滤系统的稀疏性与冷启动问题研究[D].杭州：浙江大学,2005
[36].Schein A I, Popescul A, Ungar L H. Methods and metrics for cold-start recommendations[C]. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, Tampere, Finland,2002:253-260
[37].张海燕,丁峰,姜丽红.基于模糊聚类的协同过滤推荐方法[J].计算机仿真,2005,.22(8)：144-147
[38].Park S T, Pennock D, Madani O, et al. Naive filterbots for robust cold-start recommendations[C]. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM Press,2006:699-705
[39]. Ahn H J.A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem [J]. Information Sciences:an International Journal,2008,178(1):37-51
[40].Schein A I, Popescul A, Ungar L H, et al. Methods and metrics for cold-start recommendations[C]. In Proceedings of the 25th Annual international ACM SIGIR Conference on Research and Development in information Retrieval,2002.Tampere, Finland:253-260
[41].Lam C. SNACK:Incorporating Social Network Information in Automated Collaborative Filtering[C], Proceedings of the ACM Conference o n Electronic Commerce,2004:254-255
[42].Aggarwal C C,Wolf J L,Wu K,et al.Horting hatches an egg:A new graph-theoretic approach to collaborative filtering[C], In proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining,1999:201-212
[43].Fouss F,Pirotte A,Saerens M. A novel way of computing similarities between nodes of a graph with application to collaboration recommendation[C].In proceedings of the 2005 IEEE/MIC/ACM international conference on web intelligence,2005:550-556
[44].Huang Z, Chung W Y, Chen H. A graph model for E-commerce recommender systems [J]. Journal of the American society for information science and technology,2004,55(3):259-274
[45].余力,刘鲁,李雪峰.用户多兴趣下的个性化推荐算法研究[J].计算机集成制造系统,2004,10(12)：1610-1615
[46].Yu L,Liu L, Li X F. A hybrid collaborative filtering method for multiple-internets and multiple-content recommendation in E-Commerce [J]. Expert system with applications,2005,28(1): 67-77
[47].潘红艳,林鸿飞,赵晶.基于矩阵划分和兴趣方差的协同过滤算法[J],情报学报,2006,25(1)：50-54
[48].桑艳艳,刘培刚,李勇.拟合用户兴趣演变特性的协作过滤推荐算法[J],情报学报,2009,28(1)：109-113
[49].郑先荣,曹先彬.线性逐步遗忘协同过滤算法的研究[J].计算机工程,2007,33(6)：72-82
[50].Massa P, Avesani P. Trust-aware recommender systems [C].In proceedings of the 2007 ACM conference on Recommender systems, Minneapolis,2007,17-24
[51].Mobasher B, Burke R, Bhaumik R, et al. Attacks and remedies in collaborative recommendation [J]. IEEE intelligent systems,2007,22 (3):56-63
[52].Burke R, Mobasher B, Williams C, et al.Classification features for attack detection in collaborative recommender systems[C]. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, Philadelphia:ACM,2006:542-547
[53].Chirita P A,Nejdl W,Zamfir C.Preventing shilling attacks in online recommender systems[C].In proceedings of the 7th annual ACM international workshop on Web information and data management,New York:ACM Press,2005:67-74.
[54].孙雨,张霞,丛枫等.基于p2p网络的协同过滤推荐算法的研究与实现[J].小型微型计算机系统,2006,27(3)：417-421
[55].吴吉义,林志洁,龚祥国.基于协同过滤的移动电子商务个性化推荐系统若干研究[J].电子技术应用,2007,32(1)：5-8
[56].Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems:a survey of the state-of-the-art and possible extensions [J]. IEEE Transactions on Knowledge and Data Engineering, 2005,17(6):734-749
[57]. Song X, Tseng B L, Lin C Y, et al. Personalized Recommendation Driven by Information Flow [C], International ACM SIGIR Conference on Research & Development on Information Retrieval, Seattle, August 6-11,2006
[58]. Song X,Lin C Y,Tseng B L,et al. Modeling Evolutionary and Relational Behaviors for Community-based Dynamic Recommendation[C],In Proceeding of the SIAM International Conference on Data Mining,2006:558-562
[59]. Song X, Lin C Y., Tseng B. L.et al.Modeling and Predicting Personal Information Dissemination Behavior[C], In Proceeding of the ACM SIGKDD,2005:479-488
[60]. Song X., Chi Y., Hino K. et al. Information flow modeling based on diffusion rate for prediction and ranking[C]. In Proceeding of the 16th international Conference on World Wide Web,Alberta, Canada,2007:191-200
[61]. Flake G W, Giles C L, Giles C L.Self-organization and identification of web communities [J]. IEEE Computer,2002,35(9):66-71
[62].刘军.社会网络分析导论[M].北京：社会科学出版社,2004：12-30
[63].Fu F,Liu L H, Wang L.Empirical analysis of online social networks in the age of Web 2.0[J].Physica A:Statistical Mechanics and its Applications,2008,387(2):675-684
[64].Ganley D, Lampe C.The ties that bind:Social network principles in online communities[J], Decision Support Systems,2009,47(3):266-274
[65].Kautz H,Selman, Shah M. Referral Web:combining social networks and collaborative filtering.Communications of the ACM,1997,40(3):63-65
[66].Adamic A L. Friends and neighbors on the web [J]. Social Networks,2003,25(03):211-130
[67].Fu F,Liu L H,Yang K,et al. Structure of Self-Organized Blogosphere[EB/OL], http://arxiv.org/math/0607361,2007-6-16
[68].唐常杰,刘威,温粉莲等.社会网络分析和社团信息挖掘的三项探索[J].计算机应用,2006,26(9)：2021-2023
[69].Liu L H, Fu F,Wang L.Information propagation and collective consensus in blogosphere:a game-theoretical approach [EB/OL].http://arxiv.org/abs/physics/0701316,2007-6-15
[70].Lerman K.Social networks and social information filtering on digg [EB/OL]. http://arxiv.org/abs/cs.HC/0612046,2007-6-23
[71]. Watts D J and Strogatz S H. Collective dynamics of'small world'networks [J].Nature.1998, 393(6684):440-442
[72].Barabasi A L, Albert R. Emergence of scaling in random network[J].Science,1999,286(5439):509-512
[73].Pollner P, Palla G, Vicsek T.Preferential attachment of communities:The same principle, but a higher level [J], Europhys. Lett,2006,73 (3):478
[74].Guimera R, Amaral L A N.Functional cartography of complex metabolic networks[J].Nature, 2005,433(7028):895-900
[75].解(?),汪小帆.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学,2005,2(3)：1-12
[76]. Wu F,Huberman B A.Finding communities in linear time:a physics approach[J].Eur Phys JB,2004,38 (2):331-338
[77].Newman M E J. Analysis of weighted networks[J],Phyiscal review E,70(52):056131-1—056131-9
[78].Newman M E J, Girvan M. Finding and evaluating community.structure in networks [J]. Physical Review E,2004,69(22):026113-1-026113-15
[79]. Newman M E J.Fast algorithm for detecting community structure in networks[J],Phys Rev E, 2004,69(62):066133
[80].Newman M E J. Finding community structure in networks using the eigenvectors of matrices [J].Physical Review E,2006,74(3),036104
[81].Rosvall M, Bergstrom C. T. An information-theoretic framework for resolving community structure in complex networks [J]. PNAS,2007,104:7327-7331
[82].Kumpula J M,Saramaki J, Kaski K, et al.Limited resolution and multi-resolution methods in complex network community detection[J].Fluctuation and noise letters,2007,7(3):209-214
[83].Fortunato S, Barthelemy M. Resolution limit in community detection [J]. PNAS,2007,104(1):36-41
[84].刘婷,胡宝清.基于聚类分析的复杂网络中的社团探测[J].复杂系统与复杂科学,2007,4(1)：28-35
[85]. Estrada E, Hatano N. Communicability graph and community structures in complex networks[J].Applied Mathematics and Computation,2009,214(2):500-511
[86].Ma X K, Gao L, Yong X R,et al.Semi-supervised clustering algorithm for community structure detection in complex networks[J].Physica A:Statistical Mechanics and its Applications, 2010,389(1):187-197
[87].Reddy P K, Kitsuregawa M, Sreekanth P, Rao S S. A graph based approach to extract a neighborhood customer community for collaborative filtering [C]. In proceeding of the 2nd International Workshop on Databases in Networked Information Systems, Aizu Japan,2002:188-200.
[88].Guimera R., Sales-Pardo M., Amaral L A N.Module identification in bipartite networks with applications to directed networks [J]. Physical Review E,2007,76 (3):036102
[89]. Palla G, Derenyi I, Farkas I, et al. Uncovering the overlapping community structure of complex networks in nature and society [J]. Nature.2005,435(7043):814-818
[90]. Palla G, Barabasi A L, Vicsek T. Quantifying social group evolution [J]. Nature,2007,446(7136): 664-667
[91].Takemoto K,Oosawa C,Akutsu T.Structure of n-clique networks embedded in a complex network[J].Physica A:Statistical Mechanics and its Applications,2007,380(1):665-672
[92].Zhang S H, Wang R S, Zhang X S.Identification of overlapping community structure in complex networks using fuzzy c-means clustering [J]. Physica A:Statistical Mechanics and its Applications, 2007,374(1):483-490
[93].Wang X H,Jiao L C,Wu J S.Adjusting from disjoint to overlapping community detection of complex networks[J].Physica A:Statistical Mechanics and its Applications,2009, 388(24):5045-5056
[94].Ghoshal G, Holme P.Attractiveness and activity in Internet communities[J],Physica A:Statistical Mechanics and its Applications,2006,364:603-609
[95].Golder S A, Huberman B A. Usage patterns of collaborative tagging systems[J]. Journal of Information Science.2006,32 (2):198-208
[96].Lo S C, Lin C C. WMR:A Graph-Based Algorithm for Friend Recommendation[C].In proceeding of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence,2006, Hong Kong China:121-128
[97].Golder S A, Huberman B A. Usage patterns of collaborative tagging systems [J]. Journal of Information Science,2006,32(2):198-208
[98].Halpin H,Robu V, Shepherd H.The complex dynamics of collaborative tagging[C].In proceedings of the 16th international conference on World Wide Web,2007:211-220
[99].Shalizi C R, Camperi M F, Klinkner K L.Discovering Functional Communities in Dynamical Networks [J]. Lecture Notes in Computer Science,2007,4503
[100]. Newman M E J, Leicht E A.Mixture models and exploratory analysis in networks[C], In Proceedings of the national academy of sciences of the ed states of America,2007,104 (23):9564-9569
[101].宋江春,沈钧毅.一种新的WEB用户群体和URL聚类算法的研究[J].控制与决策,2007,22(3)：284-288
[102]. Clauset A, Moore C, Newman M E J. Structural inference of hierarchies in networks [J]. Lecture Notes in Computer Science,4503:1-13
[103]. Golbeck J. Trust and nuanced profile similarity in online social networks [J]. ACM transactions on the web,2009,3(4):1-33
[104]. McNee S M.,Riedl J., Konstan J A. Being Accurate is not enough:How accuracy metrics have hurt recommender systems[C].In proceeding of Conference on human factors in computing systems,2006, Canada:1097-1101
[105]. Wang J, Vries A P, Reinders M J T. Unified relevance models for rating prediction in collaborative filtering [J]. ACM transactions on information systems.2008,26(3):1-42
[106]. Fouss F, Pirotte A, Saerens M. A novel way of computing similarities between nodes of a graph with application to collaboration recommendation[C], In proceedings of The 2005 IEEE/MIC/ACM international conference on web intelligence,2005:550-556
[107]. Gonzalez M C, Hidalgo C A, Barabasi A L.Understanding individual human mobility patterns [J]. Nature.2008,453(7196):779-782.
[108]. Barabasi A L.The architecture of complexity-From network to structure to human dynamics[J], IEEE control system magazine,2007,27:33-42
[109]. Grabowski A. Interpersonal interactions and human dynamics in a large social network[J], Physica A,2007,385(1):363-369
[110]. Grabowski A. Opinion formation in a social network:The role of human activity [J]. Physica A, 2009,388(6):961-966
[111]. Medo M. Distance-dependent connectivity:Yet another approach to the small-world phenomenon[J], Physica A,2006,359(1):617-628
[112]. Medo M, Zhang Y C. Market model with heterogeneous buyers[J],Physica A.2008, 387(12):2889-2908
[113]. Holme P. Scale-free networks with a large-to hypersmall-world transition[J], Physica A,2007, 377(1):315-322
[114]. Mitchell T M. Mining Our Reality[J],Science,2009,326(5960):1644-1645
[115]. Vespignani A. Predicting the Behavior of Techno-Social Systems [J], Science,2009,325(5939): 425-428
[116]. Holme P. Network dynamics of ongoing social relationships[J],Europhys Letters,2003,64(3): 427-433
[117]. Leskovec J, Backstrom L, Kumar R, Tomkins A. Microscopic evolution of social networks[C], In proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining,2008,462-470
[118]. Arenas, A., Fernandez, A., Gomez, S. Multiple resolution of the modular structure of complex networks [J]. New Journal of physics,2007,10(5):053039
[119]. Reichardt J,Bornholdt S.Statistical mechanics of community detection[J],2006,Phys Rev E, 74(1):016110-1—016110-14
[120].NewMan M E J. Modularity and community structure in networks [J]. PNAS,2006,103(23): 8577-8582
[121]. Capocci A, Servedio V D P, Caldarelli G.et al.Detecting communities in large networks[C]. In Proceedings of the 3rd Workshop on algorithms and models for the web graph, number 3243 in Lecture Notes in Computer Science, Berlin:Springer,2004
[122]. Frey B J, Dueck D. Clustering by passing message between data points [J]. Science,2007,315 (5814):972-976
[123]. Zachary W.W. An information flow model for conflict and fission in small groups[J] J.Anthropol.Res,1977,33,452-473
[124]. Massa P, Avesani P.Trust-Aware Collaborative Filtering for Recommender Systems [J]. Lecture Notes in Computer Science,2004,3290:492-508
[125]. MovieLens dataset [EB/OL].http://www. grouplens. org/data/,2007-10-13
[126]. Grabowski A, Kruszewska N, Kosinski R A.Properties of on-line social systems[J].European Physical Journal B,2008,66 (1):107-113
[127]. Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks[J].Nature,2008,453(7191):98-101
[128]. Liben-Nowell D. and Kleinberg J M. The link-prediction problem for social networks [J]. Journal of the amercian society for information science and technology,2007,58(7):1019-1031
[129]. Zhou T, Lu L Y, Zhang Y C.Predicting Missing Links via Local Information, European physical Journal B,2009,71(4):623-630
[130]. Zhou T,Ren J,Medo M,Zhang Y C.Bipartite network projection and personal recommendation[J],Phys Rev E,2007,76(4):046115
[131]. Zhou T, Jiang L L, Su R Q, Zhang Y C. Effect of initial configuration on network-based recommendation [J]. Europhysics,Letters,2008,81(5):58004
[132]. Huang Z, Zeng D, Chen H. Analyzing consumer-product graphs:Empirical findings and applications in recommender systems [J]. Management Science,2007,53(7):1146-1164
[133]. Zhang Y C,Blattner M,Yu Y K. Heat conduction process on community networks as a recommendation model[J].Phys Rev Lett,2007,99(15):154301-1—154301-4
[134]. Zhang Y C.Medo M,Ren J, et al.Recommendation model based on opinion diffusion[J].Europhys Lett,2007,80(6):68003-1—68003-5
[135]. Blattner M, Zhang Y C, Maslov S.Exploring an opinion network for taste prediction:An empirical study[J], Physica A,2007,373:753-758
[136]. Liu J G, Zhou T, Wang B H,et al.Highly accurate recommendation algorithm based on high-order similarities[J], Physica A,2010,389:881-886
[137]. Liu J G, Wang B H, Guo Q. Improved collaborative filtering algorithm via information transformation [J].International Journal of Modern Physics C,2009,20(2):285-293
[138]. Ou Q, Jin Y D, Zhou T, Wang B H, et al.Power-law strength-degree correlation from resource-allocation dynamics on weighted networks[J], Phys Rev E,2007,75(2): 021102-1-021102-5
[139]. Ren J, Zhou T,Zhang Y C. Information filtering via self-consistent refinement [J], EPL,2008, 82(5):58007-1-58007-5
[140]. Riedl J. Advanced topics in recommendation[C], In proceeding of the 12th International Conference on Intelligent User Interfaces,2007,Honolulu, USA:ACM,2007:11-11
[141]. McNee S M, Riedl J, Konstan J A.Being Accurate is Not Enough:How Accuracy Metrics have hurt Recommender Systems[C].In Extended Abstracts of the 2006 ACM Conference on Human Factors in Computing Systems,2006
[142]. Lee D D, Seung H S.Learning the parts of objects by non-negative matrix factorization [J]. Nature,1999,401(6755):788-791
[143]. Boss G,Malladi P,Quan D,et al. Cloud computing. IBM White Paper[EB/OL]. http://download.boulder.ibm.com/ibmdl/pub/software/dw/wes/hipods/Cloud_computing_wp_final_8 Oct.pdf,2008-7-21
[144].陈康,郑纬民.云计算：系统实例与研究现状[J],软件学报,2009,20(5)：1337-1348
[145]. Dean J, Ghemawat S. MapReduce:Simplified data processing on large clusters [J]. Communications of the ACM,2005,51(1):107-113
[146]. Oard D W, Kim J. Implicit feedback for recommender systems[C]. In proceedings of the AAAI Workshop Systems. Menlo Park, CA:AAAI Press,1998:80-82.
[147]. Shahabi C, Chen Y S. An adaptive recommendation system without explicit acquisition of user relevance feedback [J]. Distributed and Parallel Database,2003,14(2):173-192
[148]. Vaquero L M,Rodero-Merino L,Caceres J, et al. A Break in the Clouds:Toward a Cloud definition[J], ACM SIGCOMM Computer Communication Review,2009,39(1):50-55
[149].沈小平,马士华.基于人-机-网络一体化的综合集成管理支持系统研究[J].系统工程理论与实践.2006,26(8)：86-90
[150].刘怡君,唐锡晋.一种支持协作与知识创造的“场”[J].管理科学学报,2006,9(1)：79-85
[151]. Masao U. Relevance Feedback Models for Recommendation[C]. In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing,2006,Sydney:449-456
[152]. Lee T., Park Y., Park Y.A time-based approach to effective recommender systems using implicit feedback[J],Expert Systems with Applications,2008,34(4):3055-3062
[153]. McNee S M, Riedl J, Konstan J A. Making recommendations better:an analytic model for human-recommender interaction [C]. In CHI 2006 Extended Abstracts on Human Factors in Computing Systems,2006, Quebec, Canada:1103-1108
[154].李德毅,刘常昱.论正态云模型的普适性[J].中国工程科学.2004,6(8)：29-31
[155].李德毅,刘常昱,杜鹚等.不确定性人工智能[J].软件学报.2004,15(11)：1584-1593
[2].刘建国,周涛,汪秉宏.个性化推荐系统的研究进展[J].自然科学进展,2009 19(1)：1-15
[3]. Barabasi A L.The origin of bursts and heavy tails in human dynamics[J].Nature,2005, 435(7039):207-211
[4]. Lazer D, Pentland A, Adamic L,et al. Computational social science[J].science,2009,323:721-723
[5]. Resnick P, Varian H R. Recommender systems [J]. Communications of the ACM,1997,40(3):56-58.
[6]. Glodberg D,Nichols D,Oki B M,et al.Using collaborative filtering to weave an information Tapestry[J].Communication of the ACM.1992,Volume 35 (12):61-70
[7]. Resnick P,Iacovou N,Suchak M. et al.GroupLens:An open architecture for collaborative filtering of netnews[C].In proceedings of the conference on computer supported cooperative work,North Carolina:ACM,1994:175-186
[8]. Shardanand U, Maes P. Social information filtering:algorithms for automating "word of mouth"[C]. In proceedings of the 1995 ACM SIGCHI Conference on Human Factors in Computing Systems. Colorado:ACM Press,1995:210-217
[9]. Konstan J, Miller B,Maltz D.,et al.GRoupLens:Applying collaborative filtering to usenet News[J]. Communications of the ACM,1997,40(3):77-87
[10].Goldberg K, Roeder T, Gupta D, et al.EigenTaste:a constant time collaborative filtering algorithm [J]. Information retrieval,2001,4(2):133-151
[11].Breese J,Hecherman D,Kadie C.Empirical analysis of predictive algorithms for collaborative
filtering[C],In proceeding of the 14th conference on Uncertainty in Artificial intelligence, San Francisco:Morgan Kaufmann,1998:43-52
[12].Sarwar B,Karypis G, Konstan J,Riedl J. Item-based collaborative filtering recommendation algorithm[C].In proceedings of the 10th international World Wide Web Conference, New York:ACM Press,2001:285-295
[13].邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法[J].软件学报,2003,14(9)：1621-1628
[14].周军锋,汤显,郭景峰.一种优化的协同过滤推荐算法[J].计算机研究与发展,2004,41(10)：1842-1847
[15].陈华月,余刚,朱征宇.基于加权关联规则的用户关注项目推荐算法[J].计算机工程,2006,32(6)：86-88
[16].Papagelis M, Plexousakis D,Rousidis I, et al.Qualitative analysis of user-based and item-based prediction algorithm for recommendation agents[J].Engineering Application of artificial intelligence,2005,18(7),781-789
[17].Pennock D M,Horvitz E.Lawrence S,et al.Collaborative Filtering by Personality Diagnosis:A Hybrid Memory- and Model-Based Approach[C]. In proceeding of the 16th Conference on Uncertainty in Artificial Intelligence, UAI 2000, San Francisco Morgan Kaufmann,2000:473-480
[18]. Lee S, Yang J, Park S.Discovery of hidden similarity on collaborative Filtering to overcome sparsity problem[C].In Proceedings of discovery science:7th international conference, Discovery Science, 2004,3245:396-402
[19].Lee Ming-Yu, Huang Chiung-Wei, Lee Hahn-Ming. Associating expertized information to alleviate sparsity problem in personalization[C]. IEEE International Conference on E-Business Engineering, Shanghai,china,2006: 479-482
[20].张峰,常会友.使用BP神经网络缓解协同过滤推荐算法的稀疏性问题[J].计算机研究与发展.2006,43(4)：667-672
[21].董丽,邢春晓,王克宏.协作过滤稀疏性算法[J],清华大学学报,2009,49(10)：154-157
[22].Sarwar B. Karypis G., Konstan J, et al.Application of dimensionality reduction in recommendation systems:a case study[C]. In Proceeding of the webKDD workshop at the ACM SIGKKD.New York ACM,2006
[23].张光卫 ,李德毅,李鹏等.基于云模型的协同过滤推荐算法[J].软件学报,2007,18(10)：2403-2411
[24].陈志敏,沈洁,赵耀.基于相关均值的协同过滤推荐算法[J],计算机工程,2009,35(22)：53-55
[25].吴颜,沈洁,顾天竺等.协同过滤推荐系统中数据稀疏问题的解决[J].计算机应用研究.2007,24(6)：94-97
[26].陈健,印鉴.基于影响集的协作过滤推荐算法[J].软件学报,2007,18(7)：1685-1694
[27]. Bridge D, Kelleher J. Experiments in sparsity reduction:using clustering in collaborative recommenders[C].In proceediings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science. London:Springer-Verlag,2002:144-149
[28].李涛,王建东,叶飞跃等.一种基于用户聚类的协同过滤推荐算法[J].系统工程与电子技术,2007,29(7)：1178-1182
[29].李涛,王建东.基于多层相似性用户聚类的推荐算法[J].南京航空航天大学学报,2006,38(6)：718-721
[30].邓爱林,左子叶,朱扬勇.基于项目聚类的协同过滤推荐算法[J].小型微型计算机系统,2004,25(9)：1665-1670
[31].陈冬林,聂规划.基于商品属性隐性评分的协同过滤算法研究[J].计算机应用,2006,26(4)：966-968
[32].Oyanagi S, Kubota K, Nakase A. Application of matrix clustering to web log analysis and access prediction[C], In proceeding of the third International Workshop on WEBKDD, San Francisco,2001：13-21
[33].余力,刘鲁,罗掌华.我国电子商务推荐策略的比较分析[J].系统工程理论与实践,2004,24(8)：96-101
[34].黎星星,黄小琴,朱庆生.电子商务推荐系统研究[J].计算机工程与科学,2004,26(5)：7-10
[35].孙小华.协同过滤系统的稀疏性与冷启动问题研究[D].杭州：浙江大学,2005
[36].Schein A I, Popescul A, Ungar L H. Methods and metrics for cold-start recommendations[C]. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, Tampere, Finland,2002:253-260
[37].张海燕,丁峰,姜丽红.基于模糊聚类的协同过滤推荐方法[J].计算机仿真,2005,.22(8)：144-147
[38].Park S T, Pennock D, Madani O, et al. Naive filterbots for robust cold-start recommendations[C]. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM Press,2006:699-705
[39]. Ahn H J.A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem [J]. Information Sciences:an International Journal,2008,178(1):37-51
[40].Schein A I, Popescul A, Ungar L H, et al. Methods and metrics for cold-start recommendations[C]. In Proceedings of the 25th Annual international ACM SIGIR Conference on Research and Development in information Retrieval,2002.Tampere, Finland:253-260
[41].Lam C. SNACK:Incorporating Social Network Information in Automated Collaborative Filtering[C], Proceedings of the ACM Conference o n Electronic Commerce,2004:254-255
[42].Aggarwal C C,Wolf J L,Wu K,et al.Horting hatches an egg:A new graph-theoretic approach to collaborative filtering[C], In proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining,1999:201-212
[43].Fouss F,Pirotte A,Saerens M. A novel way of computing similarities between nodes of a graph with application to collaboration recommendation[C].In proceedings of the 2005 IEEE/MIC/ACM international conference on web intelligence,2005:550-556
[44].Huang Z, Chung W Y, Chen H. A graph model for E-commerce recommender systems [J]. Journal of the American society for information science and technology,2004,55(3):259-274
[45].余力,刘鲁,李雪峰.用户多兴趣下的个性化推荐算法研究[J].计算机集成制造系统,2004,10(12)：1610-1615
[46].Yu L,Liu L, Li X F. A hybrid collaborative filtering method for multiple-internets and multiple-content recommendation in E-Commerce [J]. Expert system with applications,2005,28(1): 67-77
[47].潘红艳,林鸿飞,赵晶.基于矩阵划分和兴趣方差的协同过滤算法[J],情报学报,2006,25(1)：50-54
[48].桑艳艳,刘培刚,李勇.拟合用户兴趣演变特性的协作过滤推荐算法[J],情报学报,2009,28(1)：109-113
[49].郑先荣,曹先彬.线性逐步遗忘协同过滤算法的研究[J].计算机工程,2007,33(6)：72-82
[50].Massa P, Avesani P. Trust-aware recommender systems [C].In proceedings of the 2007 ACM conference on Recommender systems, Minneapolis,2007,17-24
[51].Mobasher B, Burke R, Bhaumik R, et al. Attacks and remedies in collaborative recommendation [J]. IEEE intelligent systems,2007,22 (3):56-63
[52].Burke R, Mobasher B, Williams C, et al.Classification features for attack detection in collaborative recommender systems[C]. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, Philadelphia:ACM,2006:542-547
[53].Chirita P A,Nejdl W,Zamfir C.Preventing shilling attacks in online recommender systems[C].In proceedings of the 7th annual ACM international workshop on Web information and data management,New York:ACM Press,2005:67-74.
[54].孙雨,张霞,丛枫等.基于p2p网络的协同过滤推荐算法的研究与实现[J].小型微型计算机系统,2006,27(3)：417-421
[55].吴吉义,林志洁,龚祥国.基于协同过滤的移动电子商务个性化推荐系统若干研究[J].电子技术应用,2007,32(1)：5-8
[56].Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems:a survey of the state-of-the-art and possible extensions [J]. IEEE Transactions on Knowledge and Data Engineering, 2005,17(6):734-749
[57]. Song X, Tseng B L, Lin C Y, et al. Personalized Recommendation Driven by Information Flow [C], International ACM SIGIR Conference on Research & Development on Information Retrieval, Seattle, August 6-11,2006
[58]. Song X,Lin C Y,Tseng B L,et al. Modeling Evolutionary and Relational Behaviors for Community-based Dynamic Recommendation[C],In Proceeding of the SIAM International Conference on Data Mining,2006:558-562
[59]. Song X, Lin C Y., Tseng B. L.et al.Modeling and Predicting Personal Information Dissemination Behavior[C], In Proceeding of the ACM SIGKDD,2005:479-488
[60]. Song X., Chi Y., Hino K. et al. Information flow modeling based on diffusion rate for prediction and ranking[C]. In Proceeding of the 16th international Conference on World Wide Web,Alberta, Canada,2007:191-200
[61]. Flake G W, Giles C L, Giles C L.Self-organization and identification of web communities [J]. IEEE Computer,2002,35(9):66-71
[62].刘军.社会网络分析导论[M].北京：社会科学出版社,2004：12-30
[63].Fu F,Liu L H, Wang L.Empirical analysis of online social networks in the age of Web 2.0[J].Physica A:Statistical Mechanics and its Applications,2008,387(2):675-684
[64].Ganley D, Lampe C.The ties that bind:Social network principles in online communities[J], Decision Support Systems,2009,47(3):266-274
[65].Kautz H,Selman, Shah M. Referral Web:combining social networks and collaborative filtering.Communications of the ACM,1997,40(3):63-65
[66].Adamic A L. Friends and neighbors on the web [J]. Social Networks,2003,25(03):211-130
[67].Fu F,Liu L H,Yang K,et al. Structure of Self-Organized Blogosphere[EB/OL], http://arxiv.org/math/0607361,2007-6-16
[68].唐常杰,刘威,温粉莲等.社会网络分析和社团信息挖掘的三项探索[J].计算机应用,2006,26(9)：2021-2023
[69].Liu L H, Fu F,Wang L.Information propagation and collective consensus in blogosphere:a game-theoretical approach [EB/OL].http://arxiv.org/abs/physics/0701316,2007-6-15
[70].Lerman K.Social networks and social information filtering on digg [EB/OL]. http://arxiv.org/abs/cs.HC/0612046,2007-6-23
[71]. Watts D J and Strogatz S H. Collective dynamics of'small world'networks [J].Nature.1998, 393(6684):440-442
[72].Barabasi A L, Albert R. Emergence of scaling in random network[J].Science,1999,286(5439):509-512
[73].Pollner P, Palla G, Vicsek T.Preferential attachment of communities:The same principle, but a higher level [J], Europhys. Lett,2006,73 (3):478
[74].Guimera R, Amaral L A N.Functional cartography of complex metabolic networks[J].Nature, 2005,433(7028):895-900
[75].解(?),汪小帆.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学,2005,2(3)：1-12
[76]. Wu F,Huberman B A.Finding communities in linear time:a physics approach[J].Eur Phys JB,2004,38 (2):331-338
[77].Newman M E J. Analysis of weighted networks[J],Phyiscal review E,70(52):056131-1—056131-9
[78].Newman M E J, Girvan M. Finding and evaluating community.structure in networks [J]. Physical Review E,2004,69(22):026113-1-026113-15
[79]. Newman M E J.Fast algorithm for detecting community structure in networks[J],Phys Rev E, 2004,69(62):066133
[80].Newman M E J. Finding community structure in networks using the eigenvectors of matrices [J].Physical Review E,2006,74(3),036104
[81].Rosvall M, Bergstrom C. T. An information-theoretic framework for resolving community structure in complex networks [J]. PNAS,2007,104:7327-7331
[82].Kumpula J M,Saramaki J, Kaski K, et al.Limited resolution and multi-resolution methods in complex network community detection[J].Fluctuation and noise letters,2007,7(3):209-214
[83].Fortunato S, Barthelemy M. Resolution limit in community detection [J]. PNAS,2007,104(1):36-41
[84].刘婷,胡宝清.基于聚类分析的复杂网络中的社团探测[J].复杂系统与复杂科学,2007,4(1)：28-35
[85]. Estrada E, Hatano N. Communicability graph and community structures in complex networks[J].Applied Mathematics and Computation,2009,214(2):500-511
[86].Ma X K, Gao L, Yong X R,et al.Semi-supervised clustering algorithm for community structure detection in complex networks[J].Physica A:Statistical Mechanics and its Applications, 2010,389(1):187-197
[87].Reddy P K, Kitsuregawa M, Sreekanth P, Rao S S. A graph based approach to extract a neighborhood customer community for collaborative filtering [C]. In proceeding of the 2nd International Workshop on Databases in Networked Information Systems, Aizu Japan,2002:188-200.
[88].Guimera R., Sales-Pardo M., Amaral L A N.Module identification in bipartite networks with applications to directed networks [J]. Physical Review E,2007,76 (3):036102
[89]. Palla G, Derenyi I, Farkas I, et al. Uncovering the overlapping community structure of complex networks in nature and society [J]. Nature.2005,435(7043):814-818
[90]. Palla G, Barabasi A L, Vicsek T. Quantifying social group evolution [J]. Nature,2007,446(7136): 664-667
[91].Takemoto K,Oosawa C,Akutsu T.Structure of n-clique networks embedded in a complex network[J].Physica A:Statistical Mechanics and its Applications,2007,380(1):665-672
[92].Zhang S H, Wang R S, Zhang X S.Identification of overlapping community structure in complex networks using fuzzy c-means clustering [J]. Physica A:Statistical Mechanics and its Applications, 2007,374(1):483-490
[93].Wang X H,Jiao L C,Wu J S.Adjusting from disjoint to overlapping community detection of complex networks[J].Physica A:Statistical Mechanics and its Applications,2009, 388(24):5045-5056
[94].Ghoshal G, Holme P.Attractiveness and activity in Internet communities[J],Physica A:Statistical Mechanics and its Applications,2006,364:603-609
[95].Golder S A, Huberman B A. Usage patterns of collaborative tagging systems[J]. Journal of Information Science.2006,32 (2):198-208
[96].Lo S C, Lin C C. WMR:A Graph-Based Algorithm for Friend Recommendation[C].In proceeding of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence,2006, Hong Kong China:121-128
[97].Golder S A, Huberman B A. Usage patterns of collaborative tagging systems [J]. Journal of Information Science,2006,32(2):198-208
[98].Halpin H,Robu V, Shepherd H.The complex dynamics of collaborative tagging[C].In proceedings of the 16th international conference on World Wide Web,2007:211-220
[99].Shalizi C R, Camperi M F, Klinkner K L.Discovering Functional Communities in Dynamical Networks [J]. Lecture Notes in Computer Science,2007,4503
[100]. Newman M E J, Leicht E A.Mixture models and exploratory analysis in networks[C], In Proceedings of the national academy of sciences of the ed states of America,2007,104 (23):9564-9569
[101].宋江春,沈钧毅.一种新的WEB用户群体和URL聚类算法的研究[J].控制与决策,2007,22(3)：284-288
[102]. Clauset A, Moore C, Newman M E J. Structural inference of hierarchies in networks [J]. Lecture Notes in Computer Science,4503:1-13
[103]. Golbeck J. Trust and nuanced profile similarity in online social networks [J]. ACM transactions on the web,2009,3(4):1-33
[104]. McNee S M.,Riedl J., Konstan J A. Being Accurate is not enough:How accuracy metrics have hurt recommender systems[C].In proceeding of Conference on human factors in computing systems,2006, Canada:1097-1101
[105]. Wang J, Vries A P, Reinders M J T. Unified relevance models for rating prediction in collaborative filtering [J]. ACM transactions on information systems.2008,26(3):1-42
[106]. Fouss F, Pirotte A, Saerens M. A novel way of computing similarities between nodes of a graph with application to collaboration recommendation[C], In proceedings of The 2005 IEEE/MIC/ACM international conference on web intelligence,2005:550-556
[107]. Gonzalez M C, Hidalgo C A, Barabasi A L.Understanding individual human mobility patterns [J]. Nature.2008,453(7196):779-782.
[108]. Barabasi A L.The architecture of complexity-From network to structure to human dynamics[J], IEEE control system magazine,2007,27:33-42
[109]. Grabowski A. Interpersonal interactions and human dynamics in a large social network[J], Physica A,2007,385(1):363-369
[110]. Grabowski A. Opinion formation in a social network:The role of human activity [J]. Physica A, 2009,388(6):961-966
[111]. Medo M. Distance-dependent connectivity:Yet another approach to the small-world phenomenon[J], Physica A,2006,359(1):617-628
[112]. Medo M, Zhang Y C. Market model with heterogeneous buyers[J],Physica A.2008, 387(12):2889-2908
[113]. Holme P. Scale-free networks with a large-to hypersmall-world transition[J], Physica A,2007, 377(1):315-322
[114]. Mitchell T M. Mining Our Reality[J],Science,2009,326(5960):1644-1645
[115]. Vespignani A. Predicting the Behavior of Techno-Social Systems [J], Science,2009,325(5939): 425-428
[116]. Holme P. Network dynamics of ongoing social relationships[J],Europhys Letters,2003,64(3): 427-433
[117]. Leskovec J, Backstrom L, Kumar R, Tomkins A. Microscopic evolution of social networks[C], In proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining,2008,462-470
[118]. Arenas, A., Fernandez, A., Gomez, S. Multiple resolution of the modular structure of complex networks [J]. New Journal of physics,2007,10(5):053039
[119]. Reichardt J,Bornholdt S.Statistical mechanics of community detection[J],2006,Phys Rev E, 74(1):016110-1—016110-14
[120].NewMan M E J. Modularity and community structure in networks [J]. PNAS,2006,103(23): 8577-8582
[121]. Capocci A, Servedio V D P, Caldarelli G.et al.Detecting communities in large networks[C]. In Proceedings of the 3rd Workshop on algorithms and models for the web graph, number 3243 in Lecture Notes in Computer Science, Berlin:Springer,2004
[122]. Frey B J, Dueck D. Clustering by passing message between data points [J]. Science,2007,315 (5814):972-976
[123]. Zachary W.W. An information flow model for conflict and fission in small groups[J] J.Anthropol.Res,1977,33,452-473
[124]. Massa P, Avesani P.Trust-Aware Collaborative Filtering for Recommender Systems [J]. Lecture Notes in Computer Science,2004,3290:492-508
[125]. MovieLens dataset [EB/OL].http://www. grouplens. org/data/,2007-10-13
[126]. Grabowski A, Kruszewska N, Kosinski R A.Properties of on-line social systems[J].European Physical Journal B,2008,66 (1):107-113
[127]. Clauset A, Moore C, Newman M E J. Hierarchical structure and the prediction of missing links in networks[J].Nature,2008,453(7191):98-101
[128]. Liben-Nowell D. and Kleinberg J M. The link-prediction problem for social networks [J]. Journal of the amercian society for information science and technology,2007,58(7):1019-1031
[129]. Zhou T, Lu L Y, Zhang Y C.Predicting Missing Links via Local Information, European physical Journal B,2009,71(4):623-630
[130]. Zhou T,Ren J,Medo M,Zhang Y C.Bipartite network projection and personal recommendation[J],Phys Rev E,2007,76(4):046115
[131]. Zhou T, Jiang L L, Su R Q, Zhang Y C. Effect of initial configuration on network-based recommendation [J]. Europhysics,Letters,2008,81(5):58004
[132]. Huang Z, Zeng D, Chen H. Analyzing consumer-product graphs:Empirical findings and applications in recommender systems [J]. Management Science,2007,53(7):1146-1164
[133]. Zhang Y C,Blattner M,Yu Y K. Heat conduction process on community networks as a recommendation model[J].Phys Rev Lett,2007,99(15):154301-1—154301-4
[134]. Zhang Y C.Medo M,Ren J, et al.Recommendation model based on opinion diffusion[J].Europhys Lett,2007,80(6):68003-1—68003-5
[135]. Blattner M, Zhang Y C, Maslov S.Exploring an opinion network for taste prediction:An empirical study[J], Physica A,2007,373:753-758
[136]. Liu J G, Zhou T, Wang B H,et al.Highly accurate recommendation algorithm based on high-order similarities[J], Physica A,2010,389:881-886
[137]. Liu J G, Wang B H, Guo Q. Improved collaborative filtering algorithm via information transformation [J].International Journal of Modern Physics C,2009,20(2):285-293
[138]. Ou Q, Jin Y D, Zhou T, Wang B H, et al.Power-law strength-degree correlation from resource-allocation dynamics on weighted networks[J], Phys Rev E,2007,75(2): 021102-1-021102-5
[139]. Ren J, Zhou T,Zhang Y C. Information filtering via self-consistent refinement [J], EPL,2008, 82(5):58007-1-58007-5
[140]. Riedl J. Advanced topics in recommendation[C], In proceeding of the 12th International Conference on Intelligent User Interfaces,2007,Honolulu, USA:ACM,2007:11-11
[141]. McNee S M, Riedl J, Konstan J A.Being Accurate is Not Enough:How Accuracy Metrics have hurt Recommender Systems[C].In Extended Abstracts of the 2006 ACM Conference on Human Factors in Computing Systems,2006
[142]. Lee D D, Seung H S.Learning the parts of objects by non-negative matrix factorization [J]. Nature,1999,401(6755):788-791
[143]. Boss G,Malladi P,Quan D,et al. Cloud computing. IBM White Paper[EB/OL]. http://download.boulder.ibm.com/ibmdl/pub/software/dw/wes/hipods/Cloud_computing_wp_final_8 Oct.pdf,2008-7-21
[144].陈康,郑纬民.云计算：系统实例与研究现状[J],软件学报,2009,20(5)：1337-1348
[145]. Dean J, Ghemawat S. MapReduce:Simplified data processing on large clusters [J]. Communications of the ACM,2005,51(1):107-113
[146]. Oard D W, Kim J. Implicit feedback for recommender systems[C]. In proceedings of the AAAI Workshop Systems. Menlo Park, CA:AAAI Press,1998:80-82.
[147]. Shahabi C, Chen Y S. An adaptive recommendation system without explicit acquisition of user relevance feedback [J]. Distributed and Parallel Database,2003,14(2):173-192
[148]. Vaquero L M,Rodero-Merino L,Caceres J, et al. A Break in the Clouds:Toward a Cloud definition[J], ACM SIGCOMM Computer Communication Review,2009,39(1):50-55
[149].沈小平,马士华.基于人-机-网络一体化的综合集成管理支持系统研究[J].系统工程理论与实践.2006,26(8)：86-90
[150].刘怡君,唐锡晋.一种支持协作与知识创造的“场”[J].管理科学学报,2006,9(1)：79-85
[151]. Masao U. Relevance Feedback Models for Recommendation[C]. In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing,2006,Sydney:449-456
[152]. Lee T., Park Y., Park Y.A time-based approach to effective recommender systems using implicit feedback[J],Expert Systems with Applications,2008,34(4):3055-3062
[153]. McNee S M, Riedl J, Konstan J A. Making recommendations better:an analytic model for human-recommender interaction [C]. In CHI 2006 Extended Abstracts on Human Factors in Computing Systems,2006, Quebec, Canada:1103-1108
[154].李德毅,刘常昱.论正态云模型的普适性[J].中国工程科学.2004,6(8)：29-31
[155].李德毅,刘常昱,杜鹚等.不确定性人工智能[J].软件学报.2004,15(11)：1584-1593