Association Rule Mining Method Research Articles

A RESEARCH ON SPATIAL TOPOLOGICAL ASSOCIATION RULES MINING

Abstract. Spatial association rules mining is a process of acquiring information and knowledge from large databases. Due to the nature of geographic space and the complexity of spatial objects and relations, the classical association rule mining methods are not suitable for the spatial association rule mining. Classical association rule mining treats all input data as independent, while spatial association rules often show high autocorrelation among nearby objects. The contiguous, adjacent and neighboring relations between spatial objects are important topological relations. In this paper a new approach based on topological predictions to discover spatial association rules is presented. First, we develop a fast method to get the topological relationship of spatial data with its algebraic structure. Then the interested spatial objects are selected. To find the interested spatial objects, topological relations combining with distance were used. In this step, the frequent topological predications are gained. Next, the attribute datasets of the selected interested spatial objects are mined with Apriori algorithm. Last, get the spatial topological association rules. The presented approach has been implemented and tested by the data of GDP per capita, railroads and roads in China in the year of 2005 at county level. The results of the experiments show that the approach is effective and valid.

Mining Interesting Association Rules of Students Suffering Study Anxieties Using SLP-Growth Algorithm

One of the most popular techniques used in data mining applications is association rules mining. The purpose of this study is to apply an enhanced association rules mining method, called SLP-Growth (Significant Least Pattern Growth) for capturing interesting rules from students suffering mathematics and examination anxieties datasets. The datasets were taken from a survey exploring study anxieties among engineering students in Universiti Malaysia Pahang (UMP). The results of this research provide useful information for educators to make decisions on their students more accurately and adapt their teaching strategies accordingly. It also can assist students in handling their fear of mathematics and examination and increase the quality of learning.

An Effective Method for Association Rule Mining based on Transactional Matrix

of this paper is to present a new method based on transactional matrix for finding association rules more efficiently. Apriori algorithm is one of the classical algorithms for finding association rules, but it has limitations of number of times database scanned is too large and number of candidate itemsets generated is large.To reduce these two limitations a new method tries to find the association rules directly from a matrix which is generated from the transactional database . Keywords— Apriori algorithm, Association rule, Frequent itemsets, Transactional matrix generated in pruning operation, by applying transaction tag method. Dongme Sun, Sheohue Teng and et.al (5) presented a new technique based on forward and reverse scan of database. It produces the frequent itemsets more efficiently if applied with certain satisfying conditions. Sixue Bai, Xinxi Dai (6) presented a method called P-matrix algorithm to generate the frequent itemsets. It is found that the P-Matrix algorithm is more efficient and fast algorithm than Apriori algorithm to generate frequent itemsets. In this paper, a new method based on transactional matrix is presented to find the association rules from the large transactional database. In this approach a transactional matrix is generated directly from the database and then frequent itemsets and support of each frequent itemset is generated directly from the transactional matrix . It is found that the new proposed approach finds the frequent itemsets more efficiently. The performance of new method is compared with that of Apriori algorithm with the help of an example.

Who receives prescriptions for smoking cessation medications? An association rule mining analysis using a large primary care database

AimsTo use association rule mining methods to investigate prescribing of smoking cessation medication in the UK primary care and to identify the characteristics of numerically important groups of patients who...

Towards an effective automatic query expansion process using an association rule mining approach

The steady growth in the size of textual document collections is a key progress-driver for modern information retrieval techniques whose effectiveness and efficiency are constantly challenged. Given a user query, the number of retrieved documents can be overwhelmingly large, hampering their efficient exploitation by the user. In addition, retaining only relevant documents in a query answer is of paramount importance for an effective meeting of the user needs. In this situation, the query expansion technique offers an interesting solution for obtaining a complete answer while preserving the quality of retained documents. This mainly relies on an accurate choice of the added terms to an initial query. Interestingly enough, query expansion takes advantage of large text volumes by extracting statistical information about index terms co-occurrences and using it to make user queries better fit the real information needs. In this respect, a promising track consists in the application of data mining methods to the extraction of dependencies between terms. In this paper, we present a novel approach for mining knowledge supporting query expansion that is based on association rules. The key feature of our approach is a better trade-off between the size of the mining result and the conveyed knowledge. Thus, our association rules mining method implements results from Galois connection theory and compact representations of rules sets in order to reduce the huge number of potentially useful associations. An experimental study has examined the application of our approach to some real collections, whereby automatic query expansion has been performed. The results of the study show a significant improvement in the performances of the information retrieval system, both in terms of recall and precision, as highlighted by the carried out significance testing using the Wilcoxon test.

Compact Weighted Class Association Rule Mining Using Information Gain

