基于时间的模糊关联规则挖掘

关联规则是数据挖掘研究中的一个重要的主题。一些算法都是假设数据中根本的关联基于时间是稳定的。然而,在现实世界领域,数据具有自己的特征,因此关联随着时间发生巨大的改变。现有的数据挖掘算法没有考虑关联的改变,这导致了严重的性能下降,特别是挖掘出的关联规则被用来分类和预测。尽管关联改变的挖掘是一个重要的问题,因为需要基于过去的历史数据来预测未来,现有的数据挖掘算法不符合这样的工作。文中引入模糊数据挖掘算法来发现基于时间的关联规则的改变。基于挖掘出的模糊规则,能预测关联规则在未来如何改变。实验表明了算法的有效性。     

Mining fuzzy specific rare itemsets for education data

Association rule mining is an important data analysis method for the discovery of associations within data. There have been many studies focused on finding fuzzy association rules from transaction databases. Unfortunately, in the real world, one may have available relatively infrequent data, as well as frequent data. From infrequent data, we can find a set of rare itemsets that will be useful for teachers to find out which students need extra help in learning. While the previous association rules discovery techniques are able to discover some rules based on frequency, this is insufficient to determine the importance of a rule composed of frequency-based data items. To remedy this problem, we develop a new algorithm based on the Apriori approach to mine fuzzy specific rare itemsets from quantitative data. Finally, fuzzy association rules can be generated from these fuzzy specific rare itemsets. The patterns are useful to discover learning problems. Experimental results show that the proposed approach is able to discover interesting and valuable patterns from the survey data.     

基于审计的时态关联规则研究

传统关联规则挖掘很少考虑关联规则的时间适用性.时态关联规则是指带有时态约束的关联规则,每个关联规则都有着其成立的时间区域.结合其他算法的特点,提出了基于Fisher聚类的时态关联规则挖掘算法,它能够动态地发现关联规则以及关联规则有效的时间区域.实验结果证明该算法是合理有效的。     

Mining fuzzy association rules for classification problems

The effective development of data mining techniques for the discovery of knowledge from training samples for classification problems in industrial engineering is necessary in applications, such as group technology. This paper proposes a learning algorithm, which can be viewed as a knowledge acquisition tool, to effectively discover fuzzy association rules for classification problems. The consequence part of each rule is one class label. The proposed learning algorithm consists of two phases: one to generate large fuzzy grids from training samples by fuzzy partitioning in each attribute, and the other to generate fuzzy association rules for classification problems by large fuzzy grids. The proposed learning algorithm is implemented by scanning training samples stored in a database only once and applying a sequence of Boolean operations to generate fuzzy grids and fuzzy rules; therefore, it can be easily extended to discover other types of fuzzy association rules. The simulation results from the iris data demonstrate that the proposed learning algorithm can effectively derive fuzzy association rules for classification problems.     

Mining fuzzy association rules from uncertain data

Association rule mining is an important data analysis method that can discover associations within data. There are numerous previous studies that focus on finding fuzzy association rules from precise and certain data. Unfortunately, real-world data tends to be uncertain due to human errors, instrument errors, recording errors, and so on. Therefore, a question arising immediately is how we can mine fuzzy association rules from uncertain data. To this end, this paper proposes a representation scheme to represent uncertain data. This representation is based on possibility distributions because the possibility theory establishes a close connection between the concepts of similarity and uncertainty, providing an excellent framework for handling uncertain data. Then, we develop an algorithm to mine fuzzy association rules from uncertain data represented by possibility distributions. Experimental results from the survey data show that the proposed approach can discover interesting and valuable patterns with high certainty.     

A novel unsupervised fuzzy clustering method for preprocessing of quantitative attributes in association rule mining

In Association rule mining, the quantitative attribute values are converted into Boolean values using fixed intervals. Conventional association rule mining algorithms are then applied to find relations among the attribute values. These intervals may not be concise and meaningful enough for human users to easily obtain non trivial knowledge from those rules discovered. Clustering techniques can be used for segmenting quantitative values into meaningful groups instead of fixed intervals. But the conventional clustering techniques like k-means and c-means require the user to specify the number of clusters and initial cluster centres. This initialization is one of the major challenges of clustering. A novel fuzzy based unsupervised clustering algorithm proposed by the authors is extended to segment quantitative values into fuzzy clusters in this paper. Membership values of quantitative items in the partitioning fuzzy clusters are used with weighted fuzzy rule mining techniques to find natural association rules. This fuzzy based method for handling quantitative attributes is compared with that of fixed intervals and segmenting using conventional k-means clustering method along with Apriori algorithm.     

PARM—An Efficient Algorithm to Mine Association Rules From Spatial Data

