oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Algorithm for Efficient Multilevel Association Rule Mining
Pratima Gautam,,Pratima Gautam
International Journal on Computer Science and Engineering , 2010,
Abstract: over the years, a variety of algorithms for finding frequent item sets in very large transaction databases have been developed. The problems of finding frequent item sets are basic in multi level association rule mining, fast algorithms for solving problems are needed. This paper presents an efficient version of apriori algorithm for mining multi-level association rules in large databases to finding maximum frequent itemset at lower level of abstraction. We propose a new, fast and an efficient algorithm (SC-BF Multilevel) with single scan of database for mining complete frequent item sets. To reduce the execution time and increase throughput in new method. Our proposed algorithm works well comparison with general approach of multilevel association rules.
A Model for Mining Multilevel Fuzzy Association Rule in Database  [PDF]
Pratima Gautam,Neelu Khare,K. R. Pardasani
Computer Science , 2010,
Abstract: The problem of developing models and algorithms for multilevel association mining pose for new challenges for mathematics and computer science. These problems become more challenging, when some form of uncertainty like fuzziness is present in data or relationships in data. This paper proposes a multilevel fuzzy association rule mining models for extracting knowledge implicit in transactions database with different support at each level. The proposed algorithm adopts a top-down progressively deepening approach to derive large itemsets. This approach incorporates fuzzy boundaries instead of sharp boundary intervals. An example is also given to demonstrate that the proposed mining algorithm can derive the multiple-level association rules under different supports in a simple and effective manner.
An Efficient Algorithm for Mining Multilevel Association Rule Based on Pincer Search  [PDF]
Pratima Gautam,Rahul Shukla
International Journal of Computer Science Issues , 2012,
Abstract: Discovering frequent itemset is a key difficulty in significant data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. The problem of developing models and algorithms for multilevel association mining poses for new challenges for mathematics and computer science. In this paper, we present a model of mining multilevel association rules which satisfies the different minimum support at each level, we have employed princer search concepts, multilevel taxonomy and different minimum supports to find multilevel association rules in a given transaction data set. This search is used only for maintaining and updating a new data structure. It is used to prune early candidates that would normally encounter in the top-down search. A main characteristic of the algorithms is that it does not require explicit examination of every frequent itemsets, an example is also given to demonstrate and support that the proposed mining algorithm can derive the multiple-level association rules under different supports in a simple and effective manner.
An Efficient Algorithm for Mining Multilevel Association Rule Based on Pincer Search  [PDF]
Pratima Gautam,Rahul Shukla
Computer Science , 2012,
Abstract: Discovering frequent itemset is a key difficulty in significant data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. The problem of developing models and algorithms for multilevel association mining poses for new challenges for mathematics and computer science. In this paper, we present a model of mining multilevel association rules which satisfies the different minimum support at each level, we have employed princer search concepts, multilevel taxonomy and different minimum supports to find multilevel association rules in a given transaction data set. This search is used only for maintaining and updating a new data structure. It is used to prune early candidates that would normally encounter in the top-down search. A main characteristic of the algorithms is that it does not require explicit examination of every frequent itemsets, an example is also given to demonstrate and support that the proposed mining algorithm can derive the multiple-level association rules under different supports in a simple and effective manner
Fast rule-based bioactivity prediction using associative classification mining
Yu Pulan,Wild David J
Journal of Cheminformatics , 2012, DOI: 10.1186/1758-2946-4-29
Abstract: Relating chemical features to bioactivities is critical in molecular design and is used extensively in the lead discovery and optimization process. A variety of techniques from statistics, data mining and machine learning have been applied to this process. In this study, we utilize a collection of methods, called associative classification mining (ACM), which are popular in the data mining community, but so far have not been applied widely in cheminformatics. More specifically, classification based on predictive association rules (CPAR), classification based on multiple association rules (CMAR) and classification based on association rules (CBA) are employed on three datasets using various descriptor sets. Experimental evaluations on anti-tuberculosis (antiTB), mutagenicity and hERG (the human Ether-a-go-go-Related Gene) blocker datasets show that these three methods are computationally scalable and appropriate for high speed mining. Additionally, they provide comparable accuracy and efficiency to the commonly used Bayesian and support vector machines (SVM) methods, and produce highly interpretable models.
Interestingness Measure for Mining Spatial Gene Expression Data using Association Rule  [PDF]
M. Anandhavalli,M. K. Ghose,K. Gauthaman
Computer Science , 2010,
Abstract: The search for interesting association rules is an important topic in knowledge discovery in spatial gene expression databases. The set of admissible rules for the selected support and confidence thresholds can easily be extracted by algorithms based on support and confidence, such as Apriori. However, they may produce a large number of rules, many of them are uninteresting. The challenge in association rule mining (ARM) essentially becomes one of determining which rules are the most interesting. Association rule interestingness measures are used to help select and rank association rule patterns. Besides support and confidence, there are other interestingness measures, which include generality reliability, peculiarity, novelty, surprisingness, utility, and applicability. In this paper, the application of the interesting measures entropy and variance for association pattern discovery from spatial gene expression data has been studied. In this study the fast mining algorithm has been used which produce candidate itemsets and it spends less time for calculating k-supports of the itemsets with the Boolean matrix pruned, and it scans the database only once and needs less memory space. Experimental results show that using entropy as the measure of interest for the spatial gene expression data has more diverse and interesting rules.
Research on Fast Association Rule Mining Algorithm
快速关联规则挖掘算法研究

GAO Jun,SHI Bai-Le Dept of Computer Science,
高俊
,施伯乐

计算机科学 , 2005,
Abstract: Based on fully analyzing the FP__growth, an association rule mining algorithm, this paper present a new as- sociation rule mining algorithm called MFP. The MFP algorithm can convert a transaction database into a MFP tree through scanning the database only once, and then do the mining of the tree.
A Survey of Efficient Algorithms and New Approach for Fast Discovery of Frequent Itemset for Association Rule Mining (DFIARM)  [PDF]
Anurag Choubey,Ravindra Patel,J.L. Rana
International Journal of Soft Computing & Engineering , 2011,
Abstract: The problem of mining association rules has attracted lots of attention in the research community. Several techniques for efficient discovery of association rule have appeared. With abundant literature published in research into frequent itemset mining and deriving association rules, if the question is raised that whether we have solved most of the critical problems related to frequent itemset mining and association rule discovery. Based on the scope of the recent literature, the answer will be negative. One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset of items (called candidates) in the database of transactions. Can one develop a method that may avoid or reduce candidate generation and test and utilize some novel data structures to reduce the cost in frequent pattern mining? This is the motivation of my study for mining frequent-itemsets and association rules is a popular and well researched approach for discovering interesting relationships between variables in large databases.
Stability of Boolean Multilevel Networks  [PDF]
Emanuele Cozzo,Alex Arenas,Yamir Moreno
Quantitative Biology , 2012, DOI: 10.1103/PhysRevE.86.036115
Abstract: The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semi-annealed approximation to study the stability properties of Random Boolean Networks in multiplex (multi-layered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.
On Solving Boolean Multilevel Optimization Problems  [PDF]
Josep Argelich,Ines Lynce,Joao Marques-Silva
Computer Science , 2009,
Abstract: Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each individual optimization problem, such that the solution of the resulting aggregated optimization problem solves the original set of hierarchically dependent optimization problems. This paper starts by studying the package upgradeability problem in software distributions. Straightforward solutions based on Maximum Satisfiability (MaxSAT) and pseudo-Boolean (PB) optimization are shown to be ineffective, and unlikely to scale for large problem instances. Afterwards, the package upgradeability problem is related to multilevel optimization. The paper then develops new algorithms for Boolean Multilevel Optimization (BMO) and highlights a large number of potential applications. The experimental results indicate that the proposed algorithms for BMO allow solving optimization problems that existing MaxSAT and PB solvers would otherwise be unable to solve.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.