Finding fuzzy association rules via restriction levels

In real-world applications, transactions are typically represented by quantitative data. Thus, fuzzy association rule mining algorithms have been proposed to handle these quantitative transactions. In addition, items generally have certain lifespans or temporal periods in which they exist in a database. Therefore, fuzzy temporal association rule mining algorithms have also been proposed in the literature. A key factor in the acquisition of fuzzy temporal association rules (FTARs) is the design of appropriate membership functions. Because current approaches have been designed to generate membership functions for mining fuzzy association rules (FARs) in market-basket analysis, in this paper, we propose a membership function tuning mechanism for a fuzzy temporal association rule mining algorithm. The proposed approach modifies an existing cluster-based method to generate unique membership functions that are specifically tailored to each item in a dataset. Two factors are utilized to decide the appropriate membership functions of each item: (1) the density similarity among intervals corresponding to the density similarity within intervals, and (2) the information closeness within an interval corresponding to the similarity in the number of data points between intervals. A parameter θ is used to indicate the relative importance of these two factors. As a result, the membership functions are generated based on the quantitative ranges of individual items, and the generated membership functions of items are different in terms of the values of each interval and the number of intervals. The generated membership functions are subsequently used in a fuzzy temporal association rule mining algorithm. Computational experiments were conducted on both a synthetic dataset and a real-world one to demonstrate the effectiveness of the proposed approach.

We have been using fuzzy data mining techniques to extract patterns that represent 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 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.

Applying classical association rule extraction framework on fuzzy data sets leads to an unmanageably highly sized association rule sets -compounded with an information loss due to the discretization operation -that often constitutes a hamper towards an efficient exploitation of the mined knowledge. To overcome such drawback, we advocate the extraction and the exploitation of compact and informative generic basis of fuzzy association rules. This generic basis constitutes a compact nucleus of fuzzy association rules. In addition, we introduce an axiomatic system to ensure the derivation mechanism of all the remaining rules. Obtained preliminary results are very encouraging and they highlight a very important reduction of the number of the extracted fuzzy association rules without information loss.

Association rules and fuzzy association rules are vastly studied topics. Various measures for quantifying a quality of a (fuzzy) association rule were proposed in the past. In this article, we survey existing and propose some new quality measures for the whole rule bases of fuzzy association rules.

Detection of abnormal traffic and network intrusions based on multiple fuzzy rules

As opposed to quantitative association rule mining, fuzzy association rule mining is said to prevent the overestimation of boundary cases, as can be shown by small examples. Rule mining, however, becomes interesting in large databases, where the problem of boundary cases is less apparent and can be further suppressed by using sensible partitioning methods. A data-driven approach is used to investigate if there is a significant difference between quantitative and fuzzy association rules in large databases. The influence of the choice of a particular triangular norm in this respect is also examined.

In business association rules being considered as important assets, play a vital role in its productivity and growth. Different business partnership share association rules in order to explore the capabilities to make effective decision for enhance-ment of business and core capabilities. The fuzzy association rule mining approach emerged out of the necessity to mine quantitative data regularly present in database. An association rule is sensitive when it violates few rules and regulation for sharing particular nature of information to third world. Like classical association rules, there is a need for some privacy measures to be taken for retaining the standards and importance of fuzzy association rules. Privacy preservation is used for valu-able information extraction and minimizing the risk of sensitive information disclosure. Our proposed model mainly focuses to secure the sensitive information revealing association rules. In our model, sensitive fuzzy association rules are secured by identifying sensitive fuzzy item to perturb fuzzified dataset. The resulting transformed FARs are analyzed to conclude/calculate the accuracy level of our model in context of newly generated fuzzy association rules, hidden rules and lost rules. Extensive experiments are carried out in order to demonstrate the results of our proposed model. Privacy preservation of maximum number of sensitive FARs by keeping minimum perturbation highlights the significance of our model.

The importance of Customer Relationship Management (CRM) has never been higher. Thus, companies are forced to adopt new strategies to focus on customers, given the competitive climate in which they operate. Also, companies have been able to maintain customer data within large databases that contain all information related to customers, thanks to the tremendous technological development seen recently. Multilevel quantitative association mining is a significant field for achieving motivational associations between data components with multiple abstraction levels. This paper develops a methodology to support CRM to improve the relationship between retail companies and their customers in the retail sector to retain existing customers and attract more new customers, by applying data mining techniques using the genetic algorithm through which an integrated search is performed. The proposed model can be implemented because the proposed model does not need the minimum levels of support and trust required by the user, and it has been confirmed that the algorithm proposed in this research can powerfully create non-redundant fuzzy multi-level association rules, according to the results of these experiments.

Following an investigation undertaken by the publisher, we have determined that this paper was accepted on the basis of a compromised peer review process. We hereby retract the paper. The corresponding author has been notified of the retraction. The retraction statement can be found here: https://doi.org/10.1520/JTE20269996. Aiming at the problems of poor effect, low precision, and a long time frame in the current data mining analysis algorithm of the network information resource description framework (RDF), a data mining analysis algorithm of the network information RDF based on fuzzy association rules is proposed. Using association rule mining technology combined with fuzzy set theory, a fuzzy association rule algorithm is obtained to deal with quantitative data. Fuzzy c-means (FCM) is used to discretize continuous attributes, and the fuzzy concept pattern and its support and credibility are defined. Add a Mining Query flag to extend the SPARQL Protocol and RDF Query Language (SPARQL) syntax, define the user specified mining model, generate the corresponding project set and transaction, adopt the fuzzy association rule algorithm to generate fuzzy association rules, and realize the RDF data mining analysis of network information. The experimental results show that the network RDF data mining analysis effect of the proposed algorithm is good, which can effectively improve the network RDF data mining analysis accuracy and shorten the mining analysis time.

