Veuillez utiliser cette adresse pour citer ce document :
https://di.univ-blida.dz/jspui/handle/123456789/20744
Affichage complet
Élément Dublin Core | Valeur | Langue |
---|---|---|
dc.contributor.author | Elamrani, FatimaZahra | - |
dc.contributor.author | Mouloud, Chaima | - |
dc.contributor.author | Zahra, Fatma Zohra ( Promotrice) | - |
dc.date.accessioned | 2023-01-30T10:58:54Z | - |
dc.date.available | 2023-01-30T10:58:54Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | https://di.univ-blida.dz/jspui/handle/123456789/20744 | - |
dc.description | ill., Bibliogr. ma-004-897 | fr_FR |
dc.description.abstract | Pattern mining consists of finding interesting, useful and pertinent patterns (data structures) that exist among large amount of data. These discovered patterns can be used as actionable knowledge directly or they can be used by other data mining methods as an input. Itemsets represent the most basic type of pattern and are the most treated in this field. In the real world, the actual data is for the most part uncertain. Indeed, we are interested in our work on this type of data, and as a result, our work consists of providing an approach for extracting frequent itemsets from uncertain data using deep reinforcement learning, which has had a lot of success in a variety of domains. Keywords: frequent itemset mining, high utility itemset mining, uncertain data, reinforcement learning, deep learning. | fr_FR |
dc.language.iso | en | fr_FR |
dc.publisher | Université Blida 1 | fr_FR |
dc.subject | Frequent itemset mining | fr_FR |
dc.subject | High utility itemset mining | fr_FR |
dc.subject | Uncertain data | fr_FR |
dc.subject | Reinforcement learning | fr_FR |
dc.subject | Deep learning. | fr_FR |
dc.title | Reinforcement Learning Based Uncertain Pattern Mining | fr_FR |
dc.type | Thesis | fr_FR |
Collection(s) : | Mémoires de Master |
Fichier(s) constituant ce document :
Fichier | Description | Taille | Format | |
---|---|---|---|---|
Elamrani Fatima Zahra et Mouloud Chaima.pdf | 1,72 MB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.