An Efficient Boosting Algorithm for Combining Preferences
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Finding semantically similar questions based on their answers
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Retrieving answers from frequently asked questions pages on the web
Proceedings of the 14th ACM international conference on Information and knowledge management
Finding similar questions in large question and answer archives
Proceedings of the 14th ACM international conference on Information and knowledge management
Finding experts in community-based question-answering services
Proceedings of the 14th ACM international conference on Information and knowledge management
Learning to rank using gradient descent
ICML '05 Proceedings of the 22nd international conference on Machine learning
Preference learning with Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
Adapting ranking SVM to document retrieval
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
A framework to predict the quality of answers with non-textual features
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Discovering authorities in question answer communities by using link analysis
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Finding high-quality content in social media
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Retrieval models for question and answer archives
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Predicting information seeker satisfaction in community question answering
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Question utility: a novel static ranking of question search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
LexRank: graph-based lexical centrality as salience in text summarization
Journal of Artificial Intelligence Research
People, clouds, and interaction for information access
Proceedings of the 3rd International Universal Communication Symposium
Predicting web searcher satisfaction with existing community-based answers
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
I want to answer; who has a question?: Yahoo! answers recommender system
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Learning to recommend questions based on public interest
Proceedings of the 20th ACM international conference on Information and knowledge management
Dual role model for question recommendation in community question answering
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Question routing in community based QA: incorporating answer quality and answer content
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Finding similar questions with categorization information and dependency syntactic tree
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Hi-index | 0.00 |
At community question answering services, users are usually encouraged to rate questions by votes. The questions with the most votes are then recommended and ranked on the top when users browse questions by category. As users are not obligated to rate questions, usually only a small proportion of questions eventually gets rating. Thus, in this paper, we are concerned with learning to recommend questions from user ratings of a limited size. To overcome the data sparsity, we propose to utilize questions without users rating as well. Further, as there exist certain noises within user ratings (the preference of some users expressed in their ratings diverges from that of the majority of users), we design a new algorithm called 'majority-based perceptron algorithm' which can avoid the influence of noisy instances by emphasizing its learning over data instances from the majority users. Experimental results from a large collection of real questions confirm the effectiveness of our proposals.