Author of the publication

Considérant la dépendance dans la théorie des fonctions de croyance.

, , , and . Fouille de données complexes, volume E-27 of Revue des Nouvelles Technologies de l'Information, Hermann-Éditions, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approche binaire pour la génération des fortes règles d'association., , and . EGC, volume RNTI-E-2 of Revue des Nouvelles Technologies de l'Information, page 329-340. Cépaduès-Éditions, (2004)OWL-CM: OWL Combining Matcher based on Belief Functions Theory., and . OM, volume 304 of CEUR Workshop Proceedings, CEUR-WS.org, (2007)Statistical Methods for Use in Analysis of Trust-Skyline Sets., , , and . ICEIS (Revised Selected Papers), volume 321 of Lecture Notes in Business Information Processing, page 413-427. Springer, (2017)A SAT-Based Approach for Enumerating Interesting Patterns from Uncertain Data., , , , and . ICTAI, page 255-262. IEEE Computer Society, (2016)The advantage of evidential attributes in social networks., , , , and . FUSION, page 1-8. IEEE, (2017)Learning Parameters in Directed Evidential Networks with Conditional Belief Functions., and . Belief Functions, volume 8764 of Lecture Notes in Computer Science, page 294-303. Springer, (2014)BeliefOWL: An Evidential Representation in OWL Ontology., and . URSW, volume 527 of CEUR Workshop Proceedings, page 77-80. CEUR-WS.org, (2009)A Declarative Framework for Mining Top-k High Utility Itemsets., , , , and . DaWaK, volume 12925 of Lecture Notes in Computer Science, page 250-256. Springer, (2021)A Parallel Declarative Framework for Mining High Utility Itemsets., , , , and . IPMU (2), volume 1602 of Communications in Computer and Information Science, page 624-637. Springer, (2022)A General Framework for Querying Possibilistic RDF Data., , , and . ICTAI, page 158-162. IEEE, (2018)