Random Forest for Dissimilarity-based Multi-view Learning
원문 초록
Many classification problems are naturally multi-view in the sense their data are described through multiple heterogeneous descriptions. For such tasks, dissimilarity strategies are effective ways to make the different descriptions comparable and to easily merge them, by (i) building intermediate dissimilarity representations for each view and (ii) fusing these representations by averaging the dissimilarities over the views. In this work, we show that the Random Forest proximity measure can be used to build the dissimilarity representations, since this measure reflects similarities between features but also class membership. We then propose a Dynamic View Selection method to better combine the view-specific dissimilarity representations. This allows to take a decision, on each instance to predict, with only the most relevant views for that instance. Experiments are conducted on several real-world multi-view datasets, and show that the Dynamic View Selection offers a significant improvement in performance compared to the simple average combination and two state-of-the-art static view combinations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Reliable Disentanglement Multi-view Learning Against View Adversarial Attacks
Multi-View Learning with Context-Guided Receptance for Image Denoising
Molecule Generation for Target Protein Binding with Hierarchical Consistency Diffusion Model
Balanced Multi-view Clustering
Missing Data as Augmentation in the Earth Observation Domain: A Multi-View Learning Approach
OpenViewer: Openness-Aware Multi-View Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.