Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > F. Theory of Computation  > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY  > F.2.2 Nonnumerical Algorithms and Problems 
CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1
By: Hasmik Sahakyan (3421 reads)
Rating: (1.00/10)

Abstract: Let ܥ be a collection of objects, characterized by the set ܣ = {ܽଵ,⋯,ܽ௡} of binary attributes. We consider problems of the following type: given an object-characterization table, it is to check if there exists a subset ܯ in ܥ of a given size, such that each attribute of A is satisfied by a given number of objects in ܯ. Additional restriction may be applied such as - the number of matches of each object in ܯ is limited. In this paper we investigate particular cases of the general problem, and consider approximation solutions by means of binary classification trees.

Keywords: Classification tree, covering, greedy algorithm.

ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems

Link:

CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1

Hasmik Sahakyan

http://www.foibg.com/ijicp/vol01/ijicp01-02-p04.pdf

Print
F.2.2 Nonnumerical Algorithms and Problems
article: CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES · LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY · CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS · IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA FOR UNL ANALYSIS AND GENERATION · APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERE · SELF-MODIFICATED PREDICATE NETWORKS · THE INVERSE MASLOV METHOD AND ANT TACTICS FOR EXHAUSTIVE SEARCH DECREASING · CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1 · CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF ... · EFFICIENT SIMULATION FOR PROLOG IMPLEMENTATION OF IMAGE RECOGNITION PROBLEM · THE INVERSE METHOD FOR SOLVING ARTIFICIAL INTELLIGENCE PROBLEMS IN ... · EVALUATION OF GREEDY ALGORITHM OF CONSTRUCTING (0,1)-MATRICES WITH DIFFERENT ... · DISCRETE ARTIFICIAL INTELLIGENCE PROBLEMS AND NUMBER OF STEPS OF THEIR SOLUTION · ON STRUCTURAL RECOGNITION WITH LOGIC AND DISCRETE ANALYSIS · SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ... · REALIZATION OF AN OPTIMAL SCHEDULE FOR THE TWO-MACHINE · RECENT RESULTS ON STABILITY ANALYSIS ... · LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.54MB ]   [ GZIP Disabled ]   [ Server load: 0.22 ]
Powered by Tikiwiki CMS/Groupware