Object
Title: Constrained object-characterization tables and algorithms
Abstract:
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.
Publisher:
Date of publication:
Identifier:
oai:noad.sci.am:135941
ISSN:
Language:
Journal or Publication Title:
Information Content and Processing
Volume:
Number:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
Mar 2, 2021
In our library since:
Jul 27, 2020
Number of object content hits:
19
All available object's versions:
https://noad.sci.am/publication/149534
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Hasmik Sahakyan, CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS | Mar 2, 2021 |