Weighted association rule mining reflects semantic significance of item by considering its weight. Classification constructs the classifier and predicts the new data instance. This paper proposes compact weighted class association rule mining method, which applies weighted association rule mining in the classification and constructs an efficient weighted associative classifier. This proposed associative classification algorithm chooses one non class informative attribute from dataset and all the weighted class association rules are generated based on that attribute. The weight of the item is considered as one of the parameter in generating the weighted class association rules. This proposed algorithm calculates the weight using the HITS model. Experimental results show that the proposed system generates less number of high quality rules which improves the classification accuracy.

Compact Weighted Class Association Rule Mining Using Information Gain

Weighted association rule mining reflects semantic significance of item by considering its weight. Classification constructs the classifier and predicts the new data instance. This paper proposes compact weighted class association rule mining method, which applies weighted association rule mining in the classification and constructs an efficient weighted associative classifier. This proposed associative classification algorithm chooses one non class informative attribute from dataset and all the weighted class association rules are generated based on that attribute. The weight of the item is considered as one of the parameter in generating the weighted class association rules. This proposed algorithm calculates the weight using the HITS model. Experimental results show that the proposed system generates less number of high quality rules which improves the classification accuracy.

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.

An improved association rules mining method

Mining maximal frequent itemsets is of paramount relevance in many of data mining applications. The “traditional” algorithms address this problem through scanning databases many times. The latest research has already focused on reducing the number of scanning times of databases and then decreasing the number of accessing times of I/O resources in order to improve the overall mining efficiency of maximal frequent itemsets of association rules. In this paper, we present a form of the directed itemsets graph to store the information of frequent itemsets of transaction databases, and give the trifurcate linked list storage structure of directed itemsets graph. Furthermore, we develop the mining algorithm of maximal frequent itemsets based on this structure. As a result, one realizes scanning a database only once, and improves storage efficiency of data structure and time efficiency of mining algorithm.

Application of Cloud Theory in Association Rules

The data mining is to discover knowledge from the database, quantitative association rules mining method is difficult for their values are too large. The usual means is dividing quantitative Data to discrete conception. The Cloud model combines fuzziness and randomness organically, so it fits the real world objectively, a new method to mine association rules from quantitative data based on the cloud model was proposed, which first take the original data distribution in the database into account, and then use the trapezoidal cloud model to complicate concepts division, and transforms qualitative data to the quantitative concept, in the conversion take account of the basic characteristics of human behavior fully, divides quantitative Data with trapezium Cloud model to create discreet concepts, the concept cluster within one class, and separated with each other. So the quantitative Data can be transforms to Boolean data well, the Boolean data can be mined by the mature Boolean association rules mining method to find useful knowledge.

Finding association rules in semantic web data

The amount of ontologies and semantic annotations available on the Web is constantly growing. This new type of complex and heterogeneous graph-structured data raises new challenges for the data mining community. In this paper, we present a novel method for mining association rules from semantic instance data repositories expressed in RDF/(S) and OWL. We take advantage of the schema-level (i.e. Tbox) knowledge encoded in the ontology to derive appropriate transactions which will later feed traditional association rules algorithms. This process is guided by the analyst requirements, expressed in the form of query patterns. Initial experiments performed on semantic data of a biomedical application show the usefulness and efficiency of the approach.

MBFP generalized association rule mining and classification in traffic volume prediction

AbstractGenetic network programming (GNP)‐based time‐related association rules mining method provides a useful mean to investigate future traffic volume of road networks and hence helps us to develop traffic navigation system. Further improvements have been proposed in this paper about the time‐related association rule mining using generalized GNP with multibranches and full‐paths (MBFP) algorithm. For fully utilizing the potential ability of GNP structure, the mechanism of generalized GNP with MBFP is studied. The aim of this algorithm is to better handle association rule extraction from the databases with high efficiency in a variety of time‐related applications, especially in the traffic volume prediction problems. The generalized algorithm which can find the important time‐related association rules is described, and experimental results are presented considering a traffic prediction problem. © 2011 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

A novel evolutionary method to search interesting association rules by keywords

In this paper, we propose an evolutionary method for directly mining interesting association rules. Most of the association rule mining methods give a large number of rules, and it is difficult for human beings to deal with them. We study this problem by borrowing the style of search engine, that is, searching association rules by keywords. Whether a rule is interesting or not is decided by its relation to the keywords, and we introduce both semantic and statistical methods to measure such relation. The mining process is built on an evolutionary approach, Genetic Network Programming (GNP). Different from the conventional GNP based association rule mining method, the proposed method pays more attention to generate the GNP individuals carefully, which will mine interesting association rules efficiently. After the rules are generated, they will be ranked and annotated by meaningful information, such as similar rules and representative transactions, in order to help the user to understand the rules better. We also discuss how to mine generalized interesting association rules, describing more abstract level of information than the common association rules. In the simulation section, we give some demonstrations of the proposed method using a census data set, which shows a promising way to find the interesting association rules.

