Results 181 to 190 of about 659,904 (212)
Some of the next articles are maybe not open access.
2009 International Conference on Machine Learning and Cybernetics, 2009
In this paper, we introduce a new kind of mining problem — - mining erasable itemsets, which is de-rived from planning products of the manufacturing industry. For this problem, we first present the formal definition of mining erasable itemsets and discuss some basic properties of the problem.
null Zhi-Hong Deng +3 more
openaire +1 more source
In this paper, we introduce a new kind of mining problem — - mining erasable itemsets, which is de-rived from planning products of the manufacturing industry. For this problem, we first present the formal definition of mining erasable itemsets and discuss some basic properties of the problem.
null Zhi-Hong Deng +3 more
openaire +1 more source
Misleading Generalized Itemset Mining in the Cloud
2014 IEEE International Symposium on Parallel and Distributed Processing with Applications, 2014In the era of smart cities huge data volumes are continuously generated and collected, thus prompting the need for efficient and distributed data mining approaches. Generalized itemset mining is an established data mining technique, which entails the discovery of multiple-level patterns hidden in the analyzed data by exploiting analyst-provided ...
BARALIS, ELENA MARIA +6 more
openaire +3 more sources
On a visual frequent itemset mining
2009 Fourth International Conference on Digital Information Management, 2009Given a large, dense transaction database, generating interesting frequent patterns in a user friendly manner remains as an important issue in data mining. It is because the minimum support, the most popular statistical significance measurement, is not capable of reflecting the domain user's interest. This paper presents visual frequent itemset mining (
openaire +2 more sources
Mining Frequent and Homogeneous Closed Itemsets
2016It is well known that when mining frequent itemsets from a transaction database, the output is usually too large to be effectively exploited by users. To cope with this difficulty, several forms of condensed representations of the set of frequent itemsets have been proposed, among which the notion of closure is one of the most popular.
Inès Hilali +4 more
openaire +2 more sources
2019
We present a survey of the most important algorithms that have been proposed in the context of the frequent itemset mining. We start with an introduction and overview of basic sequential algorithms, and then discuss and compare different parallel approaches based on shared-memory, message-passing, map-reduce, and the use of GPU accelerators.
Cafaro, Massimo, Pulimeno, Marco
openaire +2 more sources
We present a survey of the most important algorithms that have been proposed in the context of the frequent itemset mining. We start with an introduction and overview of basic sequential algorithms, and then discuss and compare different parallel approaches based on shared-memory, message-passing, map-reduce, and the use of GPU accelerators.
Cafaro, Massimo, Pulimeno, Marco
openaire +2 more sources
Sixth International Conference on Machine Learning and Applications (ICMLA 2007), 2007
Mehdi Adda, Lei Wu, Yi Feng
openaire +2 more sources
Mehdi Adda, Lei Wu, Yi Feng
openaire +2 more sources
Symmetry Breaking in Itemset Mining
Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, 2014Belaïd Benhamou +3 more
openaire +1 more source
H-Map-Based Technique for Mining High Average Utility Itemset
IETE Journal of Research, 2023Bhuvaneswari Soundararajan +1 more
exaly
Utility-Oriented Gradual Itemsets Mining Using High Utility Itemsets Mining
2023Priscile Audrey Fongue Assondji +2 more
openaire +2 more sources