DocumentCode :
3126342
Title :
Learning from Negative Examples in Set-Expansion
Author :
Jindal, Prateek ; Roth, Dan
Author_Institution :
Dept. of Comput. Sci., UIUC, Urbana, IL, USA
fYear :
2011
fDate :
11-14 Dec. 2011
Firstpage :
1110
Lastpage :
1115
Abstract :
This paper addresses the task of set-expansion on free text. Set-expansion has been viewed as a problem of generating an extensive list of instances of a concept of interest, given a few examples of the concept as input. Our key contribution is that we show that the concept definition can be significantly improved by specifying some negative examples in the input, along with the positive examples. The state-of-the art centroid-based approach to set-expansion doesn´t readily admit the negative examples. We develop an inference-based approach to set-expansion which naturally allows for negative examples and show that it performs significantly better than a strong baseline.
Keywords :
learning (artificial intelligence); set theory; text analysis; free text; learning; negative example learning; set expansion; state-of-the art centroid; Equations; IP networks; Mathematical model; Semantics; USA Councils; Vectors; Vocabulary; Information Extraction; Negative Examples; Set-Expansion;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining (ICDM), 2011 IEEE 11th International Conference on
Conference_Location :
Vancouver,BC
ISSN :
1550-4786
Print_ISBN :
978-1-4577-2075-8
Type :
conf
DOI :
10.1109/ICDM.2011.86
Filename :
6137323
Link To Document :
بازگشت