Florian Beck
Research Subjects
Florian Beck has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Johannes Fürnkranz
Institute for Application-Oriented Knowledge Processing (FAW), Johannes Kepler University, 4040 Linz, Austria
7 shared publications - Van Quoc Phuong Huynh
Johannes Kepler University Linz
6 shared publications Johannes Fürnkranz
Institute for Application-Oriented Knowledge Processing (FAW), Johannes Kepler University, Linz, Austria
2 shared publications- Wolfgang Baumeister
Emeritus Group Molecular Structural Biology, Max Planck Institute of Biochemistry
2 shared publications A Kossel
Max-Planck-Institute of Biochemistry, Martinsried, Germany
1 shared publicationA Sartori
Max-Planck-Institute of Biochemistry, Martinsried, Germany
1 shared publication
Latest Publications
- 5 October 2025
- Published by Springer Nature
- p. 161-175
On the Potential of Deep Symbolic Models for Classification Problems
- 5 October 2025
- Published by Springer Nature
- p. 161-175
On the Potential of Deep Symbolic Models for Classification Problems
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 565-576
Partial Pre-Post Code Tree: A Memory-Efficient Tree Structure for Conjunctive Rule Mining
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 565-576
Open AccessPartial Pre-Post Code Tree: A Memory-Efficient Tree Structure for Conjunctive Rule Mining
- 28 January 2025
- Published by Springer Nature
- p. 50-64
Learning Deep Rule Concepts as Alternating Boolean Pattern Trees
- 28 January 2025
- Published by Springer Nature
- p. 50-64
Learning Deep Rule Concepts as Alternating Boolean Pattern Trees
- Open Access
- 21 August 2024
- Published by Springer Nature in Nature
- Vol. 633 (8029) , 459-464
Visualizing chaperonin function in situ by cryo-electron tomography
Chaperonins are large barrel-shaped complexes that mediate ATP-dependent protein folding1–3. The bacterial chaperonin GroEL forms juxtaposed rings that bind unfolded protein and the lid-shaped cofactor GroES at their apertures. In vitro analyses of the chaperonin reaction have shown that substrate protein folds, unimpaired by aggregation, while transiently encapsulated in the GroEL central cavity by GroES4–6. To determine the functional stoichiometry of GroEL, GroES and client protein in situ, here we visualized chaperonin complexes in their natural cellular environment using cryo-electron tomography. We find that, under various growth conditions, around 55–70% of GroEL binds GroES asymmetrically on one ring, with the remainder populating symmetrical complexes. Bound substrate protein is detected on the free ring of the asymmetrical complex, defining the substrate acceptor state. In situ analysis of GroEL–GroES chambers, validated by high-resolution structures obtained in vitro, showed the presence of encapsulated substrate protein in a folded state before release into the cytosol. Based on a comprehensive quantification and conformational analysis of chaperonin complexes, we propose a GroEL–GroES reaction cycle that consists of linked asymmetrical and symmetrical subreactions mediating protein folding. Our findings illuminate the native conformational and functional chaperonin cycle directly within cells.
- 21 August 2024
- Published by Springer Nature in Nature
- Vol. 633 (8029) , 459-464
Open AccessVisualizing chaperonin function in situ by cryo-electron tomography
Chaperonins are large barrel-shaped complexes that mediate ATP-dependent protein folding1–3. The bacterial chaperonin GroEL forms juxtaposed rings that bind unfolded protein and the lid-shaped cofactor GroES at their apertures. In vitro analyses of the chaperonin reaction have shown that substrate protein folds, unimpaired by aggregation, while transiently encapsulated in the GroEL central cavity by GroES4–6. To determine the functional stoichiometry of GroEL, GroES and client protein in situ, here we visualized chaperonin complexes in their natural cellular environment using cryo-electron tomography. We find that, under various growth conditions, around 55–70% of GroEL binds GroES asymmetrically on one ring, with the remainder populating symmetrical complexes. Bound substrate protein is detected on the free ring of the asymmetrical complex, defining the substrate acceptor state. In situ analysis of GroEL–GroES chambers, validated by high-resolution structures obtained in vitro, showed the presence of encapsulated substrate protein in a folded state before release into the cytosol. Based on a comprehensive quantification and conformational analysis of chaperonin complexes, we propose a GroEL–GroES reaction cycle that consists of linked asymmetrical and symmetrical subreactions mediating protein folding. Our findings illuminate the native conformational and functional chaperonin cycle directly within cells.
- 15 October 2023
- Published by Springer Nature
- p. 95-109
Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets
- 15 October 2023
- Published by Springer Nature
- p. 95-109
Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets
- Open Access
- 23 January 2023
- Published by Springer Nature in Machine Learning
- Vol. 112 (2) , 571-610
Efficient learning of large sets of locally optimal classification rules
Conventional rule learning algorithms aim at finding a set of simple rules, where each rule covers as many examples as possible. In this paper, we argue that the rules found in this way may not be the optimal explanations for each of the examples they cover. Instead, we propose an efficient algorithm that aims at finding the best rule covering each training example in a greedy optimization consisting of one specialization and one generalization loop. These locally optimal rules are collected and then filtered for a final rule set, which is much larger than the sets learned by conventional rule learning algorithms. A new example is classified by selecting the best among the rules that cover this example. In our experiments on small to very large datasets, the approach’s average classification accuracy is higher than that of state-of-the-art rule learning algorithms. Moreover, the algorithm is highly efficient and can inherently be processed in parallel without affecting the learned rule set and so the classification accuracy. We thus believe that it closes an important gap for large-scale classification rule induction.
- 23 January 2023
- Published by Springer Nature in Machine Learning
- Vol. 112 (2) , 571-610
Open AccessEfficient learning of large sets of locally optimal classification rules
Conventional rule learning algorithms aim at finding a set of simple rules, where each rule covers as many examples as possible. In this paper, we argue that the rules found in this way may not be the optimal explanations for each of the examples they cover. Instead, we propose an efficient algorithm that aims at finding the best rule covering each training example in a greedy optimization consisting of one specialization and one generalization loop. These locally optimal rules are collected and then filtered for a final rule set, which is much larger than the sets learned by conventional rule learning algorithms. A new example is classified by selecting the best among the rules that cover this example. In our experiments on small to very large datasets, the approach’s average classification accuracy is higher than that of state-of-the-art rule learning algorithms. Moreover, the algorithm is highly efficient and can inherently be processed in parallel without affecting the learned rule set and so the classification accuracy. We thus believe that it closes an important gap for large-scale classification rule induction.
- 6 November 2022
- Published by Springer Nature
- p. 104-113
Incremental Update of Locally Optimal Classification Rules
- 6 November 2022
- Published by Springer Nature
- p. 104-113
Incremental Update of Locally Optimal Classification Rules
- Open Access
- 22 October 2021
- Published by Frontiers Media SA in Frontiers in Artificial Intelligence
- Vol. 4
An Empirical Investigation Into Deep and Shallow Rule Learning
Inductive rule learning is arguably among the most traditional paradigms in machine learning. Although we have seen considerable progress over the years in learning rule-based theories, all state-of-the-art learners still learn descriptions that directly relate the input features to the target concept. In the simplest case, concept learning, this is a disjunctive normal form (DNF) description of the positive class. While it is clear that this is sufficient from a logical point of view because every logical expression can be reduced to an equivalent DNF expression, it could nevertheless be the case that more structured representations, which form deep theories by forming intermediate concepts, could be easier to learn, in very much the same way as deep neural networks are able to outperform shallow networks, even though the latter are also universal function approximators. However, there are several non-trivial obstacles that need to be overcome before a sufficiently powerful deep rule learning algorithm could be developed and be compared to the state-of-the-art in inductive rule learning. In this paper, we therefore take a different approach: we empirically compare deep and shallow rule sets that have been optimized with a uniform general mini-batch based optimization algorithm. In our experiments on both artificial and real-world benchmark data, deep rule networks outperformed their shallow counterparts, which we take as an indication that it is worth-while to devote more efforts to learning deep rule structures from data.
- 22 October 2021
- Published by Frontiers Media SA in Frontiers in Artificial Intelligence
- Vol. 4
Open AccessAn Empirical Investigation Into Deep and Shallow Rule Learning
Inductive rule learning is arguably among the most traditional paradigms in machine learning. Although we have seen considerable progress over the years in learning rule-based theories, all state-of-the-art learners still learn descriptions that directly relate the input features to the target concept. In the simplest case, concept learning, this is a disjunctive normal form (DNF) description of the positive class. While it is clear that this is sufficient from a logical point of view because every logical expression can be reduced to an equivalent DNF expression, it could nevertheless be the case that more structured representations, which form deep theories by forming intermediate concepts, could be easier to learn, in very much the same way as deep neural networks are able to outperform shallow networks, even though the latter are also universal function approximators. However, there are several non-trivial obstacles that need to be overcome before a sufficiently powerful deep rule learning algorithm could be developed and be compared to the state-of-the-art in inductive rule learning. In this paper, we therefore take a different approach: we empirically compare deep and shallow rule sets that have been optimized with a uniform general mini-batch based optimization algorithm. In our experiments on both artificial and real-world benchmark data, deep rule networks outperformed their shallow counterparts, which we take as an indication that it is worth-while to devote more efforts to learning deep rule structures from data.
- Open Access
An Investigation into Mini-Batch Rule Learning
We investigate whether it is possible to learn rule sets efficiently in a network structure with a single hidden layer using iterative refinements over mini-batches of examples. A first rudimentary version shows an acceptable performance on all but one dataset, even though it does not yet reach the performance levels of Ripper.
Open AccessAn Investigation into Mini-Batch Rule Learning
We investigate whether it is possible to learn rule sets efficiently in a network structure with a single hidden layer using iterative refinements over mini-batches of examples. A first rudimentary version shows an acceptable performance on all but one dataset, even though it does not yet reach the performance levels of Ripper.
- 1 January 2021
- Published by Springer Nature
- p. 48-61
Structuring Rule Sets Using Binary Decision Diagrams
- 1 January 2021
- Published by Springer Nature
- p. 48-61
Structuring Rule Sets Using Binary Decision Diagrams