Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13657-3_41 | PAKDD |
Keywords | Field | DocType |
distinct complex question answering,negative endorsement,answer node,complex question,negative sign,answer graph,answer diversification,negative edge,novel graph ranking model,negative-edge graph,long-term negative endorsement,question answering,random walk | Data mining,Random walk,Computer science,Redundancy (engineering),Diversification (marketing strategy),Artificial intelligence,Negative sign,Multiple choice,Graph,Information retrieval,Ranking,Complex question,Machine learning | Conference |
Volume | ISSN | ISBN |
6118 | 0302-9743 | 3-642-13656-7 |
Citations | PageRank | References |
3 | 0.40 | 20 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Palakorn Achananuparp | 1 | 302 | 23.16 |
| Xiaohua Hu | 2 | 2819 | 314.15 |
| Tingting He | 3 | 348 | 61.04 |
| Christopher C. Yang | 4 | 1590 | 138.09 |
| Yuan An | 5 | 117 | 14.51 |
| Lifan Guo | 6 | 36 | 4.94 |