Fuzzy Association Rules Research Articles

Using a fuzzy association rule mining approach to identify the financial data association

In the rapidly changing financial market, investors always have difficulty in deciding the right time to trade. In order to enhance investment profitability, investors desire a decision support system. The proposed artificial intelligence methodology provides investors with the ability to learn the association among different parameters. After the associations are extracted, investors can apply the rules in their decision support systems. In this work, the model is built with the ultimate goal of predicting the level of the Hang Seng Index in Hong Kong. The movement of Hang Seng Index, which is associated with other economics indices including the gross domestic product (GDP) index, the consumer price index (CPI), the interest rate, and the export value of goods from Hong Kong, is learnt by the proposed method. The case study shows that the proposed method is a feasible way to provide decision support for investors who may not be able to identify the hidden rules between the Hang Seng Index and other economics indices.

Interpretability of fuzzy association rules as means of discovering threats to privacy

This paper focuses on studying how data privacy could be preserved with fuzzy rule bases as interpretable as possible. These fuzzy rule bases are obtained from a data mining strategy based on building a decision tree. The antecedents of each rule produced by these systems contain information about the released variables (quasi-identifier), whereas the consequent contains information only about the protected variable. Experimental results show that fuzzy rules are generally simpler and easier to interpret than other approaches but the risk of disclosing does not increase.

A study on a novel method of mining fuzzy association using fuzzy correlation analysis

Two different data variables may behave very similarly. Correlation is the problem of determining how much alike the two variables actually are and association rules are used just to show the relationships between data items. Mining fuzzy association rules is the job of finding the fuzzy item-sets which frequently occur together in large fuzzy data set, where the presence of one fuzzy item-set in a record does not necessarily imply the presence of the other one in the same record. In this paper a new method of discovering fuzzy association rules using fuzzy correlation rules is proposed, because the fuzzy support and confidence measures are insufficient at filtering out uninteresting fuzzy correlation rules. To tackle this weakness, a fuzzy correlation measure for fuzzy numbers, is used to augment the fuzzy support-confidence framework for fuzzy association rules. A practical study over the academic behaviour of a particular school is done and some valuable suggestions are given, based on the results obtained. Key words: Fuzzy association rules, fuzzy item-sets, fuzzy data sets, fuzzy support-confidence, fuzzy correlation measure.

Detection of Fuzzy Association Rules by Fuzzy Transforms

We present a new method based on the use of fuzzy transforms for detecting coarse-grained association rules in the datasets. The fuzzy association rules are represented in the form of linguistic expressions and we introduce a pre-processing phase to determine the optimal fuzzy partition of the domains of the quantitative attributes. In the extraction of the fuzzy association rules we use the AprioriGen algorithm and a confidence index calculated via the inverse fuzzy transform. Our method is applied to datasets of the 2001 census database of the district of Naples (Italy); the results show that the extracted fuzzy association rules provide a correct coarse-grained view of the data association rule set.

Fuzzy Functions, Relations, and Fuzzy Transforms (2012)

Fuzzy functions, fuzzy relations, and fuzzy transforms are applied to fuzzy systems and like in the first issue published in 2011, here these terms must be intended in general sense. Indeed, the topics concerning fuzzy optimizations with fuzzy functions and relations (including also clustering and PSO algorithms), applications of fuzzy relations/transforms to fusion images, and detection coarse grained fuzzy association rules in the datasets and fuzzy convex processes are dealt with widely in this second issue. The contents of any single paper are resumed in the following sequel:

Improvement of Mining Fuzzy Multiple-Level Association Rules from Quantitative Data

Data-mining techniques have been developed to turn data into useful task-oriented knowledge. Most algorithms for mining association rules identify relationships among transactions using binary values and find rules at a single-concept level. Extracting multilevel association rules in transaction databases is most commonly used in data mining. This paper proposes a multilevel fuzzy association rule mining model for extraction of implicit knowledge which stored as quantitative values in transactions. For this reason it uses different support value at each level as well as different membership function for each item. By integrating fuzzy-set concepts, data-mining technologies and multiple-level taxonomy, our method finds fuzzy association rules from transaction data sets. This approach adopts a top-down progressively deepening approach to derive large itemsets and also incorporates fuzzy boundaries instead of sharp boundary intervals. Comparing our method with previous ones in simulation shows that the proposed method maintains higher precision, the mined rules are closer to reality, and it gives ability to mine association rules at different levels based on the user’s tendency as well.

FAR-miner: a fast and efficient algorithm for fuzzy association rule mining

Association rule mining ARM algorithms work only with binary attributes, and expect quantitative attributes to be converted to binary ones using sharp partitions, like 'age = [25, 60]'. A better alternative is to convert quantitative attributes to fuzzy attributes, like 'age = middle-aged', to eliminate loss of information due to sharp partitioning, and then run a fuzzy ARM algorithm. The most popular fuzzy ARM algorithms are fuzzy adaptations of apriori. Fuzzy apriori, like apriori, is a slow algorithm, especially for most medium-sized 500 K to 1 M and large > 1 M datasets. We propose a new fuzzy ARM algorithm called FAR-miner for fast and efficient performance. Through experiments we show that FAR-miner is 8-19 and 6-10 times faster on large and medium-sized datasets respectively as compared to fuzzy apriori. This efficiency is due to properties like two-phased multiple-partition tidlist-style processing and byte-vector representation and effective compression of tidlists.

Fast Mining of Fuzzy Association Rules

Fast Mining of Fuzzy Association Rules

Improving medical rule-based expert systems comprehensibility: fuzzy association rule mining approach

In this paper, a Fuzzy Association Rule Mining (FARM) with expert-driven approach is proposed to acquire a knowledge-base, which corresponds more intuitively to human perception with a high comprehensibility. This approach reduces the number of rules in the knowledge-base when compared with the Standard Rule-base Formulation (SRF) and makes possible the rating of the rules according to their relevance. The rule relevance is determined by the measures of significance and certainty factors. The approach is validated using a medical database and the result shows that this approach ultimately reduces the number of rules and enhances the comprehensibility of the expert system.

出力属性の指定と冗長性に基づくファジィ相関ルールの抽出

出力属性の指定と冗長性に基づくファジィ相関ルールの抽出

An Improvement of Fuzzy Association Rules Mining Algorithm Based on Redundancy of Rules

In data mining approach, quantitative attributes should be appropriately dealt with as well as Boolean attributes. This paper presents an essential improvement for extracting fuzzy association rules from a database. The objective of this paper is to improve the computational time of mining and to prune extracted redundant rules simultaneously for an actual data mining application. In this paper, we define the redundancy of fuzzy association rules as a new concept for mining and prove essential theorems concerning the redundancy of fuzzy association rules. Then, we propose a basic algorithm based on the Apriori algorithm for rule extraction utilizing the redundancy of the extracted rules. The essential performance of the algorithmis evaluated through numerical experiments using benchmark data. Fromthe results, themethod is found to be promising in terms of computational time and redundant-rule pruning.

Applying cluster-based fuzzy association rules mining framework into EC environment

During electronic commerce (EC) environment, how to effectively mine the useful transaction information will be an important issue to be addressed in designing the marketing strategy for most enterprises. Especially, the relationships between different databases (e.g., the transaction and online browsing database) may have the unknown and potential knowledge of business intelligence. Two important issues of mining association rules were mentioned to address EC application in this study. The first issue is the discovery of generalized fuzzy association rules in the transaction database. The second issue is to discover association rules from the web usage data and the large itemsets identified in the transaction database. A cluster-based fuzzy association rules (CBFAR) mining architecture is then proposed to simultaneously address such two issues in this study. Three contributions were achieved as: (a) an efficient fuzzy association rule miner based on cluster-based fuzzy-sets tables is presented to identify all the large fuzzy itemsets; (b) this approach requires less contrast to generate large itemsets; (3) a fuzzy rule mining approach is used to compute the confidence values for discovering the relationships between transaction database and browsing information database. Finally, a simulated example during EC environment is provided to demonstrate the rationality and feasibility of the proposed approach.

Mining fuzzy association rules from low-quality data

Data mining is most commonly used in attempts to induce association rules from databases which can help decision-makers easily analyze the data and make good decisions regarding the domains concerned. Different studies have proposed methods for mining association rules from databases with crisp values. However, the data in many real-world applications have a certain degree of imprecision. In this paper we address this problem, and propose a new data-mining algorithm for extracting interesting knowledge from databases with imprecise data. The proposed algorithm integrates imprecise data concepts and the fuzzy apriori mining algorithm to find interesting fuzzy association rules in given databases. Experiments for diagnosing dyslexia in early childhood were made to verify the performance of the proposed algorithm.

A formal model for mining fuzzy rules using the RL representation theory

Data mining techniques managing imprecision are very useful to obtain meaningful and interesting information for the user. Among some other techniques, fuzzy association rules have been developed as a powerful tool for dealing with imprecision in databases and offering a good representation of found knowledge. In this paper we introduce a formal model for managing the imprecision in fuzzy transactional databases using the restriction level representation theory, a recent representation of imprecision that extends that of fuzzy sets. This theory introduces some new operators, keeping the usual crisp properties even when negation is involved. The model allows us to mine fuzzy association rules in a straightforward way, extending the accuracy measures from the crisp case. In addition, we introduce several ways of representing and summarizing the obtained results, in order to offer new and very interesting semantics. As an application, we present how to extract fuzzy association rules involving both the presence and the absence of items using the proposed model, and we also perform some experiments with real fuzzy transactional datasets.

Integrated Rule Mining Based on Fuzzy GNP and Probabilistic Classification for Intrusion Detection

