Learning with partially separable data
Not on the map. Why?
Abstract (arXiv)
There are partially separable data types that make classification tasks very hard. In other words, only parts of the data are informative meaning that looking at the rest of the data would not give any distinguishable hint for classification. In this situation, the typical assumption of having the whole labeled data as an informative unit set for classification does not work. Consequently, typical classification methods with the mentioned assumption fail in such a situation. In this study, we propose a framework for the classification of partially separable data types that are not classifiable using typical methods. An algorithm based on the framework is proposed that tries to detect separable subgroups of the data using an iterative clustering approach. Then the detected subgroups are used in the classification process. The proposed approach was tested on a real dataset for autism screening and showed its capability by distinguishing children with autism from normal ones, while the other methods failed to do so.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 32 references that are in the map. First posted on arXiv 11 Mar 2021.
Builds on
4 of 32 references.
References · 4
- 2020Contrastive Learning with Hard Negative Samplescited by 628
- 2016Multiple Instance Learning: A Survey of Problem Characteristics and Applicationscited by 164
- 2017Automatic segmentation of MR brain images with a convolutional neural networkcited by 26
- 2018Robust and Efficient Boosting Method using the Conditional Riskcited by 1
Built on by
Not cited yet.