IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Comparision Between Features of CbO based Algorithms for Generating Formal Concepts

Comparision Between Features of CbO based Algorithms for Generating Formal Concepts
View Sample PDF
Author(s): Nuwan Kodagoda (Sri Lanka Institute of Information Technology, Malabe, Sri Lanka) and Koliya Pulasinghe (Sri Lanka Institute of Information Technology, Malabe, Sri Lanka)
Copyright: 2016
Volume: 4
Issue: 1
Pages: 34
Source title: International Journal of Conceptual Structures and Smart Applications (IJCSSA)
Editor(s)-in-Chief: Simon Polovina (Sheffield Hallam University, UK) and Simon Andrews (Sheffield Hallam University, UK)
DOI: 10.4018/IJCSSA.2016010101

Purchase

View Comparision Between Features of CbO based Algorithms for Generating Formal Concepts on the publisher's website for pricing and purchasing information.

Abstract

Formal Concept Analysis provides the mathematical notations for representing concepts and concept hierarchies making use of order and lattice theory. This has now been used in numerous applications which include software engineering, linguistics, sociology, information sciences, information technology, genetics, biology and in engineering. The algorithms derived from Kustenskov's CbO were found to provide the most efficient means of computing formal concepts in several research papers. In this paper key enhancements to the original CbO algorithms are discussed in detail. The effects of these key features are presented in both isolation and combination. Eight different variations of the CbO algorithms highlighting the key features were compared in a level playing field by presenting them using the same notation and implementing them from the notation in the same way. The three main enhancements considered are the partial closure with incremental closure of intents, inherited canonicity test failures and using a combined depth first and breadth first search. The algorithms were implemented in an un-optimized way to focus on the comparison on the algorithms themselves and not on any efficiencies provided by optimizing code. The main contribution of this paper is the complete comparison of the three main enhancements used in recent variations of the CbO based algorithms. The main findings were that there is a significant performance improvement partial closure with incremental closure of intents is used in isolation. However, there is no significant performance improvement when the depth and breadth first search or the inherited canonicity test failure feature is used in isolation. The inherited canonicity test failure needs to be combined with the combined depth and breadth first feature to obtain a performance increase. Combining all the three enhancements brought the best performance.

Related Content

Anshu Saxena Arora, Amit Arora. © 2020. 16 pages.
K.S. Gayathri, K.S. Easwarakumar, Susan Elias. © 2020. 15 pages.
Wei Cong. © 2020. 17 pages.
Radhakrishnan Maivizhi, Palanichamy Yogesh. © 2020. 26 pages.
Rishabh Saxena, Amit Sanjay Adate, Don Sasikumar. © 2020. 13 pages.
Diganta Sengupta. © 2020. 33 pages.
Wenxiang Chen, Yingna Li, Chuan Li. © 2020. 14 pages.
Body Bottom