Automatic (near-) duplicate content document detection in a cancer registry

IF 3.7 2区 医学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Medical Informatics Pub Date : 2025-01-18 DOI:10.1016/j.ijmedinf.2025.105799
Tapio Niemi, Jean Pierre Ghobril, Gautier Defossez, Simon Germann, Eloïse Martin, Jean-Luc Bulliard
{"title":"Automatic (near-) duplicate content document detection in a cancer registry","authors":"Tapio Niemi,&nbsp;Jean Pierre Ghobril,&nbsp;Gautier Defossez,&nbsp;Simon Germann,&nbsp;Eloïse Martin,&nbsp;Jean-Luc Bulliard","doi":"10.1016/j.ijmedinf.2025.105799","DOIUrl":null,"url":null,"abstract":"<div><h3>Background</h3><div>Duplicate and near-duplicate medical documents are problematic in document management, clinical use, and medical research. In this study, we focus on multisourced medical documents in the context of a population-based cancer registry in Switzerland. Although the data collection process is well-regulated, the volume of transmitted documents steadily increases and the presence of full or near-duplicates slows down and complicates document processing. Identifying near-duplicates is particularly challenging because the large number of documents makes pairwise comparison non-feasible.</div></div><div><h3>Methods</h3><div>We implemented a system based on both normal hash functions, Simhash (Locality Sensitive Hashing), and Smith-Waterman text alignment similarity. Simhash offers good performance and confirming its results by the Smith-Waterman algorithm with a selected similarity threshold reduces the false positive rate to near zero without lowering sensitivity. Extracted differences in near-duplicate content documents are shown by highlighting differences in original PDF documents.</div><div>We validated the method using 3042 manually verified document pairs containing 1252 full-duplicate and 398 near-duplicate pairs. The area under the curve (AUC) was 0.96, sensitivity 0.92, specificity 1.00, PPV 1.00, and NPV 0.91. For the same size simulated data, corresponding values were 0.86, 0.72, 1.00, 1.00, and 0.77, respectively.</div></div><div><h3>Results</h3><div>We applied the method against 224,398 medical documents in the cancer registry. We found 5.5% of duplicates on the text level, and 0.17–0.24% near-duplicates depending on the used parameters and threshold values. Most near-duplicates related to the same patient and originated from the same transmitter. Manual evaluation showed that only 2% of differences were in medical contents and 83% in administrative data (21% in patient, 11% in doctor, and 51% in other administrative data). Many near-duplicates looked strikingly similar from a human perspective.</div></div><div><h3>Conclusions</h3><div>We demonstrated that our method can efficiently find all full-duplicates and most near-duplicates in a large set of multisourced medical documents. Potential ways to further improve this method are discussed. The method can be applied to documents in all domains.</div></div>","PeriodicalId":54950,"journal":{"name":"International Journal of Medical Informatics","volume":"195 ","pages":"Article 105799"},"PeriodicalIF":3.7000,"publicationDate":"2025-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Medical Informatics","FirstCategoryId":"3","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1386505625000164","RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Background

Duplicate and near-duplicate medical documents are problematic in document management, clinical use, and medical research. In this study, we focus on multisourced medical documents in the context of a population-based cancer registry in Switzerland. Although the data collection process is well-regulated, the volume of transmitted documents steadily increases and the presence of full or near-duplicates slows down and complicates document processing. Identifying near-duplicates is particularly challenging because the large number of documents makes pairwise comparison non-feasible.

Methods

We implemented a system based on both normal hash functions, Simhash (Locality Sensitive Hashing), and Smith-Waterman text alignment similarity. Simhash offers good performance and confirming its results by the Smith-Waterman algorithm with a selected similarity threshold reduces the false positive rate to near zero without lowering sensitivity. Extracted differences in near-duplicate content documents are shown by highlighting differences in original PDF documents.
We validated the method using 3042 manually verified document pairs containing 1252 full-duplicate and 398 near-duplicate pairs. The area under the curve (AUC) was 0.96, sensitivity 0.92, specificity 1.00, PPV 1.00, and NPV 0.91. For the same size simulated data, corresponding values were 0.86, 0.72, 1.00, 1.00, and 0.77, respectively.

Results

We applied the method against 224,398 medical documents in the cancer registry. We found 5.5% of duplicates on the text level, and 0.17–0.24% near-duplicates depending on the used parameters and threshold values. Most near-duplicates related to the same patient and originated from the same transmitter. Manual evaluation showed that only 2% of differences were in medical contents and 83% in administrative data (21% in patient, 11% in doctor, and 51% in other administrative data). Many near-duplicates looked strikingly similar from a human perspective.

Conclusions

We demonstrated that our method can efficiently find all full-duplicates and most near-duplicates in a large set of multisourced medical documents. Potential ways to further improve this method are discussed. The method can be applied to documents in all domains.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Medical Informatics
International Journal of Medical Informatics 医学-计算机:信息系统
CiteScore
8.90
自引率
4.10%
发文量
217
审稿时长
42 days
期刊介绍: International Journal of Medical Informatics provides an international medium for dissemination of original results and interpretative reviews concerning the field of medical informatics. The Journal emphasizes the evaluation of systems in healthcare settings. The scope of journal covers: Information systems, including national or international registration systems, hospital information systems, departmental and/or physician''s office systems, document handling systems, electronic medical record systems, standardization, systems integration etc.; Computer-aided medical decision support systems using heuristic, algorithmic and/or statistical methods as exemplified in decision theory, protocol development, artificial intelligence, etc. Educational computer based programs pertaining to medical informatics or medicine in general; Organizational, economic, social, clinical impact, ethical and cost-benefit aspects of IT applications in health care.
期刊最新文献
Machine learning for predicting outcomes of transcatheter aortic valve implantation: A systematic review AI-driven triage in emergency departments: A review of benefits, challenges, and future directions Predicting cancer survival at different stages: Insights from fair and explainable machine learning approaches The fading structural prominence of explanations in clinical studies Utilization, challenges, and training needs of digital health technologies: Perspectives from healthcare professionals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1