Mining high utility itemsets without candidate generation

M Liu, J Qu - Proceedings of the 21st ACM international conference …, 2012 - dl.acm.org
High utility itemsets refer to the sets of items with high utility like profit in a database, and
efficient mining of high utility itemsets plays a crucial role in many real-life applications and …

[KNJIGA][B] Contrast data mining: concepts, algorithms, and applications

G Dong, J Bailey - 2012 - books.google.com
A Fruitful Field for Researching Data Mining Methodology and for Solving Real-Life
Problems Contrast Data Mining: Concepts, Algorithms, and Applications collects recent …

Mining dominant patterns in the sky

A Soulet, C Raïssi, M Plantevit… - 2011 IEEE 11th …, 2011 - ieeexplore.ieee.org
Pattern discovery is at the core of numerous data mining tasks. Although many methods
focus on efficiency in pattern mining, they still suffer from the problem of choosing a …

Efficient algorithms for high utility itemset mining without candidate generation

JF Qu, M Liu, P Fournier-Viger - High-utility pattern mining: theory …, 2019 - Springer
High utility itemsets are sets of items having a high utility or profit in a database. Efficiently
discovering high utility itemsets plays a crucial role in real-life applications such as market …

[HTML][HTML] Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems

W Ugarte, P Boizumault, B Crémilleux, A Lepailleur… - Artificial Intelligence, 2017 - Elsevier
Data mining is the study of how to extract information from data and express it as useful
knowledge. One of its most important subfields, pattern mining, involves searching and …

Contextual preference mining for user profile construction

S De Amo, MS Diallo, CT Diop, A Giacometti, D Li… - Information Systems, 2015 - Elsevier
The emerging of ubiquitous computing technologies in recent years has given rise to a new
field of research consisting in incorporating context-aware preference querying facilities in …

Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts

T Hamrouni, SB Yahia, EM Nguifo - Information Sciences, 2013 - Elsevier
It is widely recognized that the performances of frequent-pattern mining algorithms are
closely dependent on data being handled, ie, sparse or dense. The same situation applies …

Bridging conjunctive and disjunctive search spaces for mining a new concise and exact representation of correlated patterns

NB Younes, T Hamrouni, SB Yahia - … , October 6-8, 2010. Proceedings 13, 2010 - Springer
In the literature, many works were interested in mining frequent patterns. Unfortunately,
these patterns do not offer the whole information about the correlation rate amongst the …

Efficiently depth-first minimal pattern mining

A Soulet, F Rioult - Advances in Knowledge Discovery and Data Mining …, 2014 - Springer
Condensed representations have been studied extensively for 15 years. In particular, the
maximal patterns of the equivalence classes have received much attention with very general …

Swee** the disjunctive search space towards mining new exact concise representations of frequent itemsets

T Hamrouni, SB Yahia, EM Nguifo - Data & Knowledge Engineering, 2009 - Elsevier
Concise (or condensed) representations of frequent patterns follow the minimum description
length (MDL) principle, by providing the shortest description of the whole set of frequent …