Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions

Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the mining of positive and negative rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. A number of algorithms are wonder performance but produce large number of negative association rule and also suffered from multi-scan problem. The idea of this paper is to eliminate these problems and reduce large number of negative rules. Hence we proposed an improved approach to mine interesting positive and negative rules based on genetic and MLMS algorithm. In this method we used a multi-level multiple support of data table as 0 and 1. The divided process reduces the scanning time of database. The proposed algorithm is a combination of MLMS and genetic algorithm. This paper proposed a new algorithm (MIPNAR_GA) for mining interesting positive and negative rule from frequent and infrequent pattern sets. The algorithm is accomplished in to three phases: a).Extract frequent and infrequent pattern sets by using apriori method b).Efficiently generate positive and negative rule. c).Prune redundant rule by applying interesting measures. The process of rule optimization is performed by genetic algorithm and for evaluation of algorithm conducted the real world dataset such as heart disease data and some standard data used from UCI machine learning repository.

Constructing three-way concept lattices based on apposition and subposition of formal contexts

The redundancy concept has been developed of various approaches. However, these approaches concern only the positive association rules, the negative association rules are less studied, and this, with less selective pair, support-confidence. To do remedy these limits, we propose a new approach allowing to generate all non-redundant positive and negative rules, and this, using the new selective pair, support-\(M_{GK}\).

Inferring programming rules from source code based on data mining techniques has been proven to be effective to detect software bugs. Existing studies focus on discovering positive rules in the form of A ⇒ B, indicating that when operation A appears, operation B should also be here. Unfortunately, the negative rules (A ⇒ ¬ B), indicating the mutual suppression or conflict relationships among program elements, have not gotten the attention they deserve. In fact, violating such negative rules can also result in serious bugs.

Classification using association rules has added a new dimension to the ongoing research for accurate classifiers. Experiments have shown that these classifiers are significantly more accurate than decision tree classifiers. The idea behind most of the existing approaches has been the mining of positive class association rules from the training set and then selecting a subset of the mined rules for future predictions. However, in most cases, it is found that the final classifier contains some weak and inaccurate rules that were selected for covering some training instances for which no better rules were available. These rules make poor predictions of unseen test instances and only for these rules, the overall classification accuracy is drastically reduced. The idea of this paper is to eliminate these weak and inaccurate positive rules as far as possible by accurate negative rules. The generation of negative associations from datasets has been attacked from different perspectives by various authors and this has proved to be a very computationally expensive task. This paper approaches the problem of generating negative rules from a classification perspective, how to generate a sufficient number of high quality negative rules efficiently so that classification accuracy is enhanced. We extend the a priori algorithm for this and show that our classifier ldquoassociative classifier with negative rulesrdquo (ACN) is not only time-efficient but also achieves significantly better accuracy than four other state-of-the-art classification methods by experimenting on benchmark UCI datasets.

Association rule mining is one of the most important data mining techniques. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. All of the literature on negative association mining, to our best knowledge, is confined to the traditional, relatively static database environment, no research work has been conducted on mining negative associations over data streams. In this paper, we propose an algorithm for mining negative associations over data streams. Experiments on the synthetic data stream are performed to show the effectiveness and efficiency of the proposed approach.

Association rule mining is one of the most popular data mining techniques to find associations among items in a set by mining necessary patterns in a large database. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. They are also very useful for constructing associative classifiers. In this paper, we propose an algorithm that mines positive and negative association rules without adding any additional measure and extra database scans.

Association Rule Mining (ARM) is a well recognized and interesting area of research in the field of Data Mining. In ARM, significant amount of research work has been reported. On the contrary, very less work has been reported for Negative Association Rule Mining (NARM). ARM concentrates only on positive rules while NARM explores negative rules. Also, most researchers have worked with discrete transaction dataset. So, in this paper, we propose a technique called Negative and Positive Fuzzy Association Rule Mining (NP-FARM), which mines both negative and positive association rules from a fuzzy transaction dataset. NP-FARM algorithm has been implemented and the experimental results determine the optimal minimum support threshold and optimal minimum confidence threshold for the given dataset. Also, the experimental results demonstrate that, as the size of the dataset increases, a negligible change in execution time is witnessed to mine the growing dataset. Keywords: Association Rule Mining. Fuzzy Transactions, Positive and Negative Item Sets

Association rules mining is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining association rules are built on the binary attributes databases, which has three limitations. Firstly, it can not concern quantitative attributes; secondly, only the positive association rules are discovered; thirdly, it treat each item with the same frequency although different item may have different frequency. In this paper, we put forward a discovery algorithm for mining positive and negative fuzzy association rules to resolve these three limitations.

ObjectiveThis study examines the extent to which children’s positive attributes are distinct from psychopathology. We also investigate whether positive attributes change or “buffer” the impact of low intelligence and high psychopathology on negative educational outcomes.MethodIn a community sample of 2,240 children (6–14 years of age), we investigated associations among positive attributes, psychopathology, intelligence, and negative educational outcomes. Negative educational outcomes were operationalized as learning problems and poor academic performance. We tested the discriminant validity of psychopathology versus positive attributes using confirmatory factor analysis (CFA) and propensity score matching analysis (PSM), and used generalized estimating equations (GEE) models to test main effects and interactions among predictors of educational outcomes.ResultsAccording to both CFA and PSM, positive attributes and psychiatric symptoms were distinct constructs. Positive attributes were associated with lower levels of negative educational outcomes, independent of intelligence and psychopathology. Positive attributes buffer the negative effects of lower intelligence on learning problems, and higher psychopathology on poor academic performance.ConclusionChildren’s positive attributes are associated with lower levels of negative school outcomes. Positive attributes act both independently and by modifying the negative effects of low intelligence and high psychiatric symptoms on educational outcomes. Subsequent research should test interventions designed to foster the development of positive attributes in children at high risk for educational problems.