Association rule mining, originally proposed for market basket data, has potential applications in many areas. Spatial data, such as remote sensed imagery (RSI) data, is one of the promising application areas. Extracting interesting patterns and rules from spatial data sets, composed of images and associated ground data, can be of importance in precision agriculture, resource discovery, and other areas. However, in most cases, the sizes of the spatial data sets are too large to be mined in a reasonable amount of time using existing algorithms. In this paper, we propose an efficient approach to derive association rules from spatial data using Peano Count Tree (P-tree) structure. P-tree structure provides a lossless and compressed representation of spatial data. Based on P-trees, an efficient association rule mining algorithm PARM with fast support calculation and significant pruning techniques is introduced to improve the efficiency of the rule mining process. The P-tree based Association Rule Mining (PARM) algorithm is implemented and compared with FP-growth and Apriori algorithms. Experimental results showed that our algorithm is superior for association rule mining on RSI spatial data.      

关联规则在独立学院招生决策中的应用

关联规则(Association Rule)是数据挖掘领域中一个重要的研究课题,广泛应用于各个领域,既可以检验行业内长期形成的知识模式,也能够发现隐藏的新规律。本文利用关联规则对独立学院招生信息进行分析,建立独立学院招生决策模型。首先选取考生高考志愿表中的专业信息,然后利用关联规则进行挖掘,最后对挖掘出的规则进行分析和应用。实验结果表明,利用关联规则对考生高考志愿信息进行挖掘是可行的、有效的,它为独立学院编制招生计划和制定招生宣传方案提供了一种新的参考依据,在独立学院招生领域具有较好的应用前景。     

遗传算法在关联规则挖掘中的应用

数据挖掘是关联规则中一个重要的研究方向。该文对关联规则的数据挖掘和遗传算法进行了概述,提出了一种改进型遗传算法的关联规则提取算法。最后结合实例给出了用遗传算法进行关联规则的挖掘方法。     

Applications of association rule mining in health informatics: a survey

Association rule mining is an effective data mining technique which has been used widely in health informatics research right from its introduction. Since health informatics has received a lot of attention from researchers in last decade, and it has developed various sub-domains, so it is interesting as well as essential to review state of the art health informatics research. As knowledge discovery researchers and practitioners have applied an array of data mining techniques for knowledge extraction from health data, so the application of association rule mining techniques to health informatics domain has been focused and studied in detail in this survey. Through critical analysis of applications of association rule mining literature for health informatics from 2005 to 2014, it has been explored that, instead of the more efficient alternative approaches, the Apriori algorithm is still a widely used frequent itemset generation technique for application of association rule mining for health informatics. Moreover, other limitations related to applications of association rule mining for health informatics have also been identified and recommendations have been made to mitigate those limitations. Furthermore, the algorithms and tools utilized for application of association rule mining have also been identified, conclusions have been drawn from the literature surveyed, and future research directions have been presented.     

遗传算法在关联规则挖掘中的应用

数据挖掘是关联规则中一个重要的研究方向。该文对关联规则的数据挖掘和遗传算法进行了概述,提出了一种改进型遗传算法的关联规则提取算法。最后结合实例给出了用遗传算法进行关联规则的挖掘方法。     

FINDING SIMPLIFIED FUZZY IF-THEN RULES FOR FUNCTION APPROXIMATION PROBLEMS USING A FUZZY DATA MINING APPROACH

ABSTRACT

A fuzzy if-then rule whose consequent part is a real number is referred to as a simplified fuzzy rule. Since no defuzzification is required for this rule type, it has been widely used in function approximation problems. Furthermore, data mining can be used to discover useful information by exploring and analyzing data. Therefore, this paper proposes a fuzzy data mining approach to discover simplified fuzzy if-then rules from numerical data in order to approximate an unknown mapping from input to output. Since several pre-specified parameters for deriving fuzzy rules are not easily specified, they are automatically determined by the genetic algorithm with binary chromosomes. To evaluate performance of the proposed method, computer simulations are performed on various numerical data sets, showing that the fitting ability and the generalization ability of the proposed method are comparable to the known fuzzy rule-based methods.     

基于改进多层次模糊关联规则的定量数据挖掘算法

针对单一层次结构实现规则提取具有规则提取准确性不高、算法运行时间长、难以满足用户使用需求的问题,提出一种基于改进多层次模糊关联规则的定量数据挖掘算法。采用高频项目集合,通过不断深化迭代的方法形成自顶向下的挖掘过程,整合模糊集合理论、数据挖掘算法以及多层次分类技术,从事务数据集中寻找模糊关联规则,挖掘出储存在多层次结构事务数据库中定量值信息的隐含知识,实现用户的定制化信息挖掘需求。实验结果表明,提出的数据挖掘算法在挖掘精度和运算时间方面相较于其他算法具有突出优势,可为多层次关联规则提取方法的实际应用带来新的发展空间。     

基于命题逻辑的关联规则挖掘算法L-Eclat