A major problem when conducting mining fuzzy association rules from the database (DB) is the large computation time and memory needed. In addition, the selection of fuzzy sets for each attribute of the database is very important because it will affect the quality of the mining rule. This paper proposes a method for mining fuzzy association rules using the compressed database. We also use the approach of Hedge Algebra (HA) to build the membership function for attributes instead of using the normal way of fuzzy set theory. This approach allows us to explore fuzzy association rules through a relatively simple algorithm which is faster in terms of time, but it still brings association rules which are as good as the classical algorithms for mining association rules.

Fuzzy ellipsoid theory was introduced to mining fuzzy association rule from quantitative data. The algorithm includes two steps. First, fuzzy clustering procedure is taken to get fuzzy ellipsoids of the feature space. Second, mining procedure is taken to get fuzzy association rule based on the projection regions of fuzzy ellipsoids. The algorithm was compared with a Apriori-based fuzzy association rule mining algorithm. Results show that the algorithm is considerably quicker, especially when mining from large databases. Experiments on real-life data also show that the algorithm is effective to find association rules.

Fuzzy Association Rule Mining (FARM) extends traditional ARM by evaluating and pruning rules based on interestingness measures to identify relevant patterns for various applications. The focus of this paper is to explore the application of FARM techniques demonstrating its algorithmic implementation in a meteorological dataset. Three major algorithms known as fuzzy Apriori, FTDA (Fuzzy Transaction Data-Mining Algorithm) and CFARM Composite Fuzzy Association Rule Mining) are experimented and analyzed. The experiment uses a real meteorological dataset spanning twenty years consisting some important attributes of weather such as rainfall, temperature, relative humidity, wind speed and bright sunshine hours of the North Bank Plain Zone (NBPZ) of the Brahmaputra River in Assam, India. The collected dataset is pre-processed into a transaction dataset and converted into a fuzzy dataset using membership functions. The three FARM algorithms are subsequently employed to uncover associations among various attributes within the fuzzy meteorological dataset. This study analyzes experimental results from three algorithms, focusing on factors like rule generation, computation time, and memory consumption. While Fuzzy Apriori provides comprehensive rule generation, it comes at the cost of higher computation time and memory usage. FTDA and CFARM, on the other hand, offer more efficient and significant rule generation, making them more suitable for large-scale, complex data analysis. The findings of this paper can contribute to the development of resilient and efficient data mining frameworks, enhancing the decision-making process for stakeholders in the meteorological domain. Thus, the paper introduces a new method for analyzing meteorological data using Fuzzy Association Rule Mining (FARM) techniques.

Today, development of e-commerce has provided many transaction databases with useful information for investigators exploring dependencies among the items. In data mining, the dependencies among different items can be shown using an association rule. The new fuzzy-genetic (FG) approach is designed to mine fuzzy association rules from a quantitative transaction database. Three important advantages are associated with using the FG approach: (1) the association rules can be extracted from the transaction database with a quantitative value; (2) extracting proper membership functions and support threshold values with the genetic algorithm will exert a positive effect on the mining process results; (3) expressing the association rules in a fuzzy representation is more understandable for humans. In this paper, we design a comprehensive and fast algorithm that mines level-crossing fuzzy association rules on multiple concept levels with learning support threshold values and membership functions using the cluster-based master---slave integrated FG approach. Mining the fuzzy association rules on multiple concept levels helps find more important, useful, accurate, and practical information.

Association Rule Mining is one of the important data mining activities and has received substantial attention in the literature. Association rule mining is a computationally and I/O intensive task. In this paper, we propose a solution approach for mining optimized fuzzy association rules of different orders. We also propose an approach to define membership functions for all the continuous attributes in a database by using clustering techniques. Although single objective genetic algorithms are used extensively, they degenerate the solution. In our approach, extraction and optimization of fuzzy association rules are done together using multi-objective genetic algorithm by considering the objectives such as fuzzy support, fuzzy confidence and rule length. The effectiveness of the proposed approach is tested using computer activity dataset to analyze the performance of a multi processor system and network audit data to detect anomaly based intrusions. Experiments show that the proposed method is efficient in many scenarios.

Fault diagnosis is a challenging work in large communication network. A fault will bring more than one alarms, an alarm may be caused by different faults vice versa. The relationship between faults and alarms are not accurate but fuzzy, which can not be understood using traditional Boolean logic. Also, crisp association rules use sharp partitioning and potentially introduce loss of information. Therefore, fuzzy logic is used to convert numerical attributes into linguistic terms and a fuzzy judge language set is described. We first analyze the meanings of each attribute of network alarms. Then define proper fuzzy membership functions according to the relationship between this field and the root alarm. After that we integrate MDs (membership degrees) and weights of every attribute to construct fuzzy database. At last, we come up with a new fuzzy association rules mining algorithm, which generalizes the popular hierarchy-based algorithm. Simulation experiments on a synthetic network are carried out to prove and validate the accuracy and efficiency of our algorithm with respect to correlation analysis for right positioning root alarms.