Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Reducts in Information Systems1
View through CrossRef
In the paper we consider properties of minimal sets of attributes (reducts) which determine an equivalence relation ind(P). We show that the problem to figure out all reducts of a given set is NP-complete. Subsequently, we present some properties of the set of all attributes which are indispensable to create ind(P).
Title: Reducts in Information Systems1
Description:
In the paper we consider properties of minimal sets of attributes (reducts) which determine an equivalence relation ind(P).
We show that the problem to figure out all reducts of a given set is NP-complete.
Subsequently, we present some properties of the set of all attributes which are indispensable to create ind(P).
Related Results
Refrigeration Technology
Refrigeration Technology
AbstractThe article contains sections titled:1.Refrigeration1.1.Compressor Refrigerating Systems1.1.1.Refrigerants for Compressor Refrigerating Systems1.1.2.Compressors1.1.2.1.Disp...
Saturated models of Peano arithmetic
Saturated models of Peano arithmetic
AbstractWe study reducts of Peano arithmetic for which conditions of saturation imply the corresponding conditions for the whole model. It is shown that very weak reducts (like pur...
Metric Based Attribute Reduction Method in Dynamic Decision Tables
Metric Based Attribute Reduction Method in Dynamic Decision Tables
Abstract
Feature selection is a vital problem which needs to be effectively solved in knowledge discovery in databases and pattern recognition due to two basic reas...
About a Distance Measure and Application for Finding Reduct in Incomplete Decision Tables
About a Distance Measure and Application for Finding Reduct in Incomplete Decision Tables
Tolerance rough set model is an effective tool to reduce attributes in incomplete decision tables. Over 40 years, several attribute reduction methods have been proposed to improve ...
Classifier ensemble under the belief function framework
Classifier ensemble under the belief function framework
Ensemble de classifieurs dans le cadre de la théorie des fonctions de croyance
Dans cette thèse, nous nous intéressons au problème de construction d’ensemble de cla...
AN EFFECTIVE ALGORITHM FOR COMPUTING REDUCTS IN DECISION TABLES
AN EFFECTIVE ALGORITHM FOR COMPUTING REDUCTS IN DECISION TABLES
Attribute reduction is one important part researched in rough set theory. A reduct from a decision table is a minimal subset of the conditional attributes which provide the same in...
On the Expressiveness of the Ambient Logic
On the Expressiveness of the Ambient Logic
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured...