Abstract
A simple search problem is studied in which a binary n-tuple is to be found in a list, by sequential bit comparisons with cost. The problem can be solved (for small n) using dynamic programming. We show how the “bottom up” part of the algorithm can be organized by means of Formal Concept Analysis.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Data Availability
No empirical datasets were generated or analysed during the current study.
References
Albano, A., Chornomaz, B.: Why concept lattices are large: extremal theory for generators, concepts, and vc-dimension. Int. J. Gen. Syst. 46(5), 440–457 (2017)
Bellman, R.: The theory of dynamic programming. Bull. Am. Math. Soc. 60(6), 503–515 (1954)
Ganter, B., Obiedkov, S.: Conceptual exploration. Springer (2016)
Ganter, B., Wille, R.: Formal concept analysis mathematical foundations. Springer (1999)
Kipke, U, Wille, R: Begriffsverbände als ablaufschemata zur Gegenstandsbestimmung. In: Die klassifikation und ihr umfeld, pp. 164–170. Gesellschaft für Klassifikation e.V. (1986)
Selinger, P.G, Astrahan, M.M, Chamberlin, D.D, Lorie, R.A, Price, T.G: Access path selection in a relational database management system. In: Readings in artificial intelligence and databases, pp. 511–522. elsevier (1989)
Triantaphyllou, E.: Multi-criteria decision making methods. Springer, US Boston MA (2000)
Acknowledgements
The author thanks the reviewers for their careful reading and helpful comments.
Funding
Open Access funding enabled and organized by Projekt DEAL. No funding or other support was received.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Interests
The author has no relevant financial or non-financial interests to disclose.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Ganter, B. Cost-aware sequential diagnostics. Ann Math Artif Intell 92, 59–75 (2024). https://doi.org/10.1007/s10472-022-09826-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-022-09826-x