Applications of description logics: State of the art and research challenges

I Horrocks - International Conference on Conceptual Structures, 2005 - Springer
Logics (DLs) are a family of class based knowledge representation formalisms characterised
by the use of various constructors to build complex classes from simpler ones, and by an …

Intelligent structuring and reducing of association rules with formal concept analysis

G Stumme, R Taouil, Y Bastide, N Pasquier… - KI 2001: Advances in …, 2001 - Springer
Association rules are used to investigate large databases. The analyst is usually confronted
with large lists of such rules and has to find the most relevant ones for his purpose. Based on …

Frequent closed itemset based algorithms: A thorough structural and analytical survey

SB Yahia, T Hamrouni, EM Nguifo - ACM sIGKDD Explorations …, 2006 - dl.acm.org
As a side effect of the digitalization of unprecedented amount of data, traditional retrieval
tools proved to be unable to extract hidden and valuable knowledge. Data Mining, with a …

Data mining combined to the multicriteria decision analysis for the improvement of road safety: case of France

FZ El Mazouri, MC Abounaima, K Zenkouar - Journal of Big Data, 2019 - Springer
Introduction The problem studied in this paper is the road insecurity, which is manifested by
the big number of injuries and deaths recorded annually around the world. These victims of …

Concise representation of frequent patterns based on disjunction-free generators

M Kryszkiewicz - … 2001 IEEE international conference on data …, 2001 - ieeexplore.ieee.org
Many data mining problems require the discovery of frequent patterns in order to be solved.
Frequent itemsets are useful in the discovery of association rules, episode rules, sequential …

[HTML][HTML] Symbolic data mining methods with the Coron platform

L Szathmary - 2006 - hal.univ-lorraine.fr
The main topic of this thesis is knowledge discovery in databases (KDD). More precisely, we
have investigated two of the most important tasks of KDD today, namely itemset extraction …

Learning search control knowledge for equational theorem proving

S Schulz - Annual Conference on Artificial Intelligence, 2001 - Springer
One of the major problems in clausal theorem proving is the control of the proof search. In
the presence of equality, this problem is particularly hard, since nearly all state-of-the-art …

Pascal: un algorithme d'extraction des motifs fréquents

Y Bastide, R Taouil, N Pasquier, G Stumme… - Revue des Sciences et …, 2002 - hal.science
Nous proposons dans cet article l'algorithme Pascal qui introduit une nouvelle optimisation
de l'algorithme de référence Apriori. Cette optimisation est fondée sur le comptage des …

A new generic basis of “factual” and “implicative” association rules

SB Yahia, G Gasmi, EM Nguifo - Intelligent Data Analysis, 2009 - journals.sagepub.com
The extremely large number of association rules that can be drawn from–even reasonably
sized datasets, bootstrapped the development of more acute techniques or methods to …

Comparative survey of association rule mining algorithms based on multiple-criteria decision analysis approach

AM Addi, A Tarik, G Fatima - 2015 3rd International Conference …, 2015 - ieeexplore.ieee.org
Mining association rules is a leading task, which attracted the attention of researchers, it is
one of the technical potential of data mining that allows discovered correlations and …