ABSTRACT
Our reliance on networked, collectively built information is a vulnerability when the quality or reliability of this information is poor. Wikipedia, one such collectively built information source, is often our first stop for information on all kinds of topics; its quality has stood up to many tests, and it prides itself on having a "Neutral Point of View". Enforcement of neutrality is in the hands of comparatively few, powerful administrators. We find a surprisingly large number of editors who change their behavior and begin focusing more on a particular controversial topic once they are promoted to administrator status. The conscious and unconscious biases of these few, but powerful, administrators may be shaping the information on many of the most sensitive topics on Wikipedia; some may even be explicitly infiltrating the ranks of administrators in order to promote their own points of view. Neither prior history nor vote counts during an administrator's election can identify those editors most likely to change their behavior in this suspicious manner. We find that an alternative measure, which gives more weight to influential voters, can successfully reject these suspicious candidates. This has important implications for how we harness collective intelligence: even if wisdom exists in a collective opinion (like a vote), that signal can be lost unless we carefully distinguish the true expert voter from the noisy or manipulative voter.
- Candid CAMERA. Harper's Magazine, July 2008.Google Scholar
- D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research, 3: 993--1022, Mar. 2003. ISSN 1532-4435. URL http://dl.acm.org/citation.cfm?id=944919.944937. Google ScholarDigital Library
- M. Burke and R. Kraut. Mopping up: Modeling Wikipedia promotion decisions. In Proceedings of the ACM Conference on Computer Supported Cooperative Work, pages 27--36, 2008. Google ScholarDigital Library
- S. Das and M. Magdon-Ismail. Collective wisdom: Information growth in wikis and blogs. In Proceedings of the ACM Conference on Electronic Commerce, pages 231--240, 2010. Google ScholarDigital Library
- A. Ghosh, S. Kale, and P. McAfee. Who moderates the moderators? Crowdsourcing abuse detection in user-generated content. In Proceedings of the ACM Conference on Electronic Commerce, pages 167--176, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0261-6. 10.1145/1993574.1993599. URL http://doi.acm.org/10.1145/1993574.1993599. Google ScholarDigital Library
- J. Giles. Internet encyclopaedias go head to head. phNature, 438 (7070): 900--901, December 2005. ISSN 0028-0836.Google Scholar
- T. L. Griffiths and M. Steyvers. Finding scientific topics. Proceedings of the National Academy of Sciences, 101: 5228--5235, Apr 2004. ISSN 0027-8424. 10.1073/pnas.0307752101. URL http://dx.doi.org/10.1073/pnas.0307752101.Google ScholarCross Ref
- R. Hanson. Decision markets. Entrepreneurial Economics: Bright Ideas from the Dismal Science, page 79, 2002.Google Scholar
- M. Hindman, K. Tsioutsiouliklis, and J. Johnson. Googlearchy: How a few heavily-linked sites dominate politics on the web. In Annual Meeting of the Midwest Political Science Association, volume 4, pages 1--33, 2003.Google Scholar
- G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '02, pages 538--543, New York, NY, USA, 2002. ACM. ISBN 1-58113-567-X. http://doi.acm.org/10.1145/775047.775126. URL http://doi.acm.org/10.1145/775047.775126. Google ScholarDigital Library
- G. Kalna and D. J. Higham. A clustering coefficient for weighted networks, with application to gene expression data. AI Communications, 20: 263--271, Dec 2007. ISSN 0921-7126. URL http://dl.acm.org/citation.cfm?id=1365534.1365536. Google ScholarDigital Library
- A. Kittur, B. Suh, B. A. Pendleton, and E. H. Chi. He says, she says: Conflict and coordination in Wikipedia. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 2007. Google ScholarDigital Library
- D. Lazer, A. Pentland, L. Adamic, S. Aral, A. Barabasi, D. Brewer, N. Christakis, N. Contractor, J. Fowler, M. Gutmann, T. Jebara, G. King, M. Macy, D. Roy, and M. Van Alstyne. Life in the network: the coming age of computational social science. Science, 323 (5915): 721, 2009.Google ScholarCross Ref
- C. Li, A. Datta, and A. Sun. Mining latent relations in peer-production environments: A case study with Wikipedia article similarity and controversy. Social Network Analysis and Mining, pages 1--14, 2011.Google Scholar
- Z. Liu, Y. Zhang, E. Y. Chang, and M. Sun. Plda+: Parallel latent Dirichlet allocation with data placement and pipeline processing. ACM Transactions on Intelligent Systems and Technology, special issue on Large Scale Machine Learning, 2011. Google ScholarDigital Library
- R. Lopes and L. Carriço. On the credibility of Wikipedia: an accessibility perspective. In Proceedings of the 2nd ACM workshop on Information credibility on the web, WICOW '08, pages 27--34, New York, NY, USA, 2008. ACM. ISBN 978-1-60558-259-7. URL http://doi.acm.org/10.1145/1458527.1458536. Google ScholarDigital Library
- F. Menczer, S. Fortunato, A. Flammini, and A. Vespignani. Googlearchy or Googlocracy? IEEE Spectrum Online, 2006.Google Scholar
- M. Moyer. Manipulation of the crowd. Scientific American Magazine, 303 (1): 26--28, 2010.Google ScholarCross Ref
- M. Potthast, B. Stein, and R. Gerling. Automatic vandalism detection in Wikipedia. In Proceedings of the IR research, 30th European conference on Advances in information retrieval, ECIR'08, pages 663--668, Berlin, Heidelberg, 2008. Springer. ISBN 3-540-78645-7, 978-3-540-78645-0. URL http://dl.acm.org/citation.cfm?id=1793274.1793363. Google ScholarDigital Library
- P. Resnick and R. Sami. The influence limiter: Provably manipulation-resistant recommender systems. In Proceedings of the ACM Conference on Recommender Systems, pages 25--32. ACM, 2007. Google ScholarDigital Library
- K. Smets, B. Goethals, and B. Verdonk. Automatic vandalism detection in Wikipedia: Towards a machine learning approach. In Proceedings of the AAAI Workshop on Wikipedia and Artificial Intelligence, 2008.Google Scholar
- A. Spoerri. What is popular on Wikipedia and why? First Monday, 12 (4), April 2007.Google Scholar
- B.-Q. Vuong, E.-P. Lim, A. Sun, M.-T. Le, and H. W. Lauw. On ranking controversies in Wikipedia: Models and evaluation. In Proceedings of the International Conference on Web Search and Web Data Mining, pages 171--182, 2008. Google ScholarDigital Library
- H. T. Welser, D. Cosley, G. Kossinets, A. Lin, F. Dokshin, G. Gay, and M. Smith. Finding social roles in Wikipedia. In Proceedings of the 2011 iConference, iConference '11, pages 122--129, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0121-3. 10.1145/1940761.1940778. URL http://doi.acm.org/10.1145/1940761.1940778. Google ScholarDigital Library
- D. M. Wilkinson and B. A. Huberman. Assessing the value of coooperation in Wikipedia. First Monday, 12 (4), Feb 2007.Google Scholar
- J. Wolfers and E. Zitzewitz. Prediction markets. Journal of Economic Perspectives, 18 (2): 107--126, 2004.Google ScholarCross Ref
Index Terms
-
Manipulation among the arbiters of collective intelligence: how wikipedia administrators mold public opinion
-
Recommendations
-
Manipulation among the Arbiters of Collective Intelligence: How Wikipedia Administrators Mold Public Opinion
Our reliance on networked, collectively built information is a vulnerability when the quality or reliability of this information is poor. Wikipedia, one such collectively built information source, is often our first stop for information on all kinds of ...
-
Resist Intruders' Manipulation via Context-Based TCP/IP Packet Matching
AINA '10: Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and ApplicationsStepping-stone is the most popular way used to attack other computers. The reason is that intruders can be protected through a long connection chain involving some compromised computers called stepping-stones. Some intruders even manipulate a stepping-...
-
Winner Determination and Manipulation in Minisum and Minimax Committee Elections
ADT 2015: Proceedings of the 4th International Conference on Algorithmic Decision Theory - Volume 9346In a committee election, a set of candidates has to be determined as winner of the election. Baumeister and Dennisenï ź[2] proposed to extend the minisum and minimax approach, initially defined for approval votes, to other forms of votes. They define ...
Comments