scispace - formally typeset
Search or ask a question
Topic

Fuzzy associative matrix

About: Fuzzy associative matrix is a research topic. Over the lifetime, 8027 publications have been published within this topic receiving 194790 citations.


Papers
More filters
Proceedings ArticleDOI
07 Aug 2002
TL;DR: An algorithm for computing fuzzy association rules based on Borgelt's (2001) prefix trees, modifications to the computation of support and confidence of fuzzy rules, a new method for computing the similarity of two fuzzy rule sets, and feature selection and optimization with genetic algorithms are described.
Abstract: We have been using fuzzy data mining techniques to extract patterns that represent normal behavior for intrusion detection. We describe a variety of modifications that we have made to the data mining algorithms in order to improve accuracy and efficiency. We use sets of fuzzy association rules that are mined from network audit data as models of "normal behavior." To detect anomalous behavior, we generate fuzzy association rules from new audit data and compute the similarity with sets mined from "normal" data. If the similarity values are below a threshold value, an alarm is issued. We describe an algorithm for computing fuzzy association rules based on Borgelt's (2001) prefix trees, modifications to the computation of support and confidence of fuzzy rules, a new method for computing the similarity of two fuzzy rule sets, and feature selection and optimization with genetic algorithms. Experimental results demonstrate that we can achieve better running time and accuracy with these modifications.

108 citations

Journal ArticleDOI
TL;DR: Fuzzy logic deals with propositions which may be ascribed values between falsehood and truth subjectively in either a continuous or a discrete fashion.
Abstract: Fuzzy logic deals with propositions which may be ascribed values between falsehood and truth (0 and 1) subjectively in either a continuous or a discrete fashion. This is in contrast to ordinary logic (two-valued or k-valued logic) in which a given proposition is ascribed values objectively using either deterministic or probabilistic approaches.

108 citations

Journal ArticleDOI
01 Aug 2004
TL;DR: A new evolutionary approach is proposed for deriving a compact fuzzy classification system directly from data without any a priori knowledge or assumptions on the distribution of the data.
Abstract: Genetic algorithms show powerful capabilities for automatically designing fuzzy systems from data, but many proposed methods must be subjected to some minimal structure assumptions, such as rule base size. In this paper, we also address the design of fuzzy systems from data. A new evolutionary approach is proposed for deriving a compact fuzzy classification system directly from data without any a priori knowledge or assumptions on the distribution of the data. At the beginning of the algorithm, the fuzzy classifier is empty with no rules in the rule base and no membership functions assigned to fuzzy variables. Then, rules and membership functions are automatically created and optimized in an evolutionary process. To accomplish this, parameters of the variable input spread inference training (VISIT) algorithm are used to code fuzzy systems on the training data set. Therefore, we can derive each individual fuzzy system via the VISIT algorithm, and then search the best one via genetic operations. To evaluate the fuzzy classifier, a fuzzy expert system acts as the fitness function. This fuzzy expert system can effectively evaluate the accuracy and compactness at the same time. In the application section, we consider four benchmark classification problems: the iris data, wine data, Wisconsin breast cancer data, and Pima Indian diabetes data. Comparisons of our method with others in the literature show the effectiveness of the proposed method.

108 citations

Journal ArticleDOI
TL;DR: A lexicographic methodology is developed to determine the solutions of matrix games with payoffs of TIFNs for both Players through solving a pair of bi-objective linear programming models derived from two new auxiliary intuitionistic fuzzy programming models.
Abstract: The intuitionistic fuzzy set (IF-set) has not been applied to matrix game problems yet since it was introduced by K.T.Atanassov. The aim of this paper is to develop a methodology for solving matrix games with payoffs of triangular intuitionistic fuzzy numbers (TIFNs). Firstly the concept of TIFNs and their arithmetic operations and cut sets are introduced as well as the ranking order relations. Secondly the concept of solutions for matrix games with payoffs of TIFNs is defined. A lexicographic methodology is developed to determine the solutions of matrix games with payoffs of TIFNs for both Players through solving a pair of bi-objective linear programming models derived from two new auxiliary intuitionistic fuzzy programming models. The proposed method is illustrated with a numerical example.

108 citations

Journal ArticleDOI
TL;DR: It is shown that any discrete fuzzy number can be represented by a triangular or a block discrete fuzziness number having the same value, ambiguity and fuzziness as the original number.

107 citations


Network Information
Related Topics (5)
Fuzzy logic
151.2K papers, 2.3M citations
93% related
Genetic algorithm
67.5K papers, 1.2M citations
81% related
Support vector machine
73.6K papers, 1.7M citations
79% related
Artificial neural network
207K papers, 4.5M citations
79% related
Control theory
299.6K papers, 3.1M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202216
20212
20201
20193
201825