基于概念格的决策规则获取方法研究-计算机软件与理论专业论文.docxVIP

Research Research on the Method of Decision Rule Acquisition Based on Concept Lattice Jiang Guang(Computer Software and Theory) Directed by Prof．Liang Jiye ABSTRACT As a kernel data structure in the theory of formal concept analysis， concept lattice is a powerful tool for data analysis，used to extract hidden knowledge pattern in data．There are many advantages to build and apply concept hierarchy in the knowledge acquisition，meanwhile，Hasse diagram of concept lattice embodies such concept hierarchy structure and reflects the generalization and specialization between the concepts． Therefore，studying the basic theory,of concept lattice and applying it in knowledge discovery have important signi ficance． This thesis mainly analyses and compares several construct algorithms for concept lattice，and study decision rule acquisition based on concept lattice，meanwhile some significant results are abtained． In the aspect of analyrsis and comparison on several construct algorithms for concept lattice，in this thesis，several typical constructing algorithms are summarized and discussed．Among them，incremental algorithm is stable and efficient when the formal context contains large objects．on the contrary，batch algorithm is not stable enough，SO it is suitable to use when the formal context contains little obj ects． In the aspect of rule acquision based on concept lattice，a new aIgorithm for mining decision rules is proposed based on the completeness of all nodes in concept lattice，decision rules are computed for given support degree and confidence degree threshold．Based on the above algorithm，an optimized algorithm is given．In this algorithm， closed 1abel of the node which includes decision attribute is discussed， then then decision rules with short antecedent and same support degree as the above algorithm are computed．We implement the algorithms above and select a decision table from nursery database of UCI database and the results illustrate that the algorithm is valid． In this