TY - JOUR A1 - Lausser, Ludwig A1 - Schäfer, Lisa M. A1 - Werle, Silke D. A1 - Kestler, Angelika M. R. A1 - Kestler, Hans A. T1 - Detecting Ordinal Subcascades JF - Neural Processing Letters N2 - Ordinal classifier cascades are constrained by a hypothesised order of the semantic class labels of a dataset. This order determines the overall structure of the decision regions in feature space. Assuming the correct order on these class labels will allow a high generalisation performance, while an incorrect one will lead to diminished results. In this way ordinal classifier systems can facilitate explorative data analysis allowing to screen for potential candidate orders of the class labels. Previously, we have shown that screening is possible for total orders of all class labels. However, as datasets might comprise samples of ordinal as well as non-ordinal classes, the assumption of a total ordering might be not appropriate. An analysis of subsets of classes is required to detect such hidden ordinal substructures. In this work, we devise a novel screening procedure for exhaustive evaluations of all order permutations of all subsets of classes by bounding the number of enumerations we have to examine. Experiments with multi-class data from diverse applications revealed ordinal substructures that generate new and support known relations. UR - https://doi.org/10.1007/s11063-020-10362-0 KW - ordinal classification KW - classifier cascades KW - error bounds KW - subsets KW - supersets Y1 - 2020 UR - https://doi.org/10.1007/s11063-020-10362-0 UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:573-27555 SN - 1573-773X SN - 1370-4621 VL - 52 IS - 3 SP - 2583 EP - 2605 PB - Springer Science+Business Media CY - Dordrecht ER - TY - JOUR A1 - Lausser, Ludwig A1 - Schäfer, Lisa M. A1 - Kestler, Hans A. T1 - Ordinal Classifiers Can Fail on Repetitive Class Structures JF - Archives of Data Science, Series A N2 - Ordinal classifiers are constrained classification algorithms that assume a predefined (total) order of the class labels to be reflected in the feature space of a dataset. This information is used to guide the training of ordinal classifiers and might lead to an improved classification performance. Incorrect assumptions on the order of a dataset can result in diminished detection rates. Ordinal classifiers can, therefore, be used to screen for ordinal class structures within a feature representation. While it was shown that algorithms could in principle reject incorrect class orderings, it is unclear if all remaining candidate orders reflect real ordinal structures in feature space. In this work we characterize the decision regions induced by ordinal classifiers. We show that they can fulfill different criteria that might be considered as ordinal reflections. These criteria are mainly determined by the connectedness and the neighborhood of the decision regions. We evaluate them for ordinal classifier cascades constructed from binary classifiers. We show that depending on the type of base classifier they bear the risk of not rejecting non ordinal, like partial repetitive, structures. UR - https://doi.org/10.5445/KSP/1000085951/25 Y1 - 2018 UR - https://doi.org/10.5445/KSP/1000085951/25 UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:573-27335 SN - 2363-9881 VL - 4 (2018) IS - 1 PB - KIT Scientific Publishing CY - Karlsruhe ER - TY - JOUR A1 - Lausser, Ludwig A1 - Schäfer, Lisa M. A1 - Schirra, Lyn-Rouven A1 - Szekely, Robin A1 - Schmid, Florian A1 - Kestler, Hans A. T1 - Assessing phenotype order in molecular data JF - Scientific Reports N2 - Biological entities are key elements of biomedical research. Their definition and their relationships are important in areas such as phylogenetic reconstruction, developmental processes or tumor evolution. Hypotheses about relationships like phenotype order are often postulated based on prior knowledge or belief. Evidence on a molecular level is typically unknown and whether total orders are reflected in the molecular measurements is unclear or not assessed. In this work we propose a method that allows a fast and exhaustive screening for total orders in large datasets. We utilise ordinal classifier cascades to identify discriminable molecular representations of the phenotypes. These classifiers are constrained by an order hypothesis and are highly sensitive to incorrect assumptions. Two new error bounds, which are introduced and theoretically proven, lead to a substantial speed-up and allow the application to large collections of many phenotypes. In our experiments we show that by exhaustively evaluating all possible candidate orders, we are able to identify phenotype orders that best coincide with the high-dimensional molecular profiles. UR - https://doi.org/10.1038/s41598-019-48150-z KW - machine learning KW - systems biology Y1 - 2019 UR - https://doi.org/10.1038/s41598-019-48150-z UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:573-27353 SN - 2045-2322 VL - 9 PB - Springer Nature CY - London ER -