模式识别与人工智能
Tuesday, Jan. 14, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2013, Vol. 26 Issue (12): 1096-1105    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Intent Waned Values and Attribute Reduction in Format Concept
MA Yuan
School of Software, University of Science and Technology LiaoNing, Anshan 114051

Download: PDF (567 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  Attribute reduction is a hot topic in the area of concept lattice. The idea of intent waned values is used to prove that the set composed of arbitrary elements taken from intent waned values of each unique upper-neighbor concept is a reduction, thereby providing a simple algorithm of seeking all reductions, and this algorithm has a quite visual image in Hasse picture. Since the proposed algorithm only concerns unique upper-neighbor concepts, it can be finished by simply conducting some intersection calculation on context with no need to seek all the concept lattices. Therefore, the time and the space complexities of the proposed algorithm is still polynomial.
Key wordsConcept Lattice      Intent Waned Value      Unique Upper Neighbor      Attribute Reduction     
Received: 07 May 2012     
ZTFLH: TP 181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
MA Yuan
Cite this article:   
MA Yuan. Intent Waned Values and Attribute Reduction in Format Concept[J]. , 2013, 26(12): 1096-1105.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2013/V26/I12/1096
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