With the increasing popularity of the Internet, network security has become a serious problem recently. How to detect intrusions effectively becomes an important component in network security. Therefore, a variety of algorithms have been devoted to this challenge. Genetic network programming is a newly developed evolutionary algorithm with directed graph gene structures, and it has been applied to data mining for intrusion detection systems providing good performances in intrusion detection. In this paper, an integrated rule mining algorithm based on fuzzy GNP and probabilistic classification is proposed. The integrated rule mining uses fuzzy class association rule mining algorithm to extract rules with different classes. Actually, it can deal with both discrete and continuous attributes in network connection data. Then, the classification is done probabilistically using different class rules. The integrated method showed excellent results by simulation experiments.

Extracting compact and information lossless sets of fuzzy association rules

Applying classical association rule extraction framework on fuzzy datasets leads to an unmanageably highly sized association rule sets. Moreover, the discretization operation leads to information loss and constitutes a hamper towards an efficient exploitation of the mined knowledge. To overcome such a drawback, this paper proposes the extraction and the exploitation of compact and informative generic basis of fuzzy association rules. The presented approach relies on the extension, within the fuzzy context, of the notion of closure and Galois connection, that we introduce in this paper. In order to select without loss of information a generic subset of all fuzzy association rules, we define three fuzzy generic basis from which remaining (redundant) FARs are generated. This generic basis constitutes a compact nucleus of fuzzy association rules, from which it is possible to informatively derive all the remaining rules. In order to ensure a sound and complete derivation process, we introduce an axiomatic system allowing the complete derivation of all the redundant rules. The results obtained from experiments carried out on benchmark datasets are very encouraging. They highlight a very important reduction of the number of the extracted fuzzy association rules without information loss.

Finding Associations in Composite Data Sets

In this paper, a composite fuzzy association rule mining mechanism (CFARM), directed at identifying patterns in datasets comprised of composite attributes, is described. Composite attributes are defined as attributes that can take simultaneously two or more values that subscribe to a common schema. The objective is to generate fuzzy association rules using “properties” associated with these composite attributes. The exemplar application is the analysis of the nutrients contained in items found in grocery data sets. The paper commences with a review of the back ground and related work, and a formal definition of the CFARM concepts. The CFARM algorithm is then fully described and evaluated using both real and synthetic data sets.

Intelligent Information Retrieval Using Fuzzy Association Rule Classifier

As the use of web applications increases, when users use search engines for finding some information by inputting keywords, the number of web pages that match the information increases at a tremendous rate. It is not easy for a user to retrieve the exact web page which contains information he or she requires. In this paper, an approach to web page retrieval system using the hybrid combination of context based and collaborative filtering method employing the concept of fuzzy association rule classification is introduced and the authors propose an innovative clustering of user profiles in order to reduce the filtering space and achieves sub-linear filtering time. This approach can produce recommended web page links for users based on the information that associates strongly with users’ queries quickly with better efficiency and therefore improve the recall, precision of a search engine.

Fuzzy association rule mining framework and its application to effective fuzzy associative classification

AbstractClassification is a technique widely and successfully used for prediction, which is one of the most attractive features of data mining. However, building the classifier is the most challenging part of the process, which proceeds into testing the classifier to check its effectiveness. This article introduces a classification framework that integrates fuzzy association rules into the learning process of machine learning techniques. The integrated framework involves three major components. First, we employ multiobjective optimization twice to decide on the fuzzy sets and then optimize their ranges to extract a set of interesting fuzzy association rules. Second, we use a special subset of the extracted fuzzy association rules, namely, fuzzy class association rules, for building a set of new feature vectors that measure the compatibility between the rules and the given data objects. Third, we train a classifier on the generated feature vectors to predict the class of unseen objects. Most of the earlier algorithms proposed for mining fuzzy association rules assume that the fuzzy sets are given. However, the fuzzy association rule mining component of the proposed framework uses an automated method for autonomous mining of both fuzzy sets and fuzzy association rules. For this purpose, first fuzzy sets are constructed by using a multiobjective genetic algorithm based clustering method for determining and optimizing the membership functions of the fuzzy sets. Then, a method is applied to extract interesting fuzzy association rules. Further, the proposed framework integrates a new layer to the learning process of the machine learning algorithm by constructing the compatibility rule‐based feature vectors; this satisfies the aim of better understandability. Once used by the learning algorithm, the compatibility feature vectors represent a rich source of discrimination knowledge that can substantially impact the prediction power of the final classifier. The experimental study and the reported results show the efficiency and effectiveness of our framework for benchmark datasets. In order to further demonstrate and evaluate the applicability of the proposed method to a variety of domains, it is utilized for the task of gene expression classification as well. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 477–495 DOI: 10.1002/widm.40This article is categorized under: Technologies > Association Rules Technologies > Classification

Method of SVM classifier generation based on fuzzy classification association rule

To increase the classification accuracy of the database classification system,this paper proposed a new classification method.Firstly,the continuous attributes were dispersed by the Fuzzy C-Mean(FCM) algorithm.Secondly,an improved fuzzy association method was proposed to mine the classification association rules.Eventually,the compatibility between the generated rules and patterns was used to construct a set of feature vectors,which were used to generate a classifier.The experimental results demonstrate that the method has high discrimination and efficiency.