计算机科学 ›› 2013, Vol. 40 ›› Issue (4): 256-258.

• 人工智能 • 上一篇    下一篇

关系粒度的概念格增量维护与关联规则更新

智慧来,智东杰   

  1. 河南理工大学计算机科学与技术学院焦作454000;河南理工大学计算机科学与技术学院焦作454000
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金(60975033),河南理工大学博士基金(B2011-102)资助

Incremental Maintenance of Concept Lattice and Association Rules under Granularity of Relation

ZHI Hui-lai and ZHI Dong-jie   

  • Online:2018-11-16 Published:2018-11-16

摘要: 为了适应动态环境下概念格应用的实践需要,有必要研究关系粒度的概念格维护和关联规则更新。首先,给出了父子概念对的概念,并在此基础上设计了基于关系粒度的概念格增量维护算法。其次,发现了一个概念的内涵缩减由这个概念和其父概念的内涵差集决定,一个概念的内涵缩减决定这个概念蕴涵的关联规则。最后,根据这一观点提出了基于关系粒度的概念格关联规则更新的方法。

关键词: 概念格,增量维护,关联规则,关系粒度

Abstract: In order to meet the needs of concept lattice application in dynamic environment,it is necessary to find a way to maintain concept lattice based on the granularity of relation.Firstly,we put forward the term father-son concept pair and gave its definition,and brought about an incremental maintenance algorithm.Secondary,we discovered that association rules can be calculated by intent reduction of concepts which is determined by the intersection of its father concept’s intent and its own intent.Finally,we put forward a method for intent updating.

Key words: Concept lattice,Incremental maintenance,Association rule,Granularity of relation

[1] Ganter B,Wille R.Formal Concept Analysis:Mathematical Foun-dation[M].New York:Springer-Verlag,1999
[2] Aversano L,Bruno M,Canfora G,et al.Using Concept Lattices to Support Service Selection[J].International Journal of Web Services Research,2006,3(4):32-51
[3] Nguyen,Tam T,Cheung H S,et al.A lattice-based approach for mathematical search using Formal Concept Analysis[J].Expert Systems with Applications,2012,9(5):5820-5828
[4] Kang Xiang-ping,Li De-ya,Wang Lu-ge.Research on domainontology in different granulations based on concept lattice[J].Knowledge-Based Systems,2012,7(5):152-161
[5] Rita K,Chang-Kai H,Chang Mai-ga,et al.A personalized webpage reconstructor based on concept lattice and association rules[J].Journal of Internet Technology,2011,2(6):1015-1024
[6] Nourine L,Raynaud O.A fast algorithm for building lattices[J].Information Processing Letters,1999,71(1):l99-204
[7] Godin R,Missaoui R,Alaoui H.Incremental concept formation algorithms based on Galois (concept) lattices[J].Computational Intelligence,1995,11(2):246-267
[8] Stumme G,Taouil R,Bastide Y,et al.Fast computation of concept lattices using data mining techniques [C]∥Proceedings of the 7th International Workshop on Knowledge Representation Meets Databases.Berlin:Technical University of Aachen,2000:129-139
[9] 谢志鹏,刘宗田.概念格与关联规则发现[J].计算机研究与发展,2000,7(12):1415-1421
[10] Pasquier N.Closed set based discovery of small covers for association rules[J].Networking and Information Systems Journal,2010

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!