模式识别与人工智能
Tuesday, Jul. 29, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2010, Vol. 23 Issue (3): 289-299    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Algebraic Properties of Constrained Concept Lattice and Its Completeness of Knowledge Representation
ZHANG Ji-Fu,ZHANG Su-Lan,JIANG Yi-Yong
School of Computer Science and Technology,Taiyuan University of Science and Technology,Taiyuan 030024

Download: PDF (591 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The constrained concept lattice is one type of concept lattice. It is constructed according to the background knowledge of usersinterest and knowledge on dataset. In this paper, the algebraic system of the constrained concept lattice is presented by defining operations of supremum and infimum among the constrained concept lattice nodes, and its algebra properties and completeness of knowledge representation are proved, thus the theoretical basis is established for the application of the constrained concept lattice.
Key wordsData Mining      Constrained Concept Lattice      Algebraic Property      Knowledge Representation      Completeness     
Received: 23 April 2009     
ZTFLH: TP311  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
ZHANG Ji-Fu
ZHANG Su-Lan
JIANG Yi-Yong
Cite this article:   
ZHANG Ji-Fu,ZHANG Su-Lan,JIANG Yi-Yong. Algebraic Properties of Constrained Concept Lattice and Its Completeness of Knowledge Representation[J]. , 2010, 23(3): 289-299.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2010/V23/I3/289
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn