A Rule Discovery by Fuzzy Classifier System Utilizing Symbolic Information

Author(s):  
Makoto Fujii ◽  
◽  
Takeshi Furuhashi

This paper presents a new fuzzy classifier system (FCS) that can discover effective fuzzy rules efficiently. The system incorporates human knowledge in the form of symbolic information, and effectively limits its search space for fuzzy rules by using knowledge. The system also extracts symbolic information from acquired fuzzy rules for efficient exploration of other new fuzzy rules. Simulations are done to demonstrate the feasibility of the proposed method.

Author(s):  
Michał Okoniewski ◽  
Piotr Gawrysiak ◽  
Łukasz Gancarz

2018 ◽  
Vol 18 (2) ◽  
pp. 36-50
Author(s):  
Samira Bordbar ◽  
Pirooz Shamsinejad

Abstract Opinion Mining or Sentiment Analysis is the task of extracting people final opinion about something through their unstructured sentiments. The Opinion Mining process is as follows: first, product features which are most important to a user are extracted from his/her comments. Then, sentiments will be emotionally classified using their emotional implications. In this paper we propose an opinion classification method based on Fuzzy Logic. Up to now, a few methods have taken advantage of fuzzy logic in opinion classification and all of them have imported fuzzy rules into system as background knowledge. But the main challenge here is finding the fuzzy rules. Our contribution is to automatically extract fuzzy rules and their parameters from training data. Here we have used the Particle Swarm Optimization (PSO) algorithm to extract fuzzy rules from training data. Also, for better results we have devised a mutation-based PSO. All proposed methods have been implemented and tested on relevant data. Results confirm that our method can reach better accuracy than current state of the art methods in this domain.


Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1636
Author(s):  
Noé Ortega-Sánchez ◽  
Diego Oliva ◽  
Erik Cuevas ◽  
Marco Pérez-Cisneros ◽  
Angel A. Juan

The techniques of halftoning are widely used in marketing because they reduce the cost of impression and maintain the quality of graphics. Halftoning converts a digital image into a binary image conformed by dots. The output of the halftoning contains less visual information; a possible benefit of this task is the reduction of ink when graphics are printed. The human eye is not able to detect the absence of information, but the printed image stills have good quality. The most used method for halftoning is called Floyd-Steinberger, and it defines a specific matrix for the halftoning conversion. However, most of the proposed techniques in halftoning use predefined kernels that do not permit adaptation to different images. This article introduces the use of the harmony search algorithm (HSA) for halftoning. The HSA is a popular evolutionary algorithm inspired by the musical improvisation. The different operators of the HSA permit an efficient exploration of the search space. The HSA is applied to find the best configuration of the kernel in halftoning; meanwhile, as an objective function, the use of the structural similarity index (SSIM) is proposed. A set of rules are also introduced to reduce the regular patterns that could be created by non-appropriate kernels. The SSIM is used due to the fact that it is a perception model used as a metric that permits comparing images to interpret the differences between them numerically. The aim of combining the HSA with the SSIM for halftoning is to generate an adaptive method that permits estimating the best kernel for each image based on its intrinsic attributes. The graphical quality of the proposed algorithm has been compared with classical halftoning methodologies. Experimental results and comparisons provide evidence regarding the quality of the images obtained by the proposed optimization-based approach. In this context, classical algorithms have a lower graphical quality in comparison with our proposal. The results have been validated by a statistical analysis based on independent experiments over the set of benchmark images by using the mean and standard deviation.


Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 609 ◽  
Author(s):  
Marina Bardamova ◽  
Anton Konev ◽  
Ilya Hodashinsky ◽  
Alexander Shelupanov

This paper concerns several important topics of the Symmetry journal, namely, pattern recognition, computer-aided design, diversity and similarity. We also take advantage of the symmetric and asymmetric structure of a transfer function, which is responsible to map a continuous search space to a binary search space. A new method for design of a fuzzy-rule-based classifier using metaheuristics called Gravitational Search Algorithm (GSA) is discussed. The paper identifies three basic stages of the classifier construction: feature selection, creating of a fuzzy rule base and optimization of the antecedent parameters of rules. At the first stage, several feature subsets are obtained by using the wrapper scheme on the basis of the binary GSA. Creating fuzzy rules is a serious challenge in designing the fuzzy-rule-based classifier in the presence of high-dimensional data. The classifier structure is formed by the rule base generation algorithm by using minimum and maximum feature values. The optimal fuzzy-rule-based parameters are extracted from the training data using the continuous GSA. The classifier performance is tested on real-world KEEL (Knowledge Extraction based on Evolutionary Learning) datasets. The results demonstrate that highly accurate classifiers could be constructed with relatively few fuzzy rules and features.


Sign in / Sign up

Export Citation Format

Share Document