Answer diversification for complex question answering on the web

Authors:
Palakorn Achananuparp;Xiaohua Hu;Tingting He;Christopher C. Yang;Yuan An;Lifan Guo
Affiliations:
College of Information Science and Technology, Drexel University, Philadelphia, PA;College of Information Science and Technology, Drexel University, Philadelphia, PA;Department of Computer Science, Central China Normal University, Wuhan, China;College of Information Science and Technology, Drexel University, Philadelphia, PA;College of Information Science and Technology, Drexel University, Philadelphia, PA;College of Information Science and Technology, Drexel University, Philadelphia, PA
Venue:
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Year:
2010

Citing 16
Cited 0

The use of MMR, diversity-based reranking for reordering documents and producing summaries

Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Retrieval and novelty detection at the sentence level

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Using random walks for question-focused sentence retrieval

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Automatically evaluating answers to definition questions

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Overview of the TREC 2006 ciQA task

ACM SIGIR Forum
Discovering authorities in question answer communities by using link analysis

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Predicting information seeker satisfaction in community question answering

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Novelty and diversity in information retrieval evaluation

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Diversifying search results

Proceedings of the Second ACM International Conference on Web Search and Data Mining
Quality-aware collaborative question answering: methods and evaluation

Proceedings of the Second ACM International Conference on Web Search and Data Mining
Enhancing diversity, coverage and balance for summarization through structure learning

Proceedings of the 18th international conference on World wide web
The slashdot zoo: mining a social network with negative edges

Proceedings of the 18th international conference on World wide web
Summarizing Documents by Measuring the Importance of a Subset of Vertices within a Graph

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Using negative voting to diversify answers in non-factoid question answering

Proceedings of the 18th ACM conference on Information and knowledge management
Improving complex interactive question answering with Wikipedia anchor text

ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weights in an answer graph to model the redundancy relation among the answer nodes. Negative edges can be thought of as the propagation of negative endorsements or disapprovals which is used to penalize factual redundancy. As the ranking proceeds, the initial score of the answer node, given by its relevancy to the specific question, will be adjusted according to a long-term negative endorsement from other answer nodes. We empirically evaluate the effectiveness of our method by conducting a comprehensive experiment on two distinct complex question answering data sets.