Cost-aware sequential diagnostics

被引：0

作者：

Ganter, Bernhard ^{[1
]}

机构：

[1] Tech Univ Dresden, Dresden, Germany

来源：

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 2024年 / 92卷 / 01期

关键词：

Binary search; Dynamic program; Formal concept analysis;

D O I：

10.1007/s10472-022-09826-x

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：59 / 75

页数：17

共 7 条

[1] Why concept lattices are large: extremal theory for generators, concepts, and VC-dimension [J].

Albano, Alexandre ;

Chornomaz, Bogdan .

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2017, 46 (05) :440-457

[2]

[Anonymous], 1989, Readings in Artificial Intelligence and Databases, DOI DOI 10.1016/B978-0-934613-53-8.50038-8

[3] THE THEORY OF DYNAMIC PROGRAMMING [J].

BELLMAN, R .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1954, 60 (06) :503-515

[4]

Ganter B., 1999, Formal Concept Analysis: Mathematic Foundations, P1

[5]

Ganter B., 2016, Conceptual Exploration

[6]

Kipke U., 1986, KLASSIFIKATION IHR U, P164

[7]

Triantaphyllou Evangelos, 2000, Multi-Criteria Decision Making Methods: A Comparative Study

← 1 →