Harnessing Historical Corrections to build Test Collections for Named Entity Disambiguation
Matching mentions of persons to the actual persons (the name disambiguation problem) is central for several digital library applications. Scientists have been working on algorithms to create this matching for decades without finding a universal solution. One problem is that test collections for this...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2018-08 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Reitz, Florian |
| description | Matching mentions of persons to the actual persons (the name disambiguation problem) is central for several digital library applications. Scientists have been working on algorithms to create this matching for decades without finding a universal solution. One problem is that test collections for this problem are often small and specific to a certain collection. In this work, we present an approach that can create large test collections from historical metadata with minimal extra cost. We apply this approach to the DBLP collection to generate two freely available test collections. One collection focuses on the properties of defects and one on the evaluation of disambiguation algorithms. |
| doi_str_mv | 10.48550/arxiv.1808.08999 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1808_08999</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2096260211</sourcerecordid><originalsourceid>FETCH-LOGICAL-a521-2daf1f35c0d021043db2edc39ad823c620c0cc88bfe4deda7364f4523ac906f53</originalsourceid><addsrcrecordid>eNo1kM1OwzAQhC0kJKrSB-CEJc4p63WcOkdUCkGq4NIbh8jxT-UqjYudIPr2pC2c5jCfdmeGkDsG81wKAY8q_vjvOZMg5yDLsrwiE-ScZTJHvCGzlHYAgMUCheAT8lmp2NmUfLellU99iF6rli5DjFb3PnSJ9oE2g28N3djUj07b_jsuRPqu9tbQVdf7_kiffVL7xm8HdQJuybVTbbKzP52Szctqs6yy9cfr2_JpnSmBLEOjHHNcaDCADHJuGrRG81IZiVwXCBq0lrJxNjfWqAUvcpcL5EqXUDjBp-T-cvbcvD5Ev1fxWJ8WqM8LjMTDhTjE8DWMLepdGGI3ZqoRygKL8THjv9eEX9k</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2096260211</pqid></control><display><type>article</type><title>Harnessing Historical Corrections to build Test Collections for Named Entity Disambiguation</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Reitz, Florian</creator><creatorcontrib>Reitz, Florian</creatorcontrib><description>Matching mentions of persons to the actual persons (the name disambiguation problem) is central for several digital library applications. Scientists have been working on algorithms to create this matching for decades without finding a universal solution. One problem is that test collections for this problem are often small and specific to a certain collection. In this work, we present an approach that can create large test collections from historical metadata with minimal extra cost. We apply this approach to the DBLP collection to generate two freely available test collections. One collection focuses on the properties of defects and one on the evaluation of disambiguation algorithms.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1808.08999</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Collection ; Computer Science - Digital Libraries ; Computer Science - Information Retrieval ; Digital systems ; Matching ; Supervision</subject><ispartof>arXiv.org, 2018-08</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1808.08999$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1007/978-3-030-00066-0_4$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Reitz, Florian</creatorcontrib><title>Harnessing Historical Corrections to build Test Collections for Named Entity Disambiguation</title><title>arXiv.org</title><description>Matching mentions of persons to the actual persons (the name disambiguation problem) is central for several digital library applications. Scientists have been working on algorithms to create this matching for decades without finding a universal solution. One problem is that test collections for this problem are often small and specific to a certain collection. In this work, we present an approach that can create large test collections from historical metadata with minimal extra cost. We apply this approach to the DBLP collection to generate two freely available test collections. One collection focuses on the properties of defects and one on the evaluation of disambiguation algorithms.</description><subject>Algorithms</subject><subject>Collection</subject><subject>Computer Science - Digital Libraries</subject><subject>Computer Science - Information Retrieval</subject><subject>Digital systems</subject><subject>Matching</subject><subject>Supervision</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNo1kM1OwzAQhC0kJKrSB-CEJc4p63WcOkdUCkGq4NIbh8jxT-UqjYudIPr2pC2c5jCfdmeGkDsG81wKAY8q_vjvOZMg5yDLsrwiE-ScZTJHvCGzlHYAgMUCheAT8lmp2NmUfLellU99iF6rli5DjFb3PnSJ9oE2g28N3djUj07b_jsuRPqu9tbQVdf7_kiffVL7xm8HdQJuybVTbbKzP52Szctqs6yy9cfr2_JpnSmBLEOjHHNcaDCADHJuGrRG81IZiVwXCBq0lrJxNjfWqAUvcpcL5EqXUDjBp-T-cvbcvD5Ev1fxWJ8WqM8LjMTDhTjE8DWMLepdGGI3ZqoRygKL8THjv9eEX9k</recordid><startdate>20180827</startdate><enddate>20180827</enddate><creator>Reitz, Florian</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20180827</creationdate><title>Harnessing Historical Corrections to build Test Collections for Named Entity Disambiguation</title><author>Reitz, Florian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a521-2daf1f35c0d021043db2edc39ad823c620c0cc88bfe4deda7364f4523ac906f53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Collection</topic><topic>Computer Science - Digital Libraries</topic><topic>Computer Science - Information Retrieval</topic><topic>Digital systems</topic><topic>Matching</topic><topic>Supervision</topic><toplevel>online_resources</toplevel><creatorcontrib>Reitz, Florian</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Reitz, Florian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Harnessing Historical Corrections to build Test Collections for Named Entity Disambiguation</atitle><jtitle>arXiv.org</jtitle><date>2018-08-27</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>Matching mentions of persons to the actual persons (the name disambiguation problem) is central for several digital library applications. Scientists have been working on algorithms to create this matching for decades without finding a universal solution. One problem is that test collections for this problem are often small and specific to a certain collection. In this work, we present an approach that can create large test collections from historical metadata with minimal extra cost. We apply this approach to the DBLP collection to generate two freely available test collections. One collection focuses on the properties of defects and one on the evaluation of disambiguation algorithms.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1808.08999</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2018-08 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1808_08999 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Collection Computer Science - Digital Libraries Computer Science - Information Retrieval Digital systems Matching Supervision |
| title | Harnessing Historical Corrections to build Test Collections for Named Entity Disambiguation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T19%3A13%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Harnessing%20Historical%20Corrections%20to%20build%20Test%20Collections%20for%20Named%20Entity%20Disambiguation&rft.jtitle=arXiv.org&rft.au=Reitz,%20Florian&rft.date=2018-08-27&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1808.08999&rft_dat=%3Cproquest_arxiv%3E2096260211%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2096260211&rft_id=info:pmid/&rfr_iscdi=true |