Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yan Chen 0014

dblp:88/2827-14 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2012
0000-0003-1287-4525ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Human-computer interaction and pervasive computing
2 papers
Collaborative and social computing · 80% Ubiquitous computing and smart environments · 20%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
text classification
0.112012
"I loan because...": understanding motivations for pro-social lending · WSDM 2012
Computational social science and digital humanities › social computing
online community analysis
0.112012
"I loan because...": understanding motivations for pro-social lending · WSDM 2012
Algorithmic game theory and mechanism design › fair division
equitable allocations
0.112007
Shake it up baby: scheduling with package auctions · EC 2007
Algorithmic game theory and mechanism design
mechanism design
0.112007
Shake it up baby: scheduling with package auctions · EC 2007
Algorithmic game theory and mechanism design › resource allocation
resource allocation mechanism
0.112007
Shake it up baby: scheduling with package auctions · EC 2007
Ubiquitous computing and smart environments
incentive mechanism
0.012010
Re-examining price as a predictor of answer quality in an online q&a site · CHI 2010
Collaborative and social computing › remote collaboration
collaboratories
0.012007
Shake it up baby: scheduling with package auctions · EC 2007

Methods — techniques the papers use, named apart from their topics

text classifier · 0.4social features · 0.4lexical features · 0.4knapsack optimization · 0.1experimental economic approaches · 0.1statistical analysis · 0.1field experiment re-analysis · 0.1
YearPublicationVenuePosition
2012 "I loan because...": understanding motivations for pro-social lending
abstract
As a new paradigm of online communities, microfinance sites such as Kiva.org have attracted much public attention. To understand lender motivations on Kiva, we classify the lenders' self-stated motivations into ten categories with human coders and machine learning based classifiers. We employ text classifiers using lexical features, along with social features based on lender activity information on Kiva, to predict the categories of lender motivation statements. Although the task appears to be much more challenging than traditional topic-based categorization, our classifiers can achieve high precision in most categories. Using the results of this classification along with Kiva teams information, we predict lending activity from lender motivation and team affiliations. Finally, we make design recommendations regarding Kiva practices which might increase pro-social lending.
Yang Liu 0019, Roy Chen, Yan Chen 0014, Qiaozhu Mei, Suzy Salib
WSDM3
2010 Re-examining price as a predictor of answer quality in an online q&a site
abstract
Online question-answering services provide mechanisms for knowledge exchange by allowing users to ask and answer questions on a wide range of topics. A key question for designing such services is whether charging a price has an effect on answer quality. Two field experiments using one such service, Google Answers, offer conflicting answers to this question. To resolve this inconsistency, we re-analyze data from Harper et al. [5] and Chen et al. [2] to study the price effect in greater depth. Decomposing the price effect into two different levels yields results that reconcile those of the two field experiments. Specifically, we find that: (1) a higher price significantly increases the likelihood that a question receives an answer and (2) for questions that receive an answer, there is no significant price effect on answer quality. Additionally, we find that the rater background makes a difference in evaluating answer quality.
Grace YoungJoo Jeon, Yong-Mi Kim, Yan Chen 0014
CHI3
2007 Social Comparisons to Motivate Contributions to an Online Community
F. Maxwell Harper, Sherry Xin Li, Yan Chen 0014, Joseph A. Konstan
PERSUASIVE3
2007 Shake it up baby: scheduling with package auctions
abstract
In many disciplines success depends onaccess to scarce resources, such as unique instruments. Researchon computer-supported cooperative work has contributed to the development of technologies, such as collaboratories, that broaden access to scarce scientific and engineering resources. While broader access is often applauded, little attention has been focused on the problem of equitable and efficient resource allocation in the face of increased demand created through collaboratory use. This paper, then, uses the framework of mechanism design to evaluate different resource allocation schemes (RAD, Vickery, and knapsack). Experimental results show that knapsack achieves a more equitable distribution of resources than RAD or Vickery, but that RAD and Vickery are both more efficient than knapsack. The findings highlight the need for systematic exploration of allocation mechanisms within collaboratories, where simple optimization (e.g., knapsack) is likely to produce a sub-optimal match of resources to needs. More generally, the findings illustrate the utility of experimental economic approaches in understanding issues that emerge in large-scale collaborations, such as entire scientific and engineering communities.
Kan Takeuchi, John Lin, Yan Chen 0014, Thomas A. Finholt
EC3