TY - GEN
T1 - Generalized fact-finding
AU - Pasternack, Jeff
AU - Roth, Dan
PY - 2011
Y1 - 2011
N2 - Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a state-of-the-art class of algorithms that operate in a manner analogous to Kleinberg's Hubs and Authorities, iteratively computing the trustworthiness of an information source as a function of the believability of the claims it makes, and the believability of a claim as a function of the trustworthiness of those sources asserting it. However, as fact-finders consider only "who claims what", they ignore a great deal of relevant background and contextual information. We present a framework for "lifting" (generalizing) the fact-finding process, allowing us to elegantly incorporate knowledge such as the confidence of the information extractor and the attributes of the information sources. Experiments demonstrate that leveraging this information significantly improves performance over existing, "unlifted" fact-finding algorithms.
AB - Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a state-of-the-art class of algorithms that operate in a manner analogous to Kleinberg's Hubs and Authorities, iteratively computing the trustworthiness of an information source as a function of the believability of the claims it makes, and the believability of a claim as a function of the trustworthiness of those sources asserting it. However, as fact-finders consider only "who claims what", they ignore a great deal of relevant background and contextual information. We present a framework for "lifting" (generalizing) the fact-finding process, allowing us to elegantly incorporate knowledge such as the confidence of the information extractor and the attributes of the information sources. Experiments demonstrate that leveraging this information significantly improves performance over existing, "unlifted" fact-finding algorithms.
KW - data integration
KW - fact-finders
KW - graph algorithms
KW - trust
UR - http://www.scopus.com/inward/record.url?scp=79955140836&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955140836&partnerID=8YFLogxK
U2 - 10.1145/1963192.1963243
DO - 10.1145/1963192.1963243
M3 - Conference contribution
AN - SCOPUS:79955140836
SN - 9781450305181
T3 - Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011
SP - 99
EP - 100
BT - Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011
T2 - 20th International Conference Companion on World Wide Web, WWW 2011
Y2 - 28 March 2011 through 1 April 2011
ER -