In the paper we consider the generalization of the conjunctive rule in the theory of imprecise probabilities. Let us remind that the conjunction rule, produced on credal sets, gives their intersection and it is not defined if this intersection is empty. In the last case the sources of information are called contradictory1. Meanwhile, in the Dempster-Shafer theory it is possible to use the conju...

We formulate linguistic rule extraction as a three-objective combinatorial optimization problem. Three objectives are to maximize the performance of an extracted rule set, to minimize the number of extracted rules, and to minimize the total length of extracted rules. The second and third objectives are related to comprehensibility of the extracted rule set. We describe and compare two genetic-a...

In this contribution we carry out an analysis of the rule weights and Fuzzy Reasoning Methods for Fuzzy Rule Based Classification Systems in the framework of imbalanced data-sets with a high imbalance degree. We analyze the behaviour of the Fuzzy Rule Based Classification Systems searching for the best configuration of rule weight and Fuzzy Reasoning Method also studying the cooperation of some...

Nowadays the majority of users are unable to properly configure security mechanisms mostly because they are not usable for them. To reach the goal of having usable security mechanisms, the best solution is to minimize the amount of user interactions and simplify configuration tasks. Automation is a proper solution for minimizing the amount of user interaction. Fully automated security systems a...

Dempster’s rule, non-normalized conjunctive rule, Yager’s rule and Dubois-Prade’s rule for belief functions combination are generalized to be applicable to hyper-power sets according to the DSm theory. A comparison of the rules with DSm rule of combination is presented. A series of examples is included.

In this paper, we shall give examples to answer that an open problem posed by De Baets et al. in “Triangular norms on product lattices (Fuzzy Sets and Systems 104(1999), 61-75)”.

Bi-level decision addresses compromises between two interacting decision entities within a given hierarchical complex systems. Bi-level programming typically solves bi-level decision problems. However, formulation of objectives and constraints in mathematical functions is required, which are difficult, and sometimes impossible, in real-world situations due to various uncertainties. Our study de...

Weak data dependencies in large databases coupled with poorly written web based applications are a major cause for malicious transactions. The problem of security becomes especially acute when access roles are changed among users. Also the poorly maintained data base caches are a cause for added security leaks. We propose an adaptive Intrusion detection system to keep track of the varying data ...

In essence, data mining consists of extracting knowledge from data. This paper proposes a co-evolutionary system for discovering fuzzy classification rules. The system uses two evolutionary algorithms: a genetic programming (GP) algorithm evolving a population of fuzzy rule sets and a simple evolutionary algorithm evolving a population of membership function definitions. The two populations co-...

Mining frequent patterns in data is a useful requirement in several applications to guide future decisions. Association rule mining discovers interesting relationships among a large set of data items. Several association rule mining techniques exist, with the Apriori algorithm being common. Numerous algorithms have been proposed for efficient and fast association rule mining in data bases, but ...