Unveiling the Negative Customer Experience in Diagnostic Centers: A Data Mining Approach. [PDF]
Agarwal S +3 more
europepmc +1 more source
Using Association Rules to Obtain Sets of Prevalent Symptoms throughout the COVID-19 Pandemic: An Analysis of Similarities between Cases of COVID-19 and Unspecified SARS in São Paulo-Brazil. [PDF]
Marques JG +3 more
europepmc +1 more source
Research on rapid construction methods and evaluation of health education resources in public health emergencies based on knowledge development. [PDF]
Huang R, Zou Y, Zhou L, Jiang T.
europepmc +1 more source
Diagnostic Features and Prescription Rules of Influenza-Like Illnesses in Traditional Chinese Medicine: A Data Mining Approach. [PDF]
Liu X, Chang R, Feng S, Deng G, Zhou L.
europepmc +1 more source
AIM2 framework for smart marketing innovation using AI driven consumer analytics with SOR neural networks and XGBoost in Saudi retail. [PDF]
Alarfaj FK +3 more
europepmc +1 more source
Exploring Human Mobility: A Time-Informed Approach to Pattern Mining and Sequence Similarity. [PDF]
Yang H +3 more
europepmc +1 more source
On Maximal Frequent Itemsets Mining with Constraints
Recently, a new declarative mining framework based on constraint programming (CP) and propositional satisfiability (SAT) has been designed to deal with several pattern mining tasks. The itemset mining problem has been modeled using constraints whose models correspond to the patterns to be mined.
Saïd Jabbour +4 more
openaire +2 more sources
Related searches:
Frequent Itemset Mining for Big Data
2013 IEEE International Conference on Big Data, 2013Frequent Itemset Mining (FIM) is one of the most well known techniques to extract knowledge from data. The combinatorial explosion of FIM methods become even more problematic when they are applied to Big Data. Fortunately, recent improvements in the field of parallel programming already provide good tools to tackle this problem.
Sandy Moens +2 more
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

