论文标题
déterminationd'poNctions d'Appartenance et询问灵活性及
Détermination Automatique des Fonctions d'Appartenance et Interrogation Flexible et Coopérative des Bases de Données
论文作者
论文摘要
DB的灵活查询可以扩展DBM，以支持查询中的不精确和灵活性。灵活的查询使用模糊和不精确的术语，这些术语被定义为模糊集。但是，对会员功能的生成尚无共识。大多数建议的方法都需要专家干预。本文以两部分设计。在第一部分中，我们为自动和增量成员功能生成的基于聚类的方法提出了一种方法。我们提出了聚类方法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.
