Can We Find Documents in Web Archives without Knowing their Contents?

Recent advances of preservation technologies have led to an increasing number of Web archive systems and collections. These collections are valuable to explore the past of the Web, but their value can only be uncovered with effective access and exploration mechanisms. Ideal search and rank- ing meth...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2017-01
Hauptverfasser: Vo, Khoi Duy, Tran, Tuan, Nguyen, Tu Ngoc, Zhu, Xiaofei, Nejdl, Wolfgang
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 Vo, Khoi Duy
Tran, Tuan
Nguyen, Tu Ngoc
Zhu, Xiaofei
Nejdl, Wolfgang
description Recent advances of preservation technologies have led to an increasing number of Web archive systems and collections. These collections are valuable to explore the past of the Web, but their value can only be uncovered with effective access and exploration mechanisms. Ideal search and rank- ing methods must be robust to the high redundancy and the temporal noise of contents, as well as scalable to the huge amount of data archived. Despite several attempts in Web archive search, facilitating access to Web archive still remains a challenging problem. In this work, we conduct a first analysis on different ranking strategies that exploit evidences from metadata instead of the full content of documents. We perform a first study to compare the usefulness of non-content evidences to Web archive search, where the evidences are mined from the metadata of file headers, links and URL strings only. Based on these findings, we propose a simple yet surprisingly effective learning model that combines multiple evidences to distinguish "good" from "bad" search results. We conduct empirical experiments quantitatively as well as qualitatively to confirm the validity of our proposed method, as a first step towards better ranking in Web archives taking meta- data into account.
doi_str_mv 10.48550/arxiv.1701.03942
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1701_03942</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2074218393</sourcerecordid><originalsourceid>FETCH-LOGICAL-a523-af771ab476373028acc63d2cc34f08a6065abea805b33ff3d43eeb9d57d196003</originalsourceid><addsrcrecordid>eNotj1FLwzAUhYMgOOZ-gE8GfG69yU2a9ElG3aY48GXgY0nb1Ga4dKbtpv_edfPpwOHjcD5C7hjEQksJjyb8uEPMFLAYMBX8ikw4Iou04PyGzLpuCwA8UVxKnJBFZjz9sHTpfEWf23LYWd931I1lQeehbNzBdvTo-qYdevrm26Pzn7RvrAs0a30_4k-35Lo2X52d_eeUbJaLTfYSrd9Xr9l8HRnJMTK1UswUQiWoELg2ZZlgxcsSRQ3aJJBIU1ijQRaIdY2VQGuLtJKqYmkCgFNyf5k9O-b74HYm_Oaja352PREPF2If2u_Bdn2-bYfgT59yDkpwpjFF_AMnzlXF</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2074218393</pqid></control><display><type>article</type><title>Can We Find Documents in Web Archives without Knowing their Contents?</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Vo, Khoi Duy ; Tran, Tuan ; Nguyen, Tu Ngoc ; Zhu, Xiaofei ; Nejdl, Wolfgang</creator><creatorcontrib>Vo, Khoi Duy ; Tran, Tuan ; Nguyen, Tu Ngoc ; Zhu, Xiaofei ; Nejdl, Wolfgang</creatorcontrib><description>Recent advances of preservation technologies have led to an increasing number of Web archive systems and collections. These collections are valuable to explore the past of the Web, but their value can only be uncovered with effective access and exploration mechanisms. Ideal search and rank- ing methods must be robust to the high redundancy and the temporal noise of contents, as well as scalable to the huge amount of data archived. Despite several attempts in Web archive search, facilitating access to Web archive still remains a challenging problem. In this work, we conduct a first analysis on different ranking strategies that exploit evidences from metadata instead of the full content of documents. We perform a first study to compare the usefulness of non-content evidences to Web archive search, where the evidences are mined from the metadata of file headers, links and URL strings only. Based on these findings, we propose a simple yet surprisingly effective learning model that combines multiple evidences to distinguish "good" from "bad" search results. We conduct empirical experiments quantitatively as well as qualitatively to confirm the validity of our proposed method, as a first step towards better ranking in Web archives taking meta- data into account.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1701.03942</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Information Retrieval ; Digital archives ; Empirical analysis ; Headers ; Metadata ; Ranking ; Redundancy ; Searching ; Strings ; Web archiving</subject><ispartof>arXiv.org, 2017-01</ispartof><rights>2017. 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,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1701.03942$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1145/2908131.2908165$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Vo, Khoi Duy</creatorcontrib><creatorcontrib>Tran, Tuan</creatorcontrib><creatorcontrib>Nguyen, Tu Ngoc</creatorcontrib><creatorcontrib>Zhu, Xiaofei</creatorcontrib><creatorcontrib>Nejdl, Wolfgang</creatorcontrib><title>Can We Find Documents in Web Archives without Knowing their Contents?</title><title>arXiv.org</title><description>Recent advances of preservation technologies have led to an increasing number of Web archive systems and collections. These collections are valuable to explore the past of the Web, but their value can only be uncovered with effective access and exploration mechanisms. Ideal search and rank- ing methods must be robust to the high redundancy and the temporal noise of contents, as well as scalable to the huge amount of data archived. Despite several attempts in Web archive search, facilitating access to Web archive still remains a challenging problem. In this work, we conduct a first analysis on different ranking strategies that exploit evidences from metadata instead of the full content of documents. We perform a first study to compare the usefulness of non-content evidences to Web archive search, where the evidences are mined from the metadata of file headers, links and URL strings only. Based on these findings, we propose a simple yet surprisingly effective learning model that combines multiple evidences to distinguish "good" from "bad" search results. We conduct empirical experiments quantitatively as well as qualitatively to confirm the validity of our proposed method, as a first step towards better ranking in Web archives taking meta- data into account.</description><subject>Computer Science - Information Retrieval</subject><subject>Digital archives</subject><subject>Empirical analysis</subject><subject>Headers</subject><subject>Metadata</subject><subject>Ranking</subject><subject>Redundancy</subject><subject>Searching</subject><subject>Strings</subject><subject>Web archiving</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</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>eNotj1FLwzAUhYMgOOZ-gE8GfG69yU2a9ElG3aY48GXgY0nb1Ga4dKbtpv_edfPpwOHjcD5C7hjEQksJjyb8uEPMFLAYMBX8ikw4Iou04PyGzLpuCwA8UVxKnJBFZjz9sHTpfEWf23LYWd931I1lQeehbNzBdvTo-qYdevrm26Pzn7RvrAs0a30_4k-35Lo2X52d_eeUbJaLTfYSrd9Xr9l8HRnJMTK1UswUQiWoELg2ZZlgxcsSRQ3aJJBIU1ijQRaIdY2VQGuLtJKqYmkCgFNyf5k9O-b74HYm_Oaja352PREPF2If2u_Bdn2-bYfgT59yDkpwpjFF_AMnzlXF</recordid><startdate>20170114</startdate><enddate>20170114</enddate><creator>Vo, Khoi Duy</creator><creator>Tran, Tuan</creator><creator>Nguyen, Tu Ngoc</creator><creator>Zhu, Xiaofei</creator><creator>Nejdl, Wolfgang</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>20170114</creationdate><title>Can We Find Documents in Web Archives without Knowing their Contents?</title><author>Vo, Khoi Duy ; Tran, Tuan ; Nguyen, Tu Ngoc ; Zhu, Xiaofei ; Nejdl, Wolfgang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a523-af771ab476373028acc63d2cc34f08a6065abea805b33ff3d43eeb9d57d196003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Information Retrieval</topic><topic>Digital archives</topic><topic>Empirical analysis</topic><topic>Headers</topic><topic>Metadata</topic><topic>Ranking</topic><topic>Redundancy</topic><topic>Searching</topic><topic>Strings</topic><topic>Web archiving</topic><toplevel>online_resources</toplevel><creatorcontrib>Vo, Khoi Duy</creatorcontrib><creatorcontrib>Tran, Tuan</creatorcontrib><creatorcontrib>Nguyen, Tu Ngoc</creatorcontrib><creatorcontrib>Zhu, Xiaofei</creatorcontrib><creatorcontrib>Nejdl, Wolfgang</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; 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>Vo, Khoi Duy</au><au>Tran, Tuan</au><au>Nguyen, Tu Ngoc</au><au>Zhu, Xiaofei</au><au>Nejdl, Wolfgang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Can We Find Documents in Web Archives without Knowing their Contents?</atitle><jtitle>arXiv.org</jtitle><date>2017-01-14</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>Recent advances of preservation technologies have led to an increasing number of Web archive systems and collections. These collections are valuable to explore the past of the Web, but their value can only be uncovered with effective access and exploration mechanisms. Ideal search and rank- ing methods must be robust to the high redundancy and the temporal noise of contents, as well as scalable to the huge amount of data archived. Despite several attempts in Web archive search, facilitating access to Web archive still remains a challenging problem. In this work, we conduct a first analysis on different ranking strategies that exploit evidences from metadata instead of the full content of documents. We perform a first study to compare the usefulness of non-content evidences to Web archive search, where the evidences are mined from the metadata of file headers, links and URL strings only. Based on these findings, we propose a simple yet surprisingly effective learning model that combines multiple evidences to distinguish "good" from "bad" search results. We conduct empirical experiments quantitatively as well as qualitatively to confirm the validity of our proposed method, as a first step towards better ranking in Web archives taking meta- data into account.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1701.03942</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2017-01
issn 2331-8422
language eng
recordid cdi_arxiv_primary_1701_03942
source arXiv.org; Free E- Journals
subjects Computer Science - Information Retrieval
Digital archives
Empirical analysis
Headers
Metadata
Ranking
Redundancy
Searching
Strings
Web archiving
title Can We Find Documents in Web Archives without Knowing their Contents?
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T22%3A13%3A53IST&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=Can%20We%20Find%20Documents%20in%20Web%20Archives%20without%20Knowing%20their%20Contents?&rft.jtitle=arXiv.org&rft.au=Vo,%20Khoi%20Duy&rft.date=2017-01-14&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1701.03942&rft_dat=%3Cproquest_arxiv%3E2074218393%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=2074218393&rft_id=info:pmid/&rfr_iscdi=true