Détermination Automatique des Fonctions d'Appartement et Interrogation Flexible et Cooperative des Bases de Données
Détermination Automatique des Fonctions d'Appartenance et Interrogation Flexible et Coopérative des Bases de Données
摘要：
数据库的灵活查询允许扩展DBMS以支持查询的不精确性和灵活性。柔性查询使用模糊和不精确的术语，这些术语被定义为模糊集。然而，在成员函数的生成上没有达成共识。大多数建议的方法需要专家干预。本论文分为两部分。在第一部分中，我们提出了一个基于聚类的方法自动和增量的隶属函数生成。我们已经提出了聚类方法CLUSTERDB* 评估聚类质量进行聚类生成。此外，我们建议增量更新分区和成员函数后插入或删除一个新的对象。本文的第二部分将这些函数和形式概念分析应用于灵活的协同查询。在空答案的情况下，我们正式检测失败的原因，我们生成近似查询与他们的答案。这些查询帮助用户制定具有答案的新查询。不同的建议方法的实施和实验与几个数据库。实验结果令人鼓舞。
英文摘要：
Flexible querying of DB allows to extend DBMS in order to support imprecision and flexibility in queries. Flexible queries use vague and imprecise terms which have been defined as fuzzy sets. However, there is no consensus on memberships functions generation. Most of the proposed methods require expert intervention. This thesis is devised in two parts. In the first part, we propose a clustering based approach for automatic and incremental membership functions generation. We have proposed the clustering method CLUSTERDB* which evaluates clustering quality underway clusters generation. Moreover, we propose incremental updates of partitions and membership functions after insertion or deletion of a new object. The second part of this thesis uses these functions and Formal Concepts Analysis in flexible and cooperative querying. In case of empty answers, we formally detect the failure reasons and we generate approximative queries with their answers. These queries help the user to formulate new queries having answers. The different proposed approaches are implemented and experimented with several databases. The experimentation results are encouraging.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
