Mammographic Breast Density Model Using Semi-Supervised Learning Reduces Inter-/Intra-Reader Variability

نویسندگان

چکیده

Breast density is an important risk factor for breast cancer development; however, imager inconsistency in reporting can lead to patient and clinician confusion. A deep learning (DL) model mammographic grading was examined a retrospective multi-reader multi-case study consisting of 928 image pairs assessed impact on inter- intra-reader variability reading time. Seven readers assigned categories the images, then re-read test set aided by after 4-week washout. To measure agreement, 100 were blindly double read both sessions. Linear Cohen Kappa (κ) Student’s t-test used assess reader performance. The achieved κ 0.87 (95% CI: 0.84, 0.89) four-class assessment 0.91 0.88, 0.93) binary non-dense/dense assessment. Superiority tests showed significant reduction inter-reader (κ improved from 0.70 p ≤ 0.001) 0.83 0.95, 0.01) density, 0.77 0.96, 0.89 0.97, when DL. average mean time per pair also decreased 30%, 0.86 s 0.01, 1.71), with six seven having reductions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

To asses inter- and intra-observer variability for breast density and BIRADS assessment categories in mammographic reporting.

OBJECTIVE To evaluate the inter- and intra-observer variability among radiologists in the characterisation of mammograms according to Breast Imaging Reporting and Data System assessment and breast density categories. METHODS The descriptive cross-sectional study was conducted at Aga Khan University Hospital, Karachi, from January 2014 to June 2014. Using non-probability purposive sampling, al...

متن کامل

Semi-supervised Learning with Density Based Distances

We present a simple, yet effective, approach to Semi-Supervised Learning. Our approach is based on estimating density-based distances (DBD) using a shortest path calculation on a graph. These Graph-DBD estimates can then be used in any distancebased supervised learning method, such as Nearest Neighbor methods and SVMs with RBF kernels. In order to apply the method to very large data sets, we al...

متن کامل

Semi-Supervised Learning Using Kernel Spectral Clustering Core Model

A multi-class semi-supervised learning algorithm formulated as a regularized kernel spectral clustering (KSC) approach is proposed. The method is bale to address both semi-supervised classification and clustering. In addition a low embedding dimension is utilized to reveal the existing number of clusters. Thanks to the Nyström approximation technique, the approach can be scaled up for analyzing...

متن کامل

Semi-Supervised Metric Learning Using Pairwise Constraints

Distance metric has an important role in many machine learning algorithms. Recently, metric learning for semi-supervised algorithms has received much attention. For semi-supervised clustering, usually a set of pairwise similarity and dissimilarity constraints is provided as supervisory information. Until now, various metric learning methods utilizing pairwise constraints have been proposed. The...

متن کامل

Active Semi-Supervised Learning using Submodular Functions

We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary symmetric submodular function. Arbitrary non-symmetric submodular functions can be used via symmetrization. Different choices of submodular functions give diff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Diagnostics

سال: 2023

ISSN: ['2075-4418']

DOI: https://doi.org/10.3390/diagnostics13162694