基于概念格及其扩展模型的数据挖掘研究-计算机软件与理论专业论文.docxVIP

摘 摘 要 L形式概念分析是对哲学的概念进行形式化描述的一种数学工具，已在软件工 程、信息检索、数据挖掘等各个领域得到广泛应用，备受国内外研究者的重视a／一 本文主要关注基于概念格及其扩展模型的数据挖掘研究，其中内容涉及形式 概念分析两个主要方面：概念格的构造和概念格的应用。 在概念格的构造方面，本文总结已有的构造算法，提出一种基于最佳不完全 覆盖的概念格构造算法，算法至上而下，以图的广度优先搜索方式生成概念节点 和概念的图表结构。此外，本文还提出并实现了一种相对约简格的构造算法。 在概念格的应用方面，将概念格模型应用于数据挖掘中。从概念外延的角度， 提出最小可信度格和最小支持度格的构造方法，并示例说明最小支持度格在概念 聚类和蕴含规则挖掘上的应用。从概念内涵的角度，度量概念节点之间的距离， 以此为依据提出并实现一种基于最小支持度格的概念聚类算法。同时本文着重研 究了利用量化的相对约简格来发现分类规则的问题，所提算法的生成结果剔除了 冗余的分类规则，算法在时间性能、空间性能等方面较前人的算法有较大的改进。 另外，本文在相关章节对形式概念分析和聚类分析进行比较以及分析总结了 基于概念格的分类和决策树分类法的异同。 关键宇：数据挖掘，概念格，扩展模型，聚类分析，分类规则 ABSTRACTFormal ABSTRACT Formal concept analysis(FcA)is mathematical tool that describes philosophical concept by means of formalization；it has been widely used in software engineering， information retrieval and data mining etc．Now more and more attention has been paid to the research of FCA． This thesis mainly focuses data mining based concept lattice and its extended models，the was invoNed with two domain of FCA：generation and apphcation of concept lattice． In generation of concept lattice，the thesis first reviews existing generation algorithms and analyzes their principles of generation，then presents top—down algorithm based optimal—incomplete The algorithm will generate concept set and hasse diagram used width—first search of the line diagram．In addition，this thesis proposes and implements an algorithm’which generates relatively reduced concept 】attice． On the other hand，concept lattice and its extended models used in data mining．As concept extent was concerned，the thesis presents two algorithms build the min--support lattice and the min--confidence lattice respectively and analyzes the approach of applying min—support lattice to clustering analysis in detail．As concept intent was concerned，the thesis attempts to measure distance of two concepts through relation of concept intent．As result，the similarity—based algorithm is proposed and implemented for clustering analysis．Besides what mentioned above，this thesis mainly lays emphasi