%0 Conference Paper %1 bian2008votes %A Bian, Jiang %A Liu, Yandong %A Agichtein, Eugene %A Zha, Hongyuan %B Proceedings of the 4th international workshop on Adversarial information retrieval on the web %C New York, NY, USA %D 2008 %I ACM %K ranking social-search social-software %P 53--60 %R 10.1145/1451983.1451997 %T A few bad votes too many?: towards robust ranking in social media %U http://doi.acm.org/10.1145/1451983.1451997 %X Online social media draws heavily on active reader participation, such as voting or rating of news stories, articles, or responses to a question. This user feedback is invaluable for ranking, filtering, and retrieving high quality content - tasks that are crucial with the explosive amount of social content on the web. Unfortunately, as social media moves into the mainstream and gains in popularity, the quality of the user feedback degrades. Some of this is due to noise, but, increasingly, a small fraction of malicious users are trying to "game the system" by selectively promoting or demoting content for profit, or fun. Hence, an effective ranking of social media content must be robust to noise in the user interactions, and in particular to vote spam. We describe a machine learning based ranking framework for social media that integrates user interactions and content relevance, and demonstrate its effec- tiveness for answer retrieval in a popular community question answering portal. We consider several vote spam attacks, and introduce a method of training our ranker to increase its robustness to some common forms of vote spam attacks. The results of our large-scale experimental evaluation show that our ranker is signifcicantly more robust to vote spam compared to a state-of-the-art baseline as well as the ranker not explicitly trained to handle malicious interactions. %@ 978-1-60558-159-0

@inproceedings{bian2008votes, abstract = {Online social media draws heavily on active reader participation, such as voting or rating of news stories, articles, or responses to a question. This user feedback is invaluable for ranking, filtering, and retrieving high quality content - tasks that are crucial with the explosive amount of social content on the web. Unfortunately, as social media moves into the mainstream and gains in popularity, the quality of the user feedback degrades. Some of this is due to noise, but, increasingly, a small fraction of malicious users are trying to "game the system" by selectively promoting or demoting content for profit, or fun. Hence, an effective ranking of social media content must be robust to noise in the user interactions, and in particular to vote spam. We describe a machine learning based ranking framework for social media that integrates user interactions and content relevance, and demonstrate its effec- tiveness for answer retrieval in a popular community question answering portal. We consider several vote spam attacks, and introduce a method of training our ranker to increase its robustness to some common forms of vote spam attacks. The results of our large-scale experimental evaluation show that our ranker is signifcicantly more robust to vote spam compared to a state-of-the-art baseline as well as the ranker not explicitly trained to handle malicious interactions.}, acmid = {1451997}, added-at = {2011-07-21T17:08:46.000+0200}, address = {New York, NY, USA}, author = {Bian, Jiang and Liu, Yandong and Agichtein, Eugene and Zha, Hongyuan}, biburl = {https://www.bibsonomy.org/bibtex/26966a905fd293021109f05d0e2576ef3/beate}, booktitle = {Proceedings of the 4th international workshop on Adversarial information retrieval on the web}, description = {A few bad votes too many?}, doi = {10.1145/1451983.1451997}, interhash = {6e6cd21c3105008744f7db844aa70341}, intrahash = {6966a905fd293021109f05d0e2576ef3}, isbn = {978-1-60558-159-0}, keywords = {ranking social-search social-software}, location = {Beijing, China}, numpages = {8}, pages = {53--60}, publisher = {ACM}, series = {AIRWeb '08}, timestamp = {2011-07-21T17:08:46.000+0200}, title = {A few bad votes too many?: towards robust ranking in social media}, url = {http://doi.acm.org/10.1145/1451983.1451997}, year = 2008 }