Please wait a minute...
浙江大学学报(工学版)
J4  2010, Vol. 44 Issue (9): 1659-1665    DOI: 10.3785/j.issn.1008-973X.2010.09.005
自动化技术、计算机技术     
基于用户兴趣模型两段式排序的隐私保护方法
皮俊波,陈珂,陈刚,董金祥
浙江大学 计算机科学与技术学院,浙江 杭州 310027
Privacy protection method based on user profile of two-step sorting
PI Jun-bo , CHEN Ke , CHEN Gang , DONG Jin-xiang
College of Computer Science and Technology, Zhejiang University, Hangzhou 310027， China
 全文: PDF  HTML
摘要：

针对现今个性化搜索中用户兴趣模型隐私的保护需要,提出一种基于服务器和客户端协作的用户兴趣模型两段式排序方法.利用基于上下层次结构的树状用户兴趣模型,对其分段在服务器与客户端对搜索结果进行排序,不仅提高了个性化搜索服务质量,而且通过用户可控的开放隐私程度调节,有效地达到了隐私保护的目的;此外,该模型采用动态目录结构,实现了用户兴趣数据的反馈更新,从而使得用户兴趣模型的信息更加精确.实验结果表明：该模型的个性化搜索质量优于Google原始排序结果,这种差距随着用户隐私开放控制程度的提升逐渐变小；在服务器两段排序对中间排序结果的裁剪过程中,只要恰当地选择数据的范围,不仅不会影响个性化搜索服务质量,而且能提高系统运行效率．
Abstract:

A twostep sorting method based on the corporation between server and client was proposed to meet the requirement of protecting the privacy in user profile in  personalized web search. By using the user profile based on concept tree structure, the method sorted the results on the server and client respectively, which both improved the quality of personalized web search and protected the privacy of the user by controlling the open privacy parameter. Whats more, this user profile of dynamic concept structure could be updated in time to make the data more accurate. The experimental results show that the search quality is much better than  Googles and the difference decreases when users enhancing their privacy. During the process when server pruning the temporary results, if  the scope is selected appropriately, the search quality will not be influenced and the system performance can even be improved．
出版日期: 2010-09-01
:  TP 393.08  
基金资助:

国家自然科学基金资助项目(60603044)；浙江省科技计划项目重大科技攻关资助项目(2006c11108)；博士后科学基金资助项目(20080441222).
通讯作者: 陈珂，女，助理研究员.     E-mail: chenk@zju.edu.cn
作者简介: 皮俊波(1985-)，男，四川成都人，硕士生，从事数据安全的研究.
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

皮俊波, 陈珂, 陈刚, 董金祥. 基于用户兴趣模型两段式排序的隐私保护方法[J]. J4, 2010, 44(9): 1659-1665.

PI Dun-Bei, CHEN Ke, CHEN Gang, DONG Jin-Xiang. Privacy protection method based on user profile of two-step sorting. J4, 2010, 44(9): 1659-1665.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2010.09.005    或    http://www.zjujournals.com/eng/CN/Y2010/V44/I9/1659

［1］ BARBARO M, ZELLER Jr T. A face is exposed for AOL searcher No. 4417749 ［N］. New York Times, 2006．
［2］ LIU Fang, YU C, MENG Weiyi. Personalized web search for improving retrieval effectiveness ［J］. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(1): 2840．
［3］ CHIRITA P A, NEJDL W, PAIU R, et al. Using ODP metadata to personalize search ［C］∥ Proceedings of 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2005). New York: ACM, 2005: 178185．
［4］ SIEG A, MOBASHER B, BURKE R. Web Search personalization with ontological user profiles ［C］ ∥ Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management. New York: ACM, 2007: 525534．
［5］ SWEENEY L.Kanonymity: a model for protecting privacy ［J］.International Journal on Uncertainty, Fuzziness and Knowledgebased Systems, 2002, l0(5): 557570．
［6］ MACHANAVAJJHALA A,GEHRKE J,KIFER D, et al.ldiversity:privacy beyond kanonymity ［C］ ∥ Proceedings of the 22nd International Conference on Data Engineering (ICDE2006). Atlanta: IEEE, 2006: 24．
［7］ SHEN Xuehua, TAN Bin, ZHAI Chengxiang. Privacy protection in personalized search ［C］ ∥ACM SIGIR Forum. New York: ACM, 2007: 417．
［8］ XU Yabo, WANG Ke, ZHANG Benyu, et al. Privacyenhancing personalized web search ［C］ ∥ Proceedings of the 16th International Conference on World Wide Web. New York: ACM, 2007: 591600．
［9］ BAEZAYATES R,  RIBEIRONETO B. Modern Information Retrieval ［M］. Boston: AddisonWesley Longman Publishing Co., Inc., 1999．
［10］ GROSSMAN D A, FRIEDER O. Information Retrieval: Algorithms and Heuristics ［M］. Norwell: Kluwer Academic Publishers, 1998．
［11］ COVER T M, THOMAS J A, WILEY J, et al. Elements of information theory ［M］. New York: Wiley, 1991．
[1] 徐昶, 寿黎但, 陈刚, 胡天磊. 一种基于闪存的数据库复合存储模型[J]. J4, 2012, 46(2): 294-300.
[2] 寿黎但, 廖定柏, 徐昶, 陈刚. PWLRU: 一种面向闪存数据库的缓冲区存取算法[J]. J4, 2010, 44(12): 2257-2262.
[3] 吴羽, 盛振华, 寿黎但, 陈刚. TrigSigs：一种有效的非结构化记录关联合并算法[J]. J4, 2010, 44(12): 2284-2290.
[4] 魏蔚, 董亚波, 鲁东明. 基于支持向量机和多资源最大最小公平的DDoS防御[J]. J4, 2010, 44(2): 265-270.