@inproceedings{melville2002contentboosted,
abstract = {Most recommender systems use Collaborative Filtering or Content-based methods to predict new items of interest for a user. While both methods have their own advantages, individually they fail to provide good recommendations in many situations. Incorporating components from both methods, a hybrid recommender system can overcome these shortcomings. In this paper, we present an elegant and effective framework for combining content and collaboration. Our approach uses a content-based predictor tc enhance existing user data, and then provides personalized suggestions through collaborative filtering. We present experimental results that show how this approach, Content-Boosted Collaborative Filtering, performs better than a pure content-based predictor, pure collaborative filter, and a naive hybrid approach.},
acmid = {777124},
address = {Menlo Park, CA, USA},
author = {Melville, Prem and Mooney, Raymod J. and Nagarajan, Ramadass},
booktitle = {Eighteenth National Conference on Artificial Intelligence},
interhash = {985028099c1a29f116ad7434005895ac},
intrahash = {a4917f0299f48e403966a8003ebd50be},
isbn = {0-262-51129-0},
location = {Edmonton, Alberta, Canada},
numpages = {6},
pages = {187--192},
publisher = {American Association for Artificial Intelligence},
title = {Content-boosted Collaborative Filtering for Improved Recommendations},
url = {http://dl.acm.org/citation.cfm?id=777092.777124},
year = 2002
}
@article{landia2013deeper,
abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.},
author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan},
interhash = {e8095b13630452ce3ecbae582f32f4bc},
intrahash = {e585a92994be476480545eb62d741642},
journal = {cs.IR},
title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations},
url = {http://arxiv.org/abs/1310.1498},
volume = {1310.1498},
year = 2013
}
@inproceedings{doerfel2013analysis,
abstract = {Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.},
acmid = {2507222},
address = {New York, NY, USA},
author = {Doerfel, Stephan and Jäschke, Robert},
booktitle = {Proceedings of the 7th ACM conference on Recommender systems},
doi = {10.1145/2507157.2507222},
interhash = {3eaf2beb1cdad39b7c5735a82c3338dd},
intrahash = {aa4b3d79a362d7415aaa77625b590dfa},
isbn = {978-1-4503-2409-0},
location = {Hong Kong, China},
numpages = {4},
pages = {343--346},
publisher = {ACM},
series = {RecSys '13},
title = {An analysis of tag-recommender evaluation procedures},
url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2013analysis.pdf},
year = 2013
}
@article{landia2013deeper,
abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.},
author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan},
interhash = {e8095b13630452ce3ecbae582f32f4bc},
intrahash = {e585a92994be476480545eb62d741642},
journal = {cs.IR},
title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations},
url = {http://arxiv.org/abs/1310.1498},
volume = {1310.1498},
year = 2013
}
@article{landia2013deeper,
abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.},
author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan},
interhash = {e8095b13630452ce3ecbae582f32f4bc},
intrahash = {e585a92994be476480545eb62d741642},
journal = {cs.IR},
title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations},
url = {http://arxiv.org/abs/1310.1498},
volume = {1310.1498},
year = 2013
}
@inproceedings{angelova2008characterizing,
abstract = {Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect strangers as long as they have common interests. del.icio.us is a social network where people store and share their personal bookmarks. Most importantly, users tag their bookmarks for ease of information dissemination and later look up. However, it is the friendship links, that make delicious a social network. They exist independently of the set of bookmarks that belong to the users and have no relation to the tags typically assigned to the bookmarks. To study the interaction among users, the strength of the existing links and their hidden meaning, we introduce implicit links in the network. These links connect only highly "similar" users. Here, similarity can reflect different aspects of the user’s profile that makes her similar to any other user, such as number of shared bookmarks, or similarity of their tags clouds. We investigate the question whether friends have common interests, we gain additional insights on the strategies that users use to assign tags to their bookmarks, and we demonstrate that the graphs formed by implicit links have unique properties differing from binomial random graphs or random graphs with an expected power-law degree distribution. },
author = {Angelova, Ralitsa and Lipczak, Marek and Milios, Evangelos and Prałat, Paweł},
booktitle = {Proceedings of the Mining Social Data Workshop (MSoDa)},
interhash = {f74d27a66d2754f3d5892d68c4abee4c},
intrahash = {02d6739886a13180dd92fbb7243ab58b},
month = jul,
organization = {ECAI 2008},
pages = {21--25},
title = {Characterizing a social bookmarking and tagging network},
url = {http://www.math.ryerson.ca/~pralat/papers/2008_delicious.pdf},
year = 2008
}
@inproceedings{sarwar2001itembased,
acmid = {372071},
address = {New York, NY, USA},
author = {Sarwar, Badrul and Karypis, George and Konstan, Joseph and Riedl, John},
booktitle = {Proceedings of the 10th international conference on World Wide Web},
doi = {10.1145/371920.372071},
interhash = {043d1aaba0f0b8c01d84edd517abedaf},
intrahash = {16f38785d7829500ed41c610a5eff9a2},
isbn = {1-58113-348-0},
location = {Hong Kong, Hong Kong},
numpages = {11},
pages = {285--295},
publisher = {ACM},
title = {Item-based collaborative filtering recommendation algorithms},
url = {http://doi.acm.org/10.1145/371920.372071},
year = 2001
}
@book{balbymarinho2012recommender,
abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},
author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},
doi = {10.1007/978-1-4614-1894-8},
interhash = {0bb7f0588cd690d67cc73e219a3a24fa},
intrahash = {87d6883ebd98e8810be45d7e7e4ade96},
isbn = {978-1-4614-1893-1},
month = feb,
publisher = {Springer},
series = {SpringerBriefs in Electrical and Computer Engineering},
title = {Recommender Systems for Social Tagging Systems},
url = {http://link.springer.com/book/10.1007/978-1-4614-1894-8},
year = 2012
}
@inproceedings{doerfel2012leveraging,
abstract = {The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.},
address = {New York, NY, USA},
author = {Doerfel, Stephan and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web},
doi = {10.1145/2365934.2365937},
interhash = {beb2c81daf975eeed6e01e1b412196b1},
intrahash = {64bf590675a833770b7d284871435a8d},
isbn = {978-1-4503-1638-5},
location = {Dublin, Ireland},
month = sep,
pages = {9--16},
publisher = {ACM},
title = {Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation },
url = {http://doi.acm.org/10.1145/2365934.2365937},
year = 2012
}
@inproceedings{parra2009evaluation,
abstract = {Motivated by the potential use of collaborative tagging systems to develop new recommender systems, we have implemented and compared three variants of user-based collaborative filtering algorithms to provide recommendations of articles on CiteULike. On our first approach, Classic Collaborative filtering (CCF), we use Pearson correlation to calculate similarity between users and a classic adjusted ratings formula to rank the recommendations. Our second approach, Neighbor-weighted Collaborative Filtering (NwCF), incorporates the amount of raters in the ranking formula of the recommendations. A modified version of the Okapi BM25 IR model over users ’ tags is implemented on our third approach to form the user neighborhood. Our results suggest that incorporating the number of raters into the algorithms leads to an improvement of precision, and they also support that tags can be considered as an alternative to Pearson correlation to calculate the similarity between users and their neighbors in a collaborative tagging system. },
author = {Parra, Denis and Brusilovsky, Peter},
booktitle = {Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web},
interhash = {03a51e24ecab3ad66fcc381980144fea},
intrahash = {42773258c36ccf2f59749991518d1784},
issn = {1613-0073},
location = {Torino, Italy},
month = jun,
series = {CEUR Workshop Proceedings},
title = {Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike},
url = {http://ceur-ws.org/Vol-467/paper5.pdf},
volume = 467,
year = 2009
}
@inproceedings{koren2009collaborative,
abstract = {Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are evolving, leading them to ever redefine their taste. Thus, modeling temporal dynamics should be a key when designing recommender systems or general customer preference models. However, this raises unique challenges. Within the eco-system intersecting multiple products and customers, many different characteristics are shifting simultaneously, while many of them influence each other and often those shifts are delicate and associated with a few data instances. This distinguishes the problem from concept drift explorations, where mostly a single concept is tracked. Classical time-window or instance-decay approaches cannot work, as they lose too much signal when discarding data instances. A more sensitive approach is required, which can make better distinctions between transient effects and long term patterns. The paradigm we offer is creating a model tracking the time changing behavior throughout the life span of the data. This allows us to exploit the relevant components of all data instances, while discarding only what is modeled as being irrelevant. Accordingly, we revamp two leading collaborative filtering recommendation approaches. Evaluation is made on a large movie rating dataset by Netflix. Results are encouraging and better than those previously reported on this dataset.},
acmid = {1557072},
address = {New York, NY, USA},
author = {Koren, Yehuda},
booktitle = {Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining},
doi = {10.1145/1557019.1557072},
interhash = {ca14b78afaf26db8dd7eb13d7986830a},
intrahash = {dad3f9050f58acf0551924e537e84e45},
isbn = {978-1-60558-495-9},
location = {Paris, France},
numpages = {10},
pages = {447--456},
publisher = {ACM},
title = {Collaborative filtering with temporal dynamics},
url = {http://doi.acm.org/10.1145/1557019.1557072},
year = 2009
}
@inproceedings{popescul2001probabilistic,
abstract = {Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and a few hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recommendations. We extend Hofmarm's (1999) aspect model to incorporate three-way co-occurrence data among users, items, and item content. The relative influence of collaboration data versus content data is not imposed as an exogenous parameter, but rather emerges naturally from the given data sources. However, global probabilistic models coupled with standard EM learning algorithms tend to drastically overfit in the sparsedata situations typical of recommendation applications. We show that secondary content information can often be used to overcome sparsity. Experiments on data from the Researchlndex library of Computer Science publications show that appropriate mixture models incorporating secondary data produce significantly better quality recommenders than k-nearest neighbors (k-NN). Global probabilistic models also allow more general inferences than local methods like k-NN.},
acmid = {2074076},
address = {San Francisco, CA, USA},
author = {Popescul, Alexandrin and Pennock, David M. and Lawrence, Steve},
booktitle = {Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence},
interhash = {12df713559b21a24a649787ad76d9b74},
intrahash = {407a9c070710c3c3b7fe307d384aed37},
isbn = {1-55860-800-1},
location = {Seattle, Washington},
numpages = {8},
pages = {437--444},
publisher = {Morgan Kaufmann Publishers Inc.},
title = {Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments},
url = {http://dl.acm.org/citation.cfm?id=2074022.2074076},
year = 2001
}
@article{kautz1997referral,
acmid = {245123},
address = {New York, NY, USA},
author = {Kautz, Henry and Selman, Bart and Shah, Mehul},
doi = {10.1145/245108.245123},
interhash = {6995678b936b33eef9ea1396e53a1fc7},
intrahash = {832d16a8c86e769c7ac9ace5381f757e},
issn = {0001-0782},
issue_date = {March 1997},
journal = {Communications of the ACM},
month = mar,
number = 3,
numpages = {3},
pages = {63--65},
publisher = {ACM},
title = {Referral Web: combining social networks and collaborative filtering},
url = {http://doi.acm.org/10.1145/245108.245123},
volume = 40,
year = 1997
}
@inproceedings{chi2009augmented,
abstract = {We are experiencing a new Social Web, where people share, communicate, commiserate, and conflict with each other. As evidenced by systems like Wikipedia, twitter, and delicious.com, these environments are turning people into social information foragers and sharers. Groups interact to resolve conflicts and jointly make sense of topic areas from "Obama vs. Clinton" to "Islam." PARC's Augmented Social Cognition researchers -- who come from cognitive psychology, computer science, HCI, CSCW, and other disciplines -- focus on understanding how to "enhance a group of people's ability to remember, think, and reason". Through Social Web systems like social bookmarking sites, blogs, Wikis, and more, we can finally study, in detail, these types of enhancements on a very large scale.
Here we summarize recent work and early findings such as: (1) how conflict and coordination have played out in Wikipedia, and how social transparency might affect reader trust; (2) how decreasing interaction costs might change participation in social tagging systems; and (3) how computation can help organize user-generated content and metadata.},
acmid = {1559959},
address = {New York, NY, USA},
author = {Chi, Ed H.},
booktitle = {Proceedings of the 2009 ACM SIGMOD International Conference on Management of data},
doi = {10.1145/1559845.1559959},
interhash = {d24a64ce5e95bae4de9329a467342dee},
intrahash = {d09b484b1036ca8273743cac1992dd7f},
isbn = {978-1-60558-551-2},
location = {Providence, Rhode Island, USA},
numpages = {12},
pages = {973--984},
publisher = {ACM},
title = {Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason},
url = {http://doi.acm.org/10.1145/1559845.1559959},
year = 2009
}
@inproceedings{donato2010notes,
abstract = {Addressing user's information needs has been one of the main goals of Web search engines since their early days. In some cases, users cannot see their needs immediately answered by search results, simply because these needs are too complex and involve multiple aspects that are not covered by a single Web or search results page. This typically happens when users investigate a certain topic in domains such as education, travel or health, which often require collecting facts and information from many pages. We refer to this type of activities as "research missions". These research missions account for 10% of users' sessions and more than 25% of all query volume, as verified by a manual analysis that was conducted by Yahoo! editors.
We demonstrate in this paper that such missions can be automatically identified on-the-fly, as the user interacts with the search engine, through careful runtime analysis of query flows and query sessions.
The on-the-fly automatic identification of research missions has been implemented in Search Pad, a novel Yahoo! application that was launched in 2009, and that we present in this paper. Search Pad helps users keeping trace of results they have consulted. Its novelty however is that unlike previous notes taking products, it is automatically triggered only when the system decides, with a fair level of confidence, that the user is undertaking a research mission and thus is in the right context for gathering notes. Beyond the Search Pad specific application, we believe that changing the level of granularity of query modeling, from an isolated query to a list of queries pertaining to the same research missions, so as to better reflect a certain type of information needs, can be beneficial in a number of other Web search applications. Session-awareness is growing and it is likely to play, in the near future, a fundamental role in many on-line tasks: this paper presents a first step on this path.},
acmid = {1772724},
address = {New York, NY, USA},
author = {Donato, Debora and Bonchi, Francesco and Chi, Tom and Maarek, Yoelle},
booktitle = {Proceedings of the 19th international conference on World wide web},
doi = {10.1145/1772690.1772724},
interhash = {3f9d8d91da75a41a35f8ba521beb559d},
intrahash = {2e2c2c1d1b7fcd30f11cbde5729f554e},
isbn = {978-1-60558-799-8},
location = {Raleigh, North Carolina, USA},
numpages = {10},
pages = {321--330},
publisher = {ACM},
title = {Do you want to take notes?: identifying research missions in Yahoo! search pad},
url = {http://doi.acm.org/10.1145/1772690.1772724},
year = 2010
}
@article{chen2007reputation,
abstract = {In this paper, we propose a user reputation model and apply it to a user-interactive question answering system. It combines the social network analysis approach and the user rating approach. Social network analysis is applied to analyze the impact of participant users' relations to their reputations. User rating is used to acquire direct judgment of a user's reputation based on other users' experiences with this user. Preliminary experiments show that the computed reputations based on our proposed reputation model can reflect the actual reputations of the simulated roles and therefore can fit in well with our user-interactive question answering system. Copyright © 2006 John Wiley & Sons, Ltd.},
author = {Chen, Wei and Zeng, Qingtian and Wenyin, Liu and Hao, Tianyong},
doi = {10.1002/cpe.1142},
interhash = {c304f655ee6ee183e07192b9fed0d618},
intrahash = {858df3646b706ce6308a12cbf1585d58},
issn = {1532-0634},
journal = {Concurrency and Computation: Practice and Experience},
number = 15,
pages = {2091--2103},
publisher = {John Wiley & Sons, Ltd.},
title = {A user reputation model for a user-interactive question answering system},
url = {http://dx.doi.org/10.1002/cpe.1142},
volume = 19,
year = 2007
}
@incollection{yu2000social,
abstract = {Trust is important wherever agents must interact. We consider the important case of interactions in electronic communities, where the agents assist and represent principal entities, such as people and businesses. We propose a social mechanism of reputation management, which aims at avoiding interaction with undesirable participants. Social mechanisms complement hard security techniques (such as passwords and digital certificates), which only guarantee that a party is authenticated and authorized, but do not ensure that it exercises its authorization in a way that is desirable to others. Social mechanisms are even more important when trusted third parties are not available. Our specific approach to reputation management leads to a decentralized society in which agents help each other weed out undesirable players.},
address = {Berlin/Heidelberg},
affiliation = {Department of Computer Science, North Carolina State University, Raleigh, NC 27695-7534, USA},
author = {Yu, Bin and Singh, Munindar},
booktitle = {Cooperative Information Agents IV - The Future of Information Agents in Cyberspace},
doi = {10.1007/978-3-540-45012-2_15},
editor = {Klusch, Matthias and Kerschberg, Larry},
interhash = {1065a4963600ef4f9b4c034d3bbd9a50},
intrahash = {337afcb67138b927b27a9687199e8568},
isbn = {978-3-540-67703-1},
keyword = {Computer Science},
pages = {355--393},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {A Social Mechanism of Reputation Management in Electronic Communities},
url = {http://dx.doi.org/10.1007/978-3-540-45012-2_15},
volume = 1860,
year = 2000
}
@inproceedings{yu2003searching,
abstract = {A referral system is a multiagent system whose member agents are capable of giving and following referrals. The specific cases of interest arise where each agent has a user. The agents cooperate by giving and taking referrals so each can better help its user locate relevant information. This use of referrals mimics human interactions and can potentially lead to greater effectiveness and efficiency than in single-agent systems.Existing approaches consider what referrals may be given and treat the referring process simply as path search in a static graph. By contrast, the present approach understands referrals as arising in and influencing dynamic social networks, where the agents act autonomously based on local knowledge. This paper studies strategies using which agents may search dynamic social networks. It evaluates the proposed approach empirically for a community of AI scientists (partially derived from bibliographic data). Further, it presents a prototype system that assists users in finding other users in practical social networks.},
acmid = {860587},
address = {New York, NY, USA},
author = {Yu, Bin and Singh, Munindar P.},
booktitle = {Proceedings of the second international joint conference on Autonomous agents and multiagent systems},
doi = {10.1145/860575.860587},
interhash = {1d5f1932e29ea02f82948d4efd12a0ad},
intrahash = {c6b422948459e04a86e766055608e55e},
isbn = {1-58113-683-8},
location = {Melbourne, Australia},
numpages = {8},
pages = {65--72},
publisher = {ACM},
title = {Searching social networks},
url = {http://doi.acm.org/10.1145/860575.860587},
year = 2003
}
@inproceedings{jurczyk2007discovering,
abstract = {Question-Answer portals such as Naver and Yahoo! Answers are quickly becoming rich sources of knowledge on many topics which are not well served by general web search engines. Unfortunately, the quality of the submitted answers is uneven, ranging from excellent detailed answers to snappy and insulting remarks or even advertisements for commercial content. Furthermore, user feedback for many topics is sparse, and can be insufficient to reliably identify good answers from the bad ones. Hence, estimating the authority of users is a crucial task for this emerging domain, with potential applications to answer ranking, spam detection, and incentive mechanism design. We present an analysis of the link structure of a general-purpose question answering community to discover authoritative users, and promising experimental results over a dataset of more than 3 million answers from a popular community QA site. We also describe structural differences between question topics that correlate with the success of link analysis for authority discovery.},
acmid = {1321575},
address = {New York, NY, USA},
author = {Jurczyk, Pawel and Agichtein, Eugene},
booktitle = {Proceedings of the sixteenth ACM conference on Conference on information and knowledge management},
doi = {10.1145/1321440.1321575},
interhash = {1c2953be3517384681b6ac831da2c766},
intrahash = {35394620d2654db8543d5da60f6f00dc},
isbn = {978-1-59593-803-9},
location = {Lisbon, Portugal},
numpages = {4},
pages = {919--922},
publisher = {ACM},
title = {Discovering authorities in question answer communities by using link analysis},
url = {http://doi.acm.org/10.1145/1321440.1321575},
year = 2007
}
@inproceedings{agichtein2008finding,
abstract = {The quality of user-generated content varies drastically from excellent to abuse and spam. As the availability of such content increases, the task of identifying high-quality content sites based on user contributions --social media sites -- becomes increasingly important. Social media in general exhibit a rich variety of information sources: in addition to the content itself, there is a wide array of non-content information available, such as links between items and explicit quality ratings from members of the community. In this paper we investigate methods for exploiting such community feedback to automatically identify high quality content. As a test case, we focus on Yahoo! Answers, a large community question/answering portal that is particularly rich in the amount and types of content and social interactions available in it. We introduce a general classification framework for combining the evidence from different sources of information, that can be tuned automatically for a given social media type and quality definition. In particular, for the community question/answering domain, we show that our system is able to separate high-quality items from the rest with an accuracy close to that of humans},
acmid = {1341557},
address = {New York, NY, USA},
author = {Agichtein, Eugene and Castillo, Carlos and Donato, Debora and Gionis, Aristides and Mishne, Gilad},
booktitle = {Proceedings of the international conference on Web search and web data mining},
doi = {10.1145/1341531.1341557},
interhash = {72c7bf5d1c983c47bfc3c6cc9084c26c},
intrahash = {29c5c74d95dce215a9692b94fc619839},
isbn = {978-1-59593-927-2},
location = {Palo Alto, California, USA},
numpages = {12},
pages = {183--194},
publisher = {ACM},
title = {Finding high-quality content in social media},
url = {http://doi.acm.org/10.1145/1341531.1341557},
year = 2008
}