Fundamentals of association rules in data mining and knowledge discovery

AbstractAssociation rule mining is one of the fundamental research topics in data mining and knowledge discovery that identifies interesting relationships between itemsets in datasets and predicts the associative and correlative behaviors for new data. Rooted in market basket analysis, there are a great number of techniques developed for association rule mining. They include frequent pattern discovery, interestingness, complex associations, and multiple data source mining. This paper introduces the up‐to‐date prevailing association rule mining methods and advocates the mining of complete association rules, including both positive and negative association rules. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 97‐116 DOI: 10.1002/widm.10This article is categorized under: Algorithmic Development > Association Rules

An Improved Association Rules Algorithm Based on Frequent Item Sets

In this paper, based on the concept of Apriori algorithm for frequent itemsets, adding the element vector, sub-rule and parent-rule, an improved algorithm about association rules mining is proposed. This method overcomes the lack of traditional association rule mining method. It mines the rules while generating the frequent item sets, so the mining efficiency has been improved well.

A Quantum Swarm Evolutionary Algorithm for mining association rules in large databases

Association rule mining aims to extract the correlation or causal structure existing between a set of frequent items or attributes in a database. These associations are represented by mean of rules. Association rule mining methods provide a robust but non-linear approach to find associations. The search for association rules is an NP-complete problem. The complexities mainly arise in exploiting huge number of database transactions and items. In this article we propose a new algorithm to extract the best rules in a reasonable time of execution but without assuring always the optimal solutions. The new derived algorithm is based on Quantum Swarm Evolutionary approach; it gives better results compared to genetic algorithms.

An improved frequent pattern growth method for mining association rules

Many algorithms have been proposed to efficiently mine association rules. One of the most important approaches is FP-growth. Without candidate generation, FP-growth proposes an algorithm to compress information needed for mining frequent itemsets in FP-tree and recursively constructs FP-trees to find all frequent itemsets. Performance results have demonstrated that the FP-growth method performs extremely well. In this paper, we propose the IFP-growth (improved FP-growth) algorithm to improve the performance of FP-growth. There are three major features of IFP-growth. First, it employs an address-table structure to lower the complexity of forming the entire FP-tree. Second, it uses a new structure called FP-tree+ to reduce the need for building conditional FP-trees recursively. Third, by using address-table and FP-tree+ the proposed algorithm has less memory requirement and better performance in comparison with FP-tree based algorithms. The experimental results show that the IFP-growth requires relatively little memory space during the mining process. Even when the minimum support is low, the space needed by IFP-growth is about one half of that of FP-growth and about one fourth of that of nonordfp algorithm. As to the execution time, our method outperforms FP-growth by one to 300 times under different minimum supports. The proposed algorithm also outperforms nonordfp algorithm in most cases. As a result, IFP-growth is very suitable for high performance applications.

Identifying changes and trends in Hong Kong outbound tourism

Despite the numerous research endeavors aimed at investigating tourists’ preferences and motivations, it remains very difficult for practitioners to utilize the results of traditional association rule mining methods in tourism management. This research presents a new approach that extends the capability of the association rules technique to contrast targeted association rules with the aim of capturing the changes and trends in outbound tourism. Using datasets collected from five large-scale domestic tourism surveys of Hong Kong residents on outbound pleasure travel, both positive and negative contrasts are identified, thus enabling practitioners and policymakers to make appropriate decisions and develop more appropriate tourism products.

A NOVEL PRIVACY-PRESERVING ASSOCIATION RULES MINING METHOD

In order to mine association rules accurately and efficiently while preserving the privacy thereof, a novel privacy-preserving association rules mining method is proposed in this paper. Known as the partial randomized response based on probability matrix, or PRRPM, this method chooses different data transition strategies to find frequent 1-itemsets and k-itemsets (k > 1). The PRRPM algorithm is explored and its validity examined through theoretical analysis and experiments.

Discovery of Association Rules between TCM Properties in Drug Pairs by Association Mining between Datasets and Probability Tests

Abstract Crude Drug Pairs in Traditional Chinese medicine (TCM) constitute an important link node between TCM drugs and medicinal formulae. In TCM theory, there are many descriptions regarding the multiple aspects of medicines. However, they seem still scattered compared to the formulae theories. In this article, the association-rule mining method was applied to discover the meaningful associations with reference to the structure of a crude drug-pair. Standard and enhanced Apriori algorithms were applied and run on the crude drug-pair database, including 625 drug pairs, 347 drugs, and 49 properties. The results from the two algorithms were compared and analyzed, and the new enhanced Apriori algorithm was found to be more suitable for the detection of association between drugs in a drug pair or formulae.