It is beneficial to automate the process of deriving concept hierarchies from corpora since a manual construction of concept hierarchies is typically a time-consuming and resource-intensive process. As such, the overall process of learning concept hierarchies from corpora encompasses a set of steps: parsing the text into sentences, splitting the sentences and then tokenising it. After the lemmatisation step, the pairs are extracted using formal context analysis (FCA). However, there might be some uninteresting and erroneous pairs in the formal context. Generating formal context may lead to a time-consuming process, so formal context size reduction is require to remove uninterested and erroneous pairs, taking less time to extract the concept lattice and concept hierarchies accordingly. In this premise, this study aims to propose two frameworks: (1) A framework to review the current process of deriving concept hierarchies from corpus utilising formal concept analysis (FCA); (2) A framework to decrease the formal context’s ambiguity of the first framework using an adaptive version of evolutionary clustering algorithm (ECA*). Experiments are conducted by applying 385 sample corpora from Wikipedia on the two frameworks to examine the reducing size of formal context, which leads to yield concept lattice and concept hierarchy. The resulting lattice of formal context is evaluated to the standard one using concept lattice-invariants. Accordingly, the homomorphic between the two lattices preserves the quality of resulting concept hierarchies by 89% in contrast to the basic ones, and the reduced concept lattice inherits the structural relation of the standard one. The adaptive ECA* is examined against its four counterpart baseline algorithms (Fuzzy K-means, JBOS approach, AddIntent algorithm, and FastAddExtent) to measure the execution time on random datasets with different densities (fill ratios). The results show that adaptive ECA* performs concept lattice faster than other mentioned competitive techniques in different fill ratios.

Recently, building associative classifiers by miming association rules is a hot research problem. As negative association rules also help to understand the data, in this paper, we present our InterRBF algorithm, which expands RBF kernel into its Maclaurin series, and then mines positive and negative association rules which make great contribution to classification from this series, so as to learn association classifier from the SVM classification model. Taking {0,1} <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> as input space, we also show the reasonable value field of hyper-parameter g of RBF kernel by applying the theory of Occam's razor, so as to have good classification performance. Experiment results on 6 UCI datasets show that InterRBF could build associative classifiers with better accuracy and smaller size of rule set than ARC-PAN[1], another associative classifier which is also build with both positive and negative association rules. Furthermore, compared with CMAR [3] and CPAR [4], the average accuracy of InterRBF over the 6 datasets also outperforms the two classifiers.

Formal concept analysis (FCA) is an important theory on the study of hierarchical structures caused by a binary relation between objects and attributes. And it is well known that a soft set always induces a binary relationship between objects and attributes for a formal context. Based on these facts, we study a new system called a soft context, which is induced using a soft set instead of a binary relation in the formal context, and investigate its theoretical foundations. First, we introduce the notions of soft context and soft concept for objects and study some basic properties. In particular, for the purpose of studying soft concepts, we introduce and study the notions of independent and dependent soft concepts. And we obtain the important things: (1) the set of all soft concepts can be decomposed into the set of independent soft concepts and the set of dependent soft concepts; (2) every dependent soft concept is generated by some independent soft concepts. Second, we obtain important properties about the relationship between formal context and soft contexts as the following: (1) each formal context always induces an associated soft context; (2) for a given formal context, there exists a bijection between the set of all formal concepts and the set of all soft concepts of the associated soft context induced by the given formal context. And we apply the above-mentioned properties to get the set of all formal concepts of a given formal context and explain that this method is more effective than the traditional way of computing all formal concepts in formal contexts using the example. Finally, we introduce the notion of soft concept lattice. Also, for a given formal context, we show that the formal concept lattice is order-isomorphic to the soft concept lattice of the associated soft context.

The weighted association rules (WARs) mining are made because importance of the items is different. Negative association rules (NARs) play important roles in decision-making. But the misleading rules occur and some rules are uninteresting when discovering positive and negative weighted association rules (PNWARs) simultaneously. So another parameter is added to eliminate the uninteresting rules. A new model in the paper of extending the support-confidence framework with a sliding interest measure could avoid generating misleading rules. An interest measure was defined and added to the mining algorithm for association rules in the model. The interest measure was set according to the demand of users. The experiment demonstrates that the algorithm discovers interesting weighted negative association rules from large database and deletes the contrary rules.

Recently, incomplete formal contexts have received more and more attention from the communities of formal concept analysis. Different from a complete context where the binary relations between all the objects and attribute are known, an incomplete formal context has at least a pair of object and attribute with a completely unknown binary relation. Partially known formal concepts use interval sets to indicate the incompleteness. Three-way formal concept analysis is capable of characterizing a target set by combining positive and negative attributes. However, how to describe target set, by pointing out what attributes it has with certainty and what attributes it has with possibility and what attributes it does not has with certainty and what attributes it does not has with possibility, is still an open problem. This paper combines the ideas of three-way formal concept analysis and partially known formal concepts and presents a framework of approximate three-way concept analysis. At first, approximate object-induced and attribute-induced three-way concept lattices are introduced, respectively. And then, the relationship between approximate three-way concept lattice and classical three-way concept lattice are investigated. Finally, examples are presented to demonstrate and verify the obtained results.