期刊论文、会议论文

Achananuparp, Palakorn

英文

Lecture Notes in Computer Science

0302-9743

2010

6118

PART 1

375-382

14th Pacific-Asia Conference on Knowledge Discovery and Data Mining

Lecture Notes in Artificial Intelligence

JUN 21-24, 2010

Hyderabad, INDIA

[Achananuparp, Palakorn;Hu, Xiaohua;Yang, Christopher C.;An, Yuan;Guo, Lifan] Drexel Univ, Coll Informat Sci & Technol, Philadelphia, PA 19104 USA.^[He, Tingting] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China.

IIIT Hyderabad, AFOSR, AOARD, ONRG

Zaki, MJ Yu, JX Ravindran, B Pudi, V

HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY

SPRINGER-VERLAG BERLIN

978-3-642-13656-6

10.1007/978-3-642-13657-3_41

NSFNational Science Foundation (NSF) [IIS 0448023, NSF CCF 0905291, NSF IIP 0934197, NSFC 90920005]; Program of Introducing Talents of Discipline to Universities (China) [B07042]

本校为其他机构

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. W...