Dynamic voting in multi-view learning for radiomics applications
Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin

TL;DR
This paper introduces a dynamic voting scheme based on random forests for multi-view learning in radiomics, improving personalized cancer diagnosis by effectively combining multiple imaging views for each patient.
Contribution
It proposes a novel dynamic weighted voting method using random forests to enhance multi-view learning personalization in radiomics applications.
Findings
Improves classification accuracy in radiomics tasks.
Personalizes view combination for each patient.
Validated on multiple real-world datasets.
Abstract
Cancer diagnosis and treatment often require a personalized analysis for each patient nowadays, due to the heterogeneity among the different types of tumor and among patients. Radiomics is a recent medical imaging field that has shown during the past few years to be promising for achieving this personalization. However, a recent study shows that most of the state-of-the-art works in Radiomics fail to identify this problem as a multi-view learning task and that multi-view learning techniques are generally more efficient. In this work, we propose to further investigate the potential of one family of multi-view learning methods based on Multiple Classifiers Systems where one classifier is learnt on each view and all classifiers are combined afterwards. In particular, we propose a random forest based dynamic weighted voting scheme, which personalizes the combination of views for each new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRadiomics and Machine Learning in Medical Imaging · AI in cancer detection · MRI in cancer diagnosis
