期刊文献+

网络数据库中概念格快速渐进式构造算法优化

Optimization of Fast Progressive Construction Algorithm for Concept Lattice in Network Database
在线阅读 下载PDF
导出
摘要 为了缩短网络数据库生成概念格所需的时间,提高概念格的应用质量,提出网络数据库概念格快速渐进式构造算法优化。将概念格的属性插入形式背景,构建网络数据库初始概念格。在新增对象和新增属性这2种情况下,对网络数据库概念格进行更新。删除概念格中的冗余概念,对网络数据库概念格进行维护,完成概念格快速渐进式构造算法优化。实验结果表明,所提出的算法构造的网络数据库概念格具有较高的质量,同时具备较高的构造效率。 In order to shorten the time needed to generating concept lattice in network databases and improve the application quality of concept lattice,a fast progressive algorithm optimization for constructing concept lattice in network databases is proposed.The attributes of the concept lattice is inserted into the formal background to construct the initial concept lattice of the network database.The concept lattice of the network database is updated in two cases of adaing objects and attribntres.The redundant concepts in the concept lattice are deleted to maintain the concept lattice of the network database,and the fast progressive construction algorithm of the concept lattice is optimized.The experimental results show that the network database concept lattice constructed by the proposed algorithm has high quality and construction efficiency.
作者 哈森格日乐 栾竹青 HASEN Gerile;LUAN Zhuqing(Inner Mongolia Open University Xing’an League Branch,Ulanhot 137400,China;Urumqi Vocational Secondary School,Urumqi 830001,China)
出处 《微型电脑应用》 2025年第12期234-236,241,共4页 Microcomputer Applications
关键词 网络数据库 概念格 属性分析 概念格更新与维护 network database concept lattice attribute analysis concept lattice update and maintenance
  • 相关文献

参考文献15

二级参考文献85

共引文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部