中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
towards a reliable spam-proof tagging system

文献类型:会议论文

作者Zhai Ennan ; Ding Liping ; Qing Sihan
出版日期2011
会议名称2011 5th International Conference on Secure Software Integration and Reliability Improvement, SSIRI 2011
会议日期27-Jun-02
会议地点Jeju Island, Korea, Republic of
关键词Internet Reliability Social networking (online) Supervisory personnel Thesauri
页码174-181
英文摘要Tagging systems are particularly vulnerable to tag spam. Although some previous efforts aim to address this problem with detection-based or demotion-based approaches tricky attacks launched by attackers who can exploit vulnerabilities of spam-resistant mechanisms are still able to invalidate those efforts. Therefore it is challenging to resist tricky spam attacks in tagging systems. This paper proposes a novel spam-proof tagging system which can provide high-quality tag search results even under tricky attacks based on four key insights demotion-based strategy reputation altruistic users and social networking. Specifically our system upgrades/degrades the ranks of correct/incorrect content items in search results through introducing personalized user's reliability degrees and responsible users thus avoiding clients pick unwanted content. Experimental results illustrated our system could effectively defend against tricky tag spam attacks and work better than current prevalent tag search models. © 2011 IEEE.
收录类别EI
会议主办者Korea Software Engineering Society
会议录Proceedings - 2011 5th International Conference on Secure Software Integration and Reliability Improvement, SSIRI 2011
会议录出版地United States
ISBN号9780769544533
源URL[http://124.16.136.157/handle/311060/14211]  
专题软件研究所_基础软件国家工程研究中心_会议论文
推荐引用方式
GB/T 7714
Zhai Ennan,Ding Liping,Qing Sihan. towards a reliable spam-proof tagging system[C]. 见:2011 5th International Conference on Secure Software Integration and Reliability Improvement, SSIRI 2011. Jeju Island, Korea, Republic of. 27-Jun-02.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。