Results 11 to 20 of about 1,634,075 (173)
arules - A Computational Environment for Mining Association Rules and Frequent Item Sets [PDF]
Journal of Statistical Software, 2005 Mining frequent itemsets and association rules is a popular and well researched approach for discovering interesting relationships between variables in large databases.
Michael Hahsler +2 more
doaj +2 more sources
Discovering Frequent Closed Itemsets for Association Rules [PDF]
, 1999 In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we show that this problem can be reduced to the problem of finding frequent closed itemsets. Based on this statement, we can construct efficient data mining algorithms by limiting the search space to the closed itemset lattice ...
Pasquier, Nicolas +3 more
core +5 more sources
Theoretical Properties of Closed Frequent Itemsets in Frequent Pattern Mining
MathematicsClosed frequent itemsets (CFIs) play a crucial role in frequent pattern mining by providing a compact and complete representation of all frequent itemsets (FIs).
Huina Zhang +4 more
doaj +2 more sources
CLOLINK: An Adapted Algorithm for Mining Closed Frequent Itemsets [PDF]
Journal of computing and information technology, 2012 Mining of the complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of closed frequent itemsets, which results in a much smaller number of itemsets. Methods for efficient mining of closed frequent itemsets have been studied extensively by many researchers using various ...
Onashoga, Adebukola, Adebukola Onashoga
openaire +4 more sources
Efficiently mining association rules based on maximum single constraints
Vietnam Journal of Computer Science, 2017 A serious problem encountered during the mining of association rules is the exponential growth of their cardinality. Unfortunately, the known algorithms for mining association rules typically generate scores of redundant and duplicate rules. Thus, we not
Anh Tran, Tin Truong, Bac Le
doaj +1 more source
An efficient colossal closed itemset mining algorithm for a dataset with high dimensionality
Journal of King Saud University: Computer and Information Sciences, 2022 The greater interest of research in the field of bioinformatics and the ample amount of available data across the different domains paved the way for the generation of the dataset with high dimensionality.
Manjunath K. Vanahalli, Nagamma Patil
doaj +1 more source
Closed Frequent Itemset Mining with Arbitrary Side Constraints [PDF]
2018 IEEE International Conference on Data Mining Workshops (ICDMW), 2018 Frequent itemset mining (FIM) is a method for finding regularities in transaction databases. It has several application areas, such as market basket analysis, genome analysis, and drug design. Finding frequent itemsets allows further analysis to focus on a small subset of the data.
Gokberk Kocak +3 more
openaire +3 more sources
An Efficient Method for Mining Closed Potential High-Utility Itemsets
IEEE Access, 2020 High-utility itemset mining (HUIM) has become a key phase of the pattern mining process, which has wide applications, related to both quantities and profits of items. Many algorithms have been proposed to mine high-utility itemsets (HUIs).
Bay Vo +5 more
doaj +1 more source
Modified GUIDE (LM) algorithm for mining maximal high utility patterns from data streams [PDF]
International Journal of Computational Intelligence Systems, 2015 High utility pattern mining is an emerging research topic in the data mining field. Unlike frequent pattern mining, high utility pattern mining deals with non-binary databases, in which the information about purchased quantities of items is maintained ...
Chiranjeevi Manike, Hari Om
doaj +1 more source
TT-Miner: Topology-Transaction Miner for Mining Closed Itemset
IEEE Access, 2019 Mining frequent closed itemsets (FCIs) from transaction databases is a fundamental problem in many data mining applications. All the enumeration algorithms enumerate FCIs by adding a singleton item to an itemset and then checking whether it is closure ...
Bo Li +3 more
doaj +1 more source