期刊文献+

一种面向个性化服务的无需反例集的用户建模方法 被引量:16

A User Modeling Method without Negative Examples for Personalized Services
下载PDF
导出
摘要 随着WWW信息的快速增长 ,查找用户感兴趣的信息变得越来越耗时耗力。个性化服务能为不同的用户提供有针对性的服务 ,日益受到研究者的重视。用户建模是实现个性化服务的关键技术。传统的需要正、反例集作为训练例集的用户建模方法容易干扰用户的正常浏览 ,或者由于推断失误而引入噪声。基于遗传算法和k近邻方法提出了一种无需反例集的用户建模方法 ,该方法被应用于个性化信息过滤中。实验结果表明 ,基于无需反例集的用户建模方法的信息过滤算法可以达到 73 91%的过滤率和 94 4 4 %的过滤精度。无需反例集的用户建模方法是一种可行。 With the exponential growth of World Wide Web, it becomes more and more time and energy consuming for users to find what they're interested in It leads to a clear demand for personalized services, which can provide different users with different services User modeling is the key technology in implementing personalized services Conventional user modeling methods with both positive and negative examples will either interfere users' normal browsing or bring in noises A user modeling method without negative examples is presented A hybrid of genetic algorithms and kNN classifier are utilized to search the words describing users' interests The method is applied in personalized information filtering The experiments show that the filtering ratio and precision can be 73 91% and 94 44% respectively, which demonstrates that our user modeling method is feasible and efficient
出处 《国防科技大学学报》 EI CAS CSCD 北大核心 2002年第3期67-71,共5页 Journal of National University of Defense Technology
关键词 反例集 个性化服务 用户建模 遗传算法 WWW 互联网 personalized services user modeling genetic algorithms
  • 相关文献

参考文献10

  • 1Sizing the Internet. July 10, 2000 [Z]. http://cyveillance.com/newsroom/press/ 000710.asp.
  • 2Webb G, Pazzani M, Billsus D. Machine Learning for User Modeling [J]. User Modeling and User-Adapted Interaction, 2001, 11: 19-29.
  • 3Pazzani M, Billsus D. Learning and Revising User Profiles: The Identification of Interesting Web Sites [J]. Machine Learning, 1997, 27: 313-331.
  • 4Mladenic D. Text-Learning and Related Intelligent Agents:a Survey[J]. IEEE Intelligent Systems, July/August 1999, 14(4): 44-54.
  • 5Balabanovic M, Shoham Y, Yun Y. An Adaptive Agent for Automated Web Browsing [J]. Journal of Visual Communication and Image Representation, 1995, 6(4).
  • 6Carroll J, Rosson M. Paradox of the Active User [A].Interfacing Thought: Cognitive Aspects of Human-Computer Interaction, MIT Press, 1987:80-111.
  • 7Mladenic D, Grobelnik M. Word Sequences as Features in Text-learning [A]. In Proceedings of the 7th Electrotechnical and Computer Science Conference (ERK'98). Ljubljana, Slovenia: IEEE Section.
  • 8Caruana R, Freitag D. Greedy Attribute Selection [A]. In Proceedings of Machine Learning'94, New Brunswick, NJ, 1994, 28-36.
  • 9陈彬,洪家荣,王亚东.最优特征子集选择问题[J].计算机学报,1997,20(2):133-138. 被引量:96
  • 10Baker J E. Reducing Bias and Inefficiency in the Selection Algorithm [A]. In Proceedings of the Second International Conference on Genetic Algorithms, 1987: 14-21.

二级参考文献3

  • 1Wu X,A Heuristic Covering Algorithm for Extension Matrix Approach.Department of Artificial Intelligence,1992年
  • 2洪家荣,Proc Int Computer Science Conference’88, Hong Kong,1988年
  • 3洪家荣,Int Jnal of Computer and Information Science,1985年,14卷,6期,421页

共引文献95

同被引文献75

引证文献16

二级引证文献114

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部