共查询到20条相似文献，搜索用时 656 毫秒
1.
近年来,互联网和web技术的不断进步促进了电子商务推荐系统的快速发展,各种推荐系统的日益繁荣改变了传统的贸易行为,它的逐步建立和完善使传统的商务运作摆脱了已有规则的束缚,对相关的商业形态、交易形式、流通方式以及营销方式等都产生的巨大的影响。针对电子商务推荐系统面临的主要挑战,对电子商务推荐系统推荐算法设计以及推荐系统体系结构等关键技术进行了有益的探索和研究,对算法中影响推荐质量的稀疏性问题和影响用户满意度的推荐完整性问题进行深入分析,引入了基于聚类的最近邻查询技术对协同过滤算法进行改进,经分析新算法缓解了对特殊用户无法产生准确推荐的问题,能够带给用户各更准确的推荐。 相似文献
2.
3.
社会化推荐服务研究述评 总被引：2，自引：0，他引：2
Web2.0的广泛应用和用户需求的变革催生出了新的推荐服务理念--社会化推荐。以信息推荐研究演进为主线,学者沿着从内容推荐、协同推荐到混合推荐的技术路线,从用户模式推荐、信息组织推荐和关联关系推荐三个视角对信息推荐展开了研究;网络的社会化促进了研究的拓展,目前主要从社会化行为、关系网络和服务应用三个方面进行了社会化推荐研究,取得了一系列成果;但其推荐方式存在着固有的缺陷,应将研究重点转向基于用户关系的社会化推荐上。 相似文献
4.
基于用户兴趣偏好是现有社交网络好友推荐中应用最广泛的一种方法,但该方法忽略了用户的网络行为和所处环境对好友推荐的潜在影响。本文综述了基于用户行为和基于地理位置两种好友推荐方法的最新研究,旨在提高好友匹配的准确性。 相似文献
5.
网络用户信任感知推荐的准确性设计是提高用户间的社交网络辅助信息信任度的重要依据。传统的网络用户信任感知推荐算法采用的是基于社交网络服务和用户评分的推荐系统,主观性较大,协同过滤效果不好。提出一种基于网络动态干扰监控的信任感知推荐算法设计新方法,设计自适应神经模糊系统网络动态干扰监测算法,构建基于向量空间模型的信任度评价指标体系结构,通过调整网络拓扑权重向量设置信任度周期响应加权变量自适应函数,有效降低迭代算法的运算成本,避免了自适应神经模糊系统网络动态干扰监测加权权重成固化状态,提高抗干扰性能。实验结果表明,算法能使社交网络感知推荐模型的预测误差减少,推荐可靠性优于传统方法。 相似文献
6.
由于网络用户数据呈现渐进性非线性特征分离,导致对网络用户的信任度评价控制不准,无法有效实现对用户的准确推荐。提出一种基于Lyapunov协同权重控制的电子商务用户信任度评价渐进控制模型,将未知扰动和语义建模误差转化为满足给定信任评价的约束矩阵,完成用户信任网络控制器设计,采用Lyapunov指数系统感知策略,对用户信任权重值进行自适应调整,构建用户推荐模型构建与网络信任度控制模型,设计用户信任权重值协同感知算法,基于Lyapunov协同权重的电子商务用户信任度评价渐进控制模型改进设计。实验结果表明,该算法实现电子商务用户信任度渐进控制,控制精度较高,地域的分布特性也更加均衡,真实反映电子商务用户信任度评价的动态性、自适应性和稳健性特征,展示了较好的应用性能。 相似文献
7.
8.
9.
10.
为了提高电子商务推荐系统的精度,提出了基于关联集合的协同过滤推荐算法,该算法通过频繁项集生成算法生成一系列频繁项集,然后通过合并处理过滤掉与用户关联很小的一些噪音项目,从而使协同过滤算法更加有效。该算法在推荐精度上比传统的方法优越。 相似文献
11.
12.
Chunlin Li Jingpan Bai Zhao Wenjun Yang Xihao 《Information processing & management》2019,56(1):91-109
Recently, social network has been paid more and more attention by people. Inaccurate community detection in social network can provide better product designs, accurate information recommendation and public services. Thus, the community detection (CD) algorithm based on network topology and user interests is proposed in this paper. This paper mainly includes two parts. In first part, the focused crawler algorithm is used to acquire the personal tags from the tags posted by other users. Then, the tags are selected from the tag set based on the TFIDF weighting scheme, the semantic extension of tags and the user semantic model. In addition, the tag vector of user interests is derived with the respective tag weight calculated by the improved PageRank algorithm. In second part, for detecting communities, an initial social network, which consists of the direct and unweighted edges and the vertexes with interest vectors, is constructed by considering the following/follower relationship. Furthermore, initial social network is converted into a new social network including the undirected and weighted edges. Then, the weights are calculated by the direction and the interest vectors in the initial social network and the similarity between edges is calculated by the edge weights. The communities are detected by the hierarchical clustering algorithm based on the edge-weighted similarity. Finally, the number of detected communities is detected by the partition density. Also, the extensively experimental study shows that the performance of the proposed user interest detection (PUID) algorithm is better than that of CF algorithm and TFIDF algorithm with respect to F-measure, Precision and Recall. Moreover, Precision of the proposed community detection (PCD) algorithm is improved, on average, up to 8.21% comparing with that of Newman algorithm and up to 41.17% comparing with that of CPM algorithm. 相似文献
13.
《Information processing & management》2019,56(3):939-954
Recently, the high popularity of social networks accelerates the development of item recommendation. Integrating the influence diffusion of social networks in recommendation systems is a challenging task since topic distribution over users and items is latent and user topic interest may change over time. In this paper, we propose a dynamic generative model for item recommendation which captures the potential influence logs based on the community-level topic influence diffusion to infer the latent topic distribution over users and items. Our model enables tracking the time-varying distributions of topic interest and topic popularity over communities in social networks. A collapsed Gibbs sampling algorithm is proposed to train the model, and an improved diversification algorithm is proposed to obtain item diversified recommendation list. Extensive experiments are conducted to evaluate the effectiveness and efficiency of our method. The results validate our approach and show the superiority of our method compared with state-of-the-art diversified recommendation methods. 相似文献
14.
[目的/意义]随着MOOCs迅猛发展和普及,如何利用智能推荐技术为学习者从海量的MOOC中"寻找最佳课程"成为MOOC发展中需要解决的重要课题。[方法/过程]基于自我知觉理论和学习行为投入框架,充分利用学习行为日志和评分数据挖掘学习者之间的隐式信任关系,并通过信任传播建立MOOC社区信任网络,从而构建动态结合兴趣和隐式信任感知的混合推荐方法。为解决数据稀疏问题,提出基于信任的联合概率矩阵分解模型(TA-PMF),将课程评分矩阵、信任关系矩阵的分解相结合来挖掘用户及课程潜在特征,进而实现评分预测。[结果/结论]真实数据集测试结果表明,与显性评分值相比,学习行为投入信息对信任度构建贡献权重达到0.7;TA-PMF方法对MOOC推荐具有较好的适用性,且能在一定程度上缓解冷启动问题。 相似文献
15.
《Information processing & management》2020,57(6):102353
In this paper, we focus on the problem of discovering internally connected communities in event-based social networks (EBSNs) and propose a community detection method by utilizing social influences between users. Different from traditional social network, EBSNs contain different types of entities and links, and users in EBSNs have more complex behaviours. This leads to poor performance of the traditional social influence computation method in EBSNs. Therefore, to quantify the pairwise social influence accurately in EBSNs, we first propose to compute two types of social influences, i.e., structure-based social influence and behaviour-based social influence, by utilizing the online social network structure and offline social behaviours of users. In particular, based on the specific features of EBSNs, the similarities of user preference on three aspects (i.e., topics, regions and organizers) are utilized to measure the behaviour-based social influence. Then, we obtain the unified pairwise social influence by combining these two types of social influences through a weight function. Next, we present a social influence based community detection algorithm which is referred to as SICD. In SICD, inspired by the nonlinear feature learning ability of the autoencoder, we first devise a neighborhood based deep autoencoder algorithm to obtain nonlinear community-oriented latent representations of users, and then utilize the k-means algorithm for community detection. Experimental results conducted on real-world dataset show the effectiveness of our proposed algorithm. 相似文献
16.
针对创新社区日益增长的海量信息阻碍了用户对知识进行有效获取和创造的现状,将模糊形式概念分析（FFCA）理论应用于创新社区领先用户的个性化知识推荐研究。首先识别出创新社区领先用户并对其发帖内容进行文本挖掘得到用户——知识模糊形式背景,然后构建带有相似度的模糊概念格对用户偏好进行建模,最后基于模糊概念格和协同过滤的推荐算法为领先用户提供个性化知识推荐有序列表。以手机用户创新社区为例,验证了基于FFCA的领先用户个性化知识推荐方法的可行性,有助于满足用户个性化知识需求,促进用户更好地参与社区知识创新。 相似文献
17.
针对传统关联规则挖掘算法中频繁信息不完善,以及电子商务中各个影响因素贡献值不同的问题,提出一种基于矩阵多源加权关联个性化推荐模型——MSWPR模型,并在考虑虚拟行为水平加权和多源关联垂直加权的基础上,引入最小支持数概念作为剪枝的依据,进一步结合该模型对个性化推荐流程进行了概述。 相似文献
18.
19.
[目的/意义]通过融合用户社交与情境信息,构建虚拟知识社区个性化知识推荐模型并开展个性化知识推荐算法的设计,能够在一定程度上完善虚拟知识社区个性化知识推荐方法的理论体系,具有一定的理论价值和应用价值。[方法/过程]首先构建出基于用户社交与情境信息的虚拟知识社区个性化知识推荐模型,然后利用改进的最大团算法设计出虚拟知识社区个性化知识推荐算法,最后通过选取某虚拟知识社区的用户数据进行实例分析实现精准的个性化知识推荐。[结果/结论]在利用融合用户社交与情境信息进行虚拟知识社区个性化知识推荐过程中,通过对某虚拟知识社区的实例分析,表明其个性化知识推荐结果的精准度得到了显著的提升。 相似文献
20.
从在线消费者网络,基于消费者网络的产品扩散、电商变革等方面对在线消费者网络驱动下的产品扩散研究进行述评。认为未来研究应关注消费者网络产品扩散的影响因素,新兴模式及中国情境下的消费者行为,消费者网络行为涌现及供应链协调,以及考虑消费者网络效应下的平台间竞争问题。 相似文献