Skip to main content

Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets

  • Conference paper
  • First Online:
Rules and Reasoning (RuleML+RR 2023)

Abstract

Conventional rule learning algorithms learn a description of the positive class in disjunctive normal form (DNF). Alternatively, there are also a few learners who can formulate their model in conjunctive normal form (CNF) instead. While it is clear that both representations are equally expressive, there are domains where DNF learners perform better and others where CNF learners perform better. Thus, an algorithm that can dynamically make use of the best of both worlds is certainly desirable. In this paper, we propose the algorithm Cord that can learn general logical functions by training alternating layers of conjunctive and disjunctive rule sets, using any conventional rule learner. In each layer, the conjunctions/disjunctions trained in the previous layer are used as input features for learning a CNF/DNF expression that forms the next layer. In our experiments on real-world benchmark data, Cord outperformed both state-of-the-art CNF and DNF learners, where the best final performance was typically achieved using a high number of intermediate, general concepts in early layers that were refined in later layers, underlining the importance of more flexible and deeper concept representations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    As a sanity check, we also validated the Ripper accuracies on a random sample of the data sets.

  2. 2.

    The yeast data set was omitted due to too long calculation time over all combinations.

References

  1. Angluin, D., Laird, P.: Learning from noisy examples. Mach. Learn. 2(4), 343–370 (1988)

    Article  Google Scholar 

  2. Bengio, Y., Lamblin, P., Popovici, D., Larochelle, H.: Greedy layer-wise training of deep networks. In: Schölkopf, B., Platt, J.C., Hofmann, T. (eds.) Advances in Neural Information Processing Systems 19 (NeurIPS), pp. 153–160. MIT Press, Vancouver, British Columbia, Canada (2006)

    Google Scholar 

  3. De Raedt, L., Bruynooghe, M.: A theory of clausal discovery. In: Bajcsy, R. (ed.) Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), pp. 1058–1063, Morgan Kaufmann, Chambéry, France (1993)

    Google Scholar 

  4. De Raedt, L., Dehaspe, L.: Clausal discovery. machine learning 26(2/3), 99–146 (1997). special Issue on Inductive Logic Programming

    Google Scholar 

  5. Dries, A., De Raedt, L., Nijssen, S.: Mining predictive k-CNF expressions. IEEE Trans. Knowl. Data Eng. 22(5), 743–748 (2009)

    Article  Google Scholar 

  6. Fürnkranz, J.: Separate-and-conquer rule learning. Artif. Intell. Rev. 13(1), 3–54 (1999)

    Article  MATH  Google Scholar 

  7. Fürnkranz, J., Flach, P.A.: ROC ’n’ rule learning – towards a better understanding of covering algorithms. Mach. Learn. 58(1), 39–77 (2005)

    Google Scholar 

  8. Fürnkranz, J., Gamberger, D., Lavrač, N.: Foundations of rule learning. Springer, Berlin (2012), ISBN 978-3-540-75196-0, https://doi.org/10.1007/978-3-540-75197-7

  9. Holte, R.C.: Very simple classification rules perform well on most commonly used datasets. Mach. Learn. 11, 63–91 (1993)

    Article  MATH  Google Scholar 

  10. Huynh, V.Q.P., Fürnkranz, J., Beck, F.: Efficient learning of large sets of locally optimal classification rules. Mach. Learn. (2023). ISSN 1573–0565, https://doi.org/10.1007/s10994-022-06290-w

  11. Kearns, M.J., Li, M., Pitt, L., Valiant, L.G.: On the learnability of Boolean formulae. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 285–295, ACM, New York, USA (1987)

    Google Scholar 

  12. Michalski, R.S.: A theory and methodology of inductive learning. Artif. Intell. 20(2), 111–162 (1983)

    Article  MathSciNet  Google Scholar 

  13. Miltersen, P.B., Radhakrishnan, J., Wegener, I.: On converting CNF to DNF. Theoret. Comput. Sci. 347(1–2), 325–335 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mooney, R.J.: Encouraging experimental results on learning CNF. Mach. Learn. 19, 79–92 (1995)

    Article  Google Scholar 

  15. Quinlan, J.R.: Learning logical definitions from relations. Mach. Learn. 5, 239–266 (1990)

    Article  Google Scholar 

  16. Valiant, L.G.: A theory of the learnable. Commun. ACM 27, 1134–1142 (1984)

    Article  MATH  Google Scholar 

  17. Valiant, L.G.: Learning disjunction of conjunctions. In: Joshi, A.K. (ed.) Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI), pp. 560–566, Morgan Kaufmann, Los Angeles, CA, USA (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florian Beck .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Beck, F., Fürnkranz, J., Huynh, V.Q.P. (2023). Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets. In: Fensel, A., Ozaki, A., Roman, D., Soylu, A. (eds) Rules and Reasoning. RuleML+RR 2023. Lecture Notes in Computer Science, vol 14244. Springer, Cham. https://doi.org/10.1007/978-3-031-45072-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45072-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45071-6

  • Online ISBN: 978-3-031-45072-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics