Let C be a collection of objects, characterized by the set A= {a1,⋯,an} of binary attributes. We consider problems of the following type: given an object-characterization table, it is to check if there exists a subset M in C of a given size, such that each attribute of A is satisfied by a given number of objects in M. Additional restriction may be applied such as - the number of matches of each object in M is limited. In this paper we investigate particular cases of the general problem, and consider approximation solutions by means of binary classification trees.
oai:noad.sci.am:135941
Information Content and Processing
Institute for Informatics and Automation Problems
Mar 2, 2021
Jul 27, 2020
22
https://noad.sci.am/publication/149534
Edition name | Date |
---|---|
Hasmik Sahakyan, CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS | Mar 2, 2021 |
Sahakyan Hasmik Ryazanov Vladimir Margaryan Ani
Sahakyan Hasmik Margaryan Ani
Sahakyan Hasmik Aslanyan Levon
Sahakyan Hasmik Aslanyan Levon Ryazanov Vladimir