关联规则挖掘是数据挖掘领域非常重要的课题,在很多领域被广泛应用。关联规则挖掘算法都需要设置最小支持度和最小置信度。很多国内外学者研究的挖掘算法在这两方面都存在着一些问题,不仅需要大量的领域知识来设置合适的最小支持度,而且其结果集庞大、用户不容易理解。针对关联规则挖掘算法存在的问题,将命题逻辑融合到关联规则算法Eclat中,设计出了基于命题逻辑思想的挖掘算法L-Eclat。实验结果表明,L-Eclat算法压缩了挖掘的规则集,减小了算法的时间消耗,且即使是非常小的支持度也可以得到高质量的关联规则,这在一定程度上解决了支持度设置的问题。     

Multi-objective genetic algorithm based approaches for mining optimized fuzzy association rules

Association rules form one of the most widely used techniques to discover correlations among attribute in a database. So far, some efficient methods have been proposed to obtain these rules with respect to an optimal goal, such as: to maximize the number of large itemsets and interesting rules or the values of support and confidence for the discovered rules. This paper first introduces optimized fuzzy association rule mining in terms of three important criteria; strongness, interestingness and comprehensibility. Then, it proposes multi-objective Genetic Algorithm (GA) based approaches for discovering these optimized rules. Optimization technique according to given criterion may be one of two different forms; The first tries to determine the appropriate fuzzy sets of quantitative attributes in a prespecified rule, which is also called as certain rule. The second deals with finding both uncertain rules and their appropriate fuzzy sets. Experimental results conducted on a real data set show the effectiveness and applicability of the proposed approach.     

基于图像分割的两阶段空间关联规则挖掘算法

关联规则挖掘可以深入发现空间数据间的感兴趣知识。空间数据格式多样、数据量大,现有的算法并不适合。本文以RSI及产量图为数据源,提出了基于图像分割的两阶段空间关联规则挖掘算法,挖掘图像像素颜色值之间的空间关联规则。通过算法分析和实验,该算法是有效、可行的。     

数量关联规则挖掘及其典型算法分析

关联规则的发现是数据挖掘的一个重要方面,而数量关联规则的发现不同于传统的布尔型关联规则。介绍了数量型关联规则挖掘的方法、步骤以及存在的问题,分析了几种具有代表性的数量型关联规则挖掘算法,提出了IQAM算法,并对数量型关联规则的挖掘进行了展望。     

Incremental fuzzy temporal association rule mining using fuzzy grid table

Traditional temporal association rules mining algorithms cannot dynamically update the temporal association rules within the valid time interval with increasing data. In this paper, a new algorithm called incremental fuzzy temporal association rule mining using fuzzy grid table (IFTARMFGT) is proposed by combining the advantages of boolean matrix with incremental mining. First, multivariate time series data are transformed into discrete fuzzy values that contain the time intervals and fuzzy membership. Second, in order to improve the mining efficiency, the concept of boolean matrices was introduced into the fuzzy membership to generate a fuzzy grid table to mine the frequent itemsets. Finally, in view of the Fast UPdate (FUP) algorithm, fuzzy temporal association rules are incrementally mined and updated without repeatedly scanning the original database by considering the lifespan of each item and inheriting the information from previous mining results. The experiments show that our algorithm provides better efficiency and interpretability in mining temporal association rules than other algorithms.

     

模糊分割在关联规则挖掘中的应用

关联是数据挖掘领域的一个重要研究课题.如何有效地推导出关联规则,在过去已经有许多方法相继被提出,但大部分的方法对于数值型数据的处理、渐进式挖掘以及在线挖掘等问题无法有效地同时加以处理.因此,本文通过对单层次关联规则的研究,提出了以模糊分割与数据方阵为基础的算法来解决上述问题.     

An effective parallel approach for genetic-fuzzy data mining

Data mining is most commonly used in attempts to induce association rules from transaction data. In the past, we used the fuzzy and GA concepts to discover both useful fuzzy association rules and suitable membership functions from quantitative values. The evaluation for fitness values was, however, quite time-consuming. Due to dramatic increases in available computing power and concomitant decreases in computing costs over the last decade, learning or mining by applying parallel processing techniques has become a feasible way to overcome the slow-learning problem. In this paper, we thus propose a parallel genetic-fuzzy mining algorithm based on the master–slave architecture to extract both association rules and membership functions from quantitative transactions. The master processor uses a single population as a simple genetic algorithm does, and distributes the tasks of fitness evaluation to slave processors. The evolutionary processes, such as crossover, mutation and production are performed by the master processor. It is very natural and efficient to run the proposed algorithm on the master–slave architecture. The time complexities for both sequential and parallel genetic-fuzzy mining algorithms have also been analyzed, with results showing the good effect of the proposed one. When the number of generations is large, the speed-up can be nearly linear. The experimental results also show this point. Applying the master–slave parallel architecture to speed up the genetic-fuzzy data mining algorithm is thus a feasible way to overcome the low-speed fitness evaluation problem of the original algorithm.