نتایج جستجو برای: wisdom of crowds

تعداد نتایج: 21165232  

Journal: :CoRR 2014
Gonzalo G. de Polavieja Gabriel Madirolas

Human groups can perform extraordinary accurate estimations compared to individuals by simply using the mean, median or geometric mean of the individual estimations [Galton 1907, Surowiecki 2005, Page 2008]. However, this is true only for some tasks and in general these collective estimations show strong biases. The method fails also when allowing for social interactions, which makes the collec...

2016
Heinrich H. Nax

The introduction of participatory rating mechanisms on online sales platforms has had substantial impact on firms’ sales and profits. In this note, we develop a dynamic model of consumer influences on ratings and of rating influences on consumers, focussing on standard five-star mechanisms as implemented bymany platforms. The key components of our social influence model are the consumer trust i...

Journal: :Computational Intelligence 2013
Saif Mohammad Peter D. Turney

Even though considerable attention has been given to the polarity of words (positive and negative) and the creation of large polarity lexicons, research in emotion analysis has had to rely on limited and small emotion lexicons. In this paper we show how the combined strength and wisdom of the crowds can be used to generate a large, high-quality, word–emotion and word–polarity association lexico...

Journal: :JASIST 2014
Lutz Bornmann Werner Marx

This Brief Communication discusses the benefits of citation analysis in research evaluation based on Galton's "Wisdom of Crowds" (1907). Citations are based on the assessment of many which is why they can be ascribed a certain amount of accuracy. However, we show that citations are incomplete assessments and that one cannot assume that a high number of citations correlate with a high level of u...

Journal: :Computing and Informatics 2015
Nils Malzahn Sabrina Ziebarth Dominik Kloke Heinz Ulrich Hoppe

Computer games are currently one of the computer science applications with the highest amount of users. “Serious gaming” approaches try to use the attraction of playing games to convey serious content in an entertaining way. This paper presents a multi-agent-architecture for collaborative, serious and casual games. We are combining serious games with casual games, as these are known to have a h...

Journal: :Information Polity 2010
Bram Klievink Marijn Janssen

Improving public service delivery is a very complex domain and the complexity is difficult to grasp by stakeholders having various degree of knowledge and involvement. An emergent and promising method for dealing with complex problems is simulation gaming, which can be used to...

2010
Conor Mayo-Wilson Kevin Zollman David Danks

We evaluate the asymptotic performance of boundedly-rational strategies in multi-armed bandit problems, where performance is measured in terms of the tendency (in the limit) to play optimal actions in either (i) isolation or (ii) networks of other learners. We show that, for many strategies commonly employed in economics, psychology, and machine learning, performance in isolation and performanc...

2015
Samantha Finn Takis Metaxas Eni Mustafaraj Panagiotis Takis Metaxas

Social media has become part of modern news reporting, used by journalists to spread information and find sources, or as a news source by individuals. The quest for prominence and recognition on social media sites like Twitter can sometimes eclipse accuracy and lead to the spread of false information. Could we use the so-called “wisdom of crowds” to detect the likelihood that some claim spreadi...

2012
Dengyong Zhou John C. Platt Sumit Basu Yi Mao

An important way to make large training sets is to gather noisy labels from crowds of nonexperts. We propose a minimax entropy principle to improve the quality of these labels. Our method assumes that labels are generated by a probability distribution over workers, items, and labels. By maximizing the entropy of this distribution, the method naturally infers item confusability and worker expert...

Journal: :Discrete & Computational Geometry 2013
Arkadiusz Pawlik Jakub Kozik Tomasz Krawczyk Michal Lason Piotr Micek William T. Trotter Bartosz Walczak

Several classical constructions illustrate the fact that the chromatic number of a graph may be arbitrarily large compared to its clique number. However, until very recently no such construction was known for intersection graphs of geometric objects in the plane. We provide a general construction that for any arc-connected compact set X in R that is not an axis-aligned rectangle and for any pos...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید