Top 10 algorithms in data mining

X Wu, V Kumar, J Ross Quinlan, J Ghosh… - … and information systems, 2008 - Springer
This paper presents the top 10 data mining algorithms identified by the IEEE International
Conference on Data Mining (ICDM) in December 2006: C4. 5, k-Means, SVM, Apriori, EM …

A traffic motion object extraction algorithm

S Wu - International Journal of Bifurcation and Chaos, 2015 - World Scientific
A motion object extraction algorithm based on the active contour model is proposed. Firstly,
moving areas involving shadows are segmented with the classical background difference …

[PDF][PDF] LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets

T Uno, M Kiyomi, H Arimura - Fimi, 2004 - philippe-fournier-viger.com
For a transaction database, a frequent itemset is an itemset included in at least a specified
number of transactions. A frequent itemset P is maximal if P is included in no other frequent …

Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining

T Uno, M Kiyomi, H Arimura - … of the 1st international workshop on open …, 2005 - dl.acm.org
For a transaction database, a frequent itemset is an itemset included in at least a specified
number of transactions. To find all the frequent itemsets, the heaviest task is the computation …

Formal concept analysis: from knowledge discovery to knowledge processing

S Ferré, M Huchard, M Kaytoue, SO Kuznetsov… - A Guided Tour of …, 2020 - Springer
In this chapter, we introduce Formal Concept Analysis (FCA) and some of its extensions.
FCA is a formalism based on lattice theory aimed at data analysis and knowledge …

Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases

NT Tung, LTT Nguyen, TDD Nguyen, P Fourier-Viger… - Information …, 2022 - Elsevier
In contrast to frequent itemset mining (FIM) algorithms that focus on identifying itemsets with
high occurrence frequency, high-utility itemset mining algorithms can reveal the most …

Direct local pattern sampling by efficient two-step random procedures

M Boley, C Lucchese, D Paurat, T Gärtner - Proceedings of the 17th ACM …, 2011 - dl.acm.org
We present several exact and highly scalable local pattern sampling algorithms. They can
be used as an alternative to exhaustive local pattern discovery methods (eg, frequent set …

DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets

B Vo, TP Hong, B Le - Expert Systems with Applications, 2012 - Elsevier
Frequent closed itemsets (FCI) play an important role in pruning redundant rules fast.
Therefore, a lot of algorithms for mining FCI have been developed. Algorithms based on …

Fast and memory-efficient significant pattern mining via permutation testing

F Llinares-López, M Sugiyama, L Papaxanthos… - Proceedings of the 21th …, 2015 - dl.acm.org
We present a novel algorithm for significant pattern mining, Westfall-Young light. The target
patterns are statistically significantly enriched in one of two classes of objects. Our method …

Efficient mining of the most significant patterns with permutation testing

L Pellegrina, F Vandin - Proceedings of the 24th ACM SIGKDD …, 2018 - dl.acm.org
The extraction of patterns displaying significant association with a class label is a key data
mining task with wide application in many domains. We study a variant of the problem that …