Selection of search strategies for solving 3-sat problems
Andrzej Pułka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Andrzej Pułka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Mohammed Khabzaoui, Clarisse Dhaenens, El-Ghazali Talbi (2008)
RAIRO - Operations Research
Similarity:
An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed...
Andrzej Pułka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
María Fernández, Ernestina Menasalvas, Óscar Marbán, José Peña, Socorro Millán (2001)
International Journal of Applied Mathematics and Computer Science
Similarity:
Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing...
Rafael Alcalá, Jorge Casillas, Oscar Cordón, Francisco Herrera (2001)
Mathware and Soft Computing
Similarity:
The cooperative rules (COR) methodology [2] is based on a combinatorial search of cooperative rules performed over a set of previously generated candidate rule consequents. It obtains accurate models preserving the highest interpretability of the linguistic fuzzy rule-based systems. Once the good behavior of the COR methodology has been proven in previous works, this contribution focuses on developing the process with a novel kind of metaheuristic algorithm: the ant colony system one....
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Michał Woźniak, Bartosz Krawczyk (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper presents a significant modification to the AdaSS (Adaptive Splitting and Selection) algorithm, which was developed several years ago. The method is based on the simultaneous partitioning of the feature space and an assignment of a compound classifier to each of the subsets. The original version of the algorithm uses a classifier committee and a majority voting rule to arrive at a decision. The proposed modification replaces the fairly simple fusion method with a combined classifier,...
Asako Soga, Bin Umino, Jeffrey Scott Longstaff (2006)
Review of the National Center for Digitization
Similarity: