Results 21 to 30 of about 801,363 (206)
A global constraint for closed itemset mining
CoRR, 2016 Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have proven their usefulness and flexibility. But the wide use of reified constraints in current CP approaches raises many difficulties to cope with high dimensional datasets ...
Mehdi Maamar +3 more
openaire +2 more sources
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
On Evaluating Interestingness Measures for Closed Itemsets
, 2014 There are a lot of measures for selecting interesting itemsets. But which one is better? In this paper we introduce a methodology for evaluating interestingness measures. This methodology relies on supervised classification. It allows us to avoid experts and artificial datasets in the evaluation process.
Aleksey Buzmakov 0002 +2 more
openaire +2 more sources
A framework for incremental generation of closed itemsets
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petko Valtchev +2 more
openaire +3 more sources
Incremental Closed Frequent Itemsets Mining-Based Approach Using Maximal Candidates
IEEE AccessIncremental frequent itemset mining aims to efficiently update frequent itemsets without recalculating them from scratch, making it suitable for streaming data and real-time analytics.
Mohammed A. Al-Zeiadi +1 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
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets [PDF]
, 2006 High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to improve the efficiency of hierarchical document clustering. In this paper,
Malik, Hassan H. +3 more
core +1 more source
New and Efficient Algorithms for Producing Frequent Itemsets with the Map-Reduce Framework
Algorithms, 2018 The Map-Reduce (MR) framework has become a popular framework for developing new parallel algorithms for Big Data. Efficient algorithms for data mining of big data and distributed databases has become an important problem.
Yaron Gonen, Ehud Gudes, Kirill Kandalov
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
CLOLINK: An Adapted Algorithm for Mining Closed Frequent Itemsets [PDF]
, 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.
Onashoga, Adebukola, Adebukola Onashoga
core +1 more source