Swanson linking revisited

Accelerating literature-based discovery across domains using a conceptual influence graph

Gus Hahn-Powell, Marco Valenzuela-Escárcega, Mihai Surdeanu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We introduce a modular approach for literature-based discovery consisting of a machine reading and knowledge assembly component that together produce a graph of influence relations (e.g., “A promotes B”) from a collection of publications. A search engine is used to explore direct and indirect influence chains. Query results are substantiated with textual evidence, ranked according to their relevance, and presented in both a table-based view, as well as a network graph visualization. Our approach operates in both domain-specific settings, where there are knowledge bases and ontologies available to guide reading, and in multi-domain settings where such resources are absent. We demonstrate that this deep reading and search system reduces the effort needed to uncover “undiscovered public knowledge”, and that with the aid of this tool a domain expert was able to drastically reduce her model building time from months to two days.

Original languageEnglish (US)
Title of host publicationACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations
PublisherAssociation for Computational Linguistics (ACL)
Pages103-108
Number of pages6
ISBN (Print)9781945626715
DOIs
StatePublished - Jan 1 2017
Event55th Annual Meeting of the Association for Computational Linguistics, ACL 2017 - Vancouver, Canada
Duration: Jul 30 2017Aug 4 2017

Other

Other55th Annual Meeting of the Association for Computational Linguistics, ACL 2017
CountryCanada
CityVancouver
Period7/30/178/4/17

Fingerprint

Search engines
Ontology
Visualization
search engine
ontology
visualization
expert
resources
evidence
literature
Graph

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence
  • Software

Cite this

Hahn-Powell, G., Valenzuela-Escárcega, M., & Surdeanu, M. (2017). Swanson linking revisited: Accelerating literature-based discovery across domains using a conceptual influence graph. In ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations (pp. 103-108). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/P17-4018

Swanson linking revisited : Accelerating literature-based discovery across domains using a conceptual influence graph. / Hahn-Powell, Gus; Valenzuela-Escárcega, Marco; Surdeanu, Mihai.

ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations. Association for Computational Linguistics (ACL), 2017. p. 103-108.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hahn-Powell, G, Valenzuela-Escárcega, M & Surdeanu, M 2017, Swanson linking revisited: Accelerating literature-based discovery across domains using a conceptual influence graph. in ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations. Association for Computational Linguistics (ACL), pp. 103-108, 55th Annual Meeting of the Association for Computational Linguistics, ACL 2017, Vancouver, Canada, 7/30/17. https://doi.org/10.18653/v1/P17-4018
Hahn-Powell G, Valenzuela-Escárcega M, Surdeanu M. Swanson linking revisited: Accelerating literature-based discovery across domains using a conceptual influence graph. In ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations. Association for Computational Linguistics (ACL). 2017. p. 103-108 https://doi.org/10.18653/v1/P17-4018
Hahn-Powell, Gus ; Valenzuela-Escárcega, Marco ; Surdeanu, Mihai. / Swanson linking revisited : Accelerating literature-based discovery across domains using a conceptual influence graph. ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations. Association for Computational Linguistics (ACL), 2017. pp. 103-108
@inproceedings{a121168b1e0e49c49841a8ae1cefadd0,
title = "Swanson linking revisited: Accelerating literature-based discovery across domains using a conceptual influence graph",
abstract = "We introduce a modular approach for literature-based discovery consisting of a machine reading and knowledge assembly component that together produce a graph of influence relations (e.g., “A promotes B”) from a collection of publications. A search engine is used to explore direct and indirect influence chains. Query results are substantiated with textual evidence, ranked according to their relevance, and presented in both a table-based view, as well as a network graph visualization. Our approach operates in both domain-specific settings, where there are knowledge bases and ontologies available to guide reading, and in multi-domain settings where such resources are absent. We demonstrate that this deep reading and search system reduces the effort needed to uncover “undiscovered public knowledge”, and that with the aid of this tool a domain expert was able to drastically reduce her model building time from months to two days.",
author = "Gus Hahn-Powell and Marco Valenzuela-Esc{\'a}rcega and Mihai Surdeanu",
year = "2017",
month = "1",
day = "1",
doi = "10.18653/v1/P17-4018",
language = "English (US)",
isbn = "9781945626715",
pages = "103--108",
booktitle = "ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations",
publisher = "Association for Computational Linguistics (ACL)",

}

TY - GEN

T1 - Swanson linking revisited

T2 - Accelerating literature-based discovery across domains using a conceptual influence graph

AU - Hahn-Powell, Gus

AU - Valenzuela-Escárcega, Marco

AU - Surdeanu, Mihai

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We introduce a modular approach for literature-based discovery consisting of a machine reading and knowledge assembly component that together produce a graph of influence relations (e.g., “A promotes B”) from a collection of publications. A search engine is used to explore direct and indirect influence chains. Query results are substantiated with textual evidence, ranked according to their relevance, and presented in both a table-based view, as well as a network graph visualization. Our approach operates in both domain-specific settings, where there are knowledge bases and ontologies available to guide reading, and in multi-domain settings where such resources are absent. We demonstrate that this deep reading and search system reduces the effort needed to uncover “undiscovered public knowledge”, and that with the aid of this tool a domain expert was able to drastically reduce her model building time from months to two days.

AB - We introduce a modular approach for literature-based discovery consisting of a machine reading and knowledge assembly component that together produce a graph of influence relations (e.g., “A promotes B”) from a collection of publications. A search engine is used to explore direct and indirect influence chains. Query results are substantiated with textual evidence, ranked according to their relevance, and presented in both a table-based view, as well as a network graph visualization. Our approach operates in both domain-specific settings, where there are knowledge bases and ontologies available to guide reading, and in multi-domain settings where such resources are absent. We demonstrate that this deep reading and search system reduces the effort needed to uncover “undiscovered public knowledge”, and that with the aid of this tool a domain expert was able to drastically reduce her model building time from months to two days.

UR - http://www.scopus.com/inward/record.url?scp=85054291342&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054291342&partnerID=8YFLogxK

U2 - 10.18653/v1/P17-4018

DO - 10.18653/v1/P17-4018

M3 - Conference contribution

SN - 9781945626715

SP - 103

EP - 108

BT - ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of System Demonstrations

PB - Association for Computational Linguistics (ACL)

ER -