Note on m-polar fuzzy graph representation of concept lattice: How to really compute m-polar fuzzy concepts. (February 2019)

• Record Type: Journal Article
• Authors: Konecny, Jan
• Is Part Of: Engineering applications of artificial intelligence. Volume 78(2019)
• Page Start: 1
• Page End: 11
• Publication Date: 2019-02
• Subjects: Formal concept analysis -- Multi-polar information -- Fuzzy set -- Algorithm; Engineering -- Data processing -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Ingénierie -- Informatique -- Périodiques; Intelligence artificielle -- Périodiques; Systèmes experts (Informatique) -- Périodiques; Artificial intelligence; Engineering -- Data processing; Expert systems (Computer science); Periodicals; 620.00285
• DOI: 10.1016/j.engappai.2018.10.015
• Languages: English
• ISSNs: 0952-1976

Abstract

Abstract: Singh (2018) claims to propose an extension of formal concept analysis for handling multi-polar information. For this setting he invents an algorithm. The aim of this note is two-fold: First, we show that Singh's algorithm is inefficient, since it is a direct generalization of one of the least efficient algorithms known in formal concept analysis, and strictly speaking, the algorithm is incorrect. Second, we are reminded that many algorithms already exist which can be used instead. This is because Singh's setting is already covered by a more general and well established framework of formal fuzzy concept analysis.