From tree to network: reordering an archival catalogue

IF 0.8 Q3 INFORMATION SCIENCE & LIBRARY SCIENCE
M. Bell
{"title":"From tree to network: reordering an archival catalogue","authors":"M. Bell","doi":"10.1108/rmj-09-2019-0051","DOIUrl":null,"url":null,"abstract":"This paper presents the results of a number of experiments performed at the National Archives, all related to the theme of linking collections of records. This paper aims to present a methodology for translating a hierarchy into a network structure using a number of methods for deriving statistical distributions from records metadata or content and then aggregating them. Simple similarity metrics are then used to compare and link, collections of records with similar characteristics.,The approach taken is to consider a record at any level of the catalogue hierarchy as a summary of its children. A distribution for each child record is created (e.g. word counts and date distribution) and averaged/summed with the other children. This process is repeated up the hierarchy to find a representative distribution of the whole series. By doing this the authors can compare record series together and create a similarity network.,The summarising method was found to be applicable not only to a hierarchical catalogue but also to web archive data, which is by nature stored in a hierarchical folder structure. The case studies raised many questions worthy of further exploration such as how to present distributions and uncertainty to users and how to compare methods, which produce similarity scores on different scales.,Although the techniques used to create distributions such as topic modelling and word frequency counts, are not new and have been used to compare documents, to the best of the knowledge applying the averaging approach to the archival catalogue is new. This provides an interesting method for zooming in and out of a collection, creating networks at different levels of granularity according to user needs.","PeriodicalId":20923,"journal":{"name":"Records Management Journal","volume":"30 1","pages":"379-394"},"PeriodicalIF":0.8000,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/rmj-09-2019-0051","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Records Management Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/rmj-09-2019-0051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"INFORMATION SCIENCE & LIBRARY SCIENCE","Score":null,"Total":0}
引用次数: 8

Abstract

This paper presents the results of a number of experiments performed at the National Archives, all related to the theme of linking collections of records. This paper aims to present a methodology for translating a hierarchy into a network structure using a number of methods for deriving statistical distributions from records metadata or content and then aggregating them. Simple similarity metrics are then used to compare and link, collections of records with similar characteristics.,The approach taken is to consider a record at any level of the catalogue hierarchy as a summary of its children. A distribution for each child record is created (e.g. word counts and date distribution) and averaged/summed with the other children. This process is repeated up the hierarchy to find a representative distribution of the whole series. By doing this the authors can compare record series together and create a similarity network.,The summarising method was found to be applicable not only to a hierarchical catalogue but also to web archive data, which is by nature stored in a hierarchical folder structure. The case studies raised many questions worthy of further exploration such as how to present distributions and uncertainty to users and how to compare methods, which produce similarity scores on different scales.,Although the techniques used to create distributions such as topic modelling and word frequency counts, are not new and have been used to compare documents, to the best of the knowledge applying the averaging approach to the archival catalogue is new. This provides an interesting method for zooming in and out of a collection, creating networks at different levels of granularity according to user needs.
从树到网络:重新排序档案目录
本文介绍了在国家档案馆进行的一系列实验的结果,所有这些实验都与连接记录收藏的主题有关。本文旨在介绍一种将层次结构转换为网络结构的方法,该方法使用多种方法从记录元数据或内容中获得统计分布,然后将其聚合。然后使用简单的相似性度量来比较和链接具有相似特征的记录集合。所采取的方法是将目录层次结构的任何级别的记录视为其子记录的摘要。为每个子记录创建一个分布(例如单词计数和日期分布),并与其他子记录求平均值/求和。这个过程在层次结构中重复,以找到整个系列的代表性分布。通过这样做,作者可以比较记录系列并创建一个相似网络。摘要方法不仅适用于分层目录,也适用于本质上存储在分层文件夹结构中的web归档数据。案例研究提出了许多值得进一步探索的问题,例如如何向用户呈现分布和不确定性,以及如何比较不同尺度上产生相似分数的方法。虽然用于创建分布(如主题建模和词频计数)的技术并不新鲜,并且已被用于比较文件,但据我所知,将平均方法应用于档案目录是新的。这提供了一种有趣的方法来放大和缩小集合,根据用户需要创建不同粒度级别的网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Records Management Journal
Records Management Journal INFORMATION SCIENCE & LIBRARY SCIENCE-
CiteScore
3.50
自引率
7.10%
发文量
11
期刊介绍: ■Electronic records management ■Effect of government policies on record management ■Strategic developments in both the public and private sectors ■Systems design and implementation ■Models for records management ■Best practice, standards and guidelines ■Risk management and business continuity ■Performance measurement ■Continuing professional development ■Consortia and co-operation ■Marketing ■Preservation ■Legal and ethical issues
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信