Fouille de représentations concises des motifs fréquents à travers les espaces de recherche conjonctif et disjonctif

Fouille de représentations concises des motifs fréquents à travers les espaces de recherche conjonctif et disjonctif

Show other versions (1)

Durant ces dernières années, les quantités de données collectées, dans divers domaines d'application de l'informatique, deviennent de plus en plus importantes. Cela suscite le besoin d'analyser et d'interpréter ces données afin d'en extraire des connaissances utiles. Dans ce...

Full description

Bibliographic Details
Main Author:	Hamrouni, Tarek
Other Authors:	Artois
Language:	fr
Published:	2009
Subjects:	Fouille de données Classe d'équivalence Itemset Itemset essentiel Itemset fermé Itemset fermé disjonctif Générateur minimal Opérateur de fermeture Règle d'association Règle d'association généralisée Représentation concise Support disjonctif
Online Access:	http://www.theses.fr/2009ARTO0404/document

Similar Items

Fouille de représentations concises des motifs fréquents à travers les espaces de recherche conjonctif et disjonctif
by: Hamrouni, Tarek
Published: (2009)

Expansion de la représentation succincte des générateurs minimaux
by: Abbas, Hafida
Published: (2013)

Algorithmes pour la fouille de données et la bio-informatique
by: Mondal, Kartick Chandra
Published: (2013)

CIGA+ : un algorithme de calcul d’un ensemble concis de motifs fermés fréquents
by: Rokia Missaoui, et al.
Published: (2006-04-01)

Systèmes producteurs de confiance : ouverture de droit à des services par apprentissage dynamique du comportement des utilisateurs du système d'information
by: Dia, Diyé
Published: (2016)

Fouille de données par contraintes
by: Boudane, Abdelhamid
Published: (2018)

Mise à jour de la famille des générateurs minimaux des treillis de concepts et des icebergs
by: Nehme, Kamal
Published: (2017)

Extraction optimisée de règles d'association positives et négatives intéressantes
by: Papon, Pierre-Antoine
Published: (2016)

Mining Productive Itemsets in Dynamic Databases
by: Xiang Li, et al.
Published: (2020-01-01)

Efficiently mining association rules based on maximum single constraints
by: Anh Tran, et al.
Published: (2017-05-01)

PARALLEL MINING OF FREQUENT MAXIMAL ITEMSETS USING ORDER PRESERVING GENERATORS
by: R.V. Nataraj, et al.
Published: (2010-10-01)

A General Method for mining high-Utility itemsets with correlated measures
by: Nguyen Manh Hung, et al.
Published: (2021-06-01)

Top ‘N’ Variant Random Forest Model for High Utility Itemsets Recommendation
by: Pazhaniraja N, et al.
Published: (2021-09-01)

LUIM: New Low-Utility Itemset Mining Framework
by: Naji Alhusaini, et al.
Published: (2019-01-01)

Rekomendasi Paket Produk Guna Meningkatkan Penjualan Dengan Metode FP-Growth
by: Asrul Abdullah
Published: (2018-06-01)

Efficient Frequent Closed Itemset Algorithms With Applications To Stream Mining And Classification
by: Ranganath, B N
Published: (2010)

New and Efficient Algorithms for Producing Frequent Itemsets with the Map-Reduce Framework
by: Yaron Gonen, et al.
Published: (2018-11-01)

A Fast Approach for Up-Scaling Frequent Itemsets
by: Runzi Chen, et al.
Published: (2020-01-01)

A computational environment for mining association rules and frequent item sets
by: Hahsler, Michael, et al.
Published: (2005)

arules - A Computational Environment for Mining Association Rules and Frequent Item Sets
by: Hornik, Kurt, et al.
Published: (2005)

High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets
by: Gede Aditra Pradnyana, et al.
Published: (2021-04-01)

TKFIM: Top-K frequent itemset mining technique based on equivalence classes
by: Saood Iqbal, et al.
Published: (2021-03-01)

An Efficient Method for Mining Closed Potential High-Utility Itemsets
by: Bay Vo, et al.
Published: (2020-01-01)

IMPLEMENTATION OF DYNAMIC AND FAST MINING ALGORITHMS ON INCREMENTAL DATASETS TO DISCOVER QUALITATIVE RULES
by: Pannangi NARESH, et al.
Published: (2021-09-01)

Data Mining : algorithmes d'extraction et de réduction des règles d'association dans les bases de données
by: Pasquier, Nicolas
Published: (2000)

Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach
by: Alnatsheh, Rami H.
Published: (2012)

FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining
by: Tianyou Wei, et al.
Published: (2020-01-01)

Recherche de motifs graduels et application aux données médicales
by: Lisa, Di Jorio
Published: (2010)

Une approche basée sur les motifs fermés pour résoudre le problème de clustering par consensus
by: Al-Najdi, Atheer
Published: (2016)

The MapReduce Model on Cascading Platform for Frequent Itemset Mining
by: Nur Rokhman, et al.
Published: (2018-07-01)

Analysis of the progressive sampling-based approach using real life datasets
by: Umarani Venkatapathy, et al.
Published: (2011-06-01)

Hiding Sensitive Frequent Itemsets over Privacy Preserving Distributed Data
by: Alaa Jumaa, et al.
Published: (2013-03-01)

A GENERAL SURVEY ON FREQUENT PATTERN MINING USING GENETIC ALGORITHM
by: K. Poornamala, et al.
Published: (2012-10-01)

A NOVEL ALGORITHM FOR ASSOCIATION RULE MINING FROM DATA WITH INCOMPLETE AND MISSING VALUES
by: K. Rameshkumar
Published: (2011-04-01)

Concept Lattice Method for Spatial Association Discovery in the Urban Service Industry
by: Weihua Liao, et al.
Published: (2020-03-01)

An Association Rule Mining Algorithm Based on a Boolean Matrix
by: Hanbing Liu, et al.
Published: (2007-09-01)

Class Association Rule Pada Metode Associative Classification
by: Eka Karyawati, et al.
Published: (2011-11-01)

New Descriptors of Textual Records: Getting Help from Frequent Itemsets
by: Ayoub Bokhabrine, et al.
Published: (2020-11-01)

Discovering Periodic Itemsets Using Novel Periodicity Measures
by: Philippe Fournier-Viger, et al.
Published: (2019-01-01)

TT-Miner: Topology-Transaction Miner for Mining Closed Itemset
by: Bo Li, et al.
Published: (2019-01-01)