一种新的概念格快速构造算法
首发时间:2009-04-01
摘要:在应用概念格的过程中,首先需要解决的是格的构造问题。通常,概念格的大小是在指数级上的,且要处理的数据又多数是海量的,它的构造过程无疑非常耗时。因此,研究概念格生成的高效算法就显得更加迫切。本文对概念格的经典渐进式生成算法Godin算法进行了详尽的研究,并提出了较为高效的算法用于概念格的渐进式生成;对比分析证明了方法的有效性。
For information in English, please click here
A New Fast Algorithm for Building Concept Lattice
Abstract:Concept lattice has been used widely in knowledge engineering. The building of concept lattice is the first and important thing in application. Many algorithms have been developed, Godin algorithm is a famous incremental construction algorithm.This paper analyzes the process of incrementally updating, improves on Godin algorithm and provide a new fast c for building concept lattice.the authow test and analyze the final results,the results show that the new algorithm has good efficiency.
Keywords: Concept lattice incremental construction algorithm Godin algorithm
基金:
论文图表:
引用
No.3094030284512385****
同行评议
共计0人参与
勘误表
一种新的概念格快速构造算法
评论
全部评论0/1000