Comparing performance of algorithms for generating concept lattices
نویسندگان
چکیده
منابع مشابه
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparseness of underlying formal ...
متن کاملComparing Performance of Algorithms for Generating the Duquenne-Guigues Basis
In this paper, we take a look at algorithms involved in the computation of the Duquenne–Guigues basis of implications. The most widely used algorithm for constructing the basis is Ganter’s Next Closure, designed for generating closed sets of an arbitrary closure system. We show that, for the purpose of generating the basis, the algorithm can be optimized. We compare the performance of the origi...
متن کاملIncremental Concept Formation Algorithms Based on Galois (Concept) Lattices
The Galois (or concept) lattice produced from a binary relation has been proved useful for many applications. Building the Galois lattice can be considered as a conceptual clustering method since it results in a concept hierarchy. This article presents incremental algorithms for updating the Galois lattice and corresponding graph, resulting in an incremental concept formation method. Different ...
متن کاملassessment of the park- ang damage index for performance levels of rc moment resisting frames
چکیده هدف اصلی از طراحی لرزه ای تامین ایمنی جانی در هنگام وقوع زلزله و تعمیر پذیر بودن سازه خسارت دیده، پس از وقوع زلزله است. تجربه زلزله های اخیر نشان داده است که ساختمان های طراحی شده با آیین نامه های مبتنی بر نیرو از نظر محدود نمودن خسارت وارده بر سازه دقت لازم را ندارند. این امر سبب پیدایش نسل جدید آیین نامه های مبتنی بر عملکرد شده است. در این آیین نامه ها بر اساس تغییرشکل های غیرارتجاعی ...
15 صفحه اولA Characterization of Concept Lattices. Dual Concept Lattices
In this article we continue the formalization of concept lattices following [4]. We give necessary and sufficient conditions for a complete lattice to be isomorphic to a given formal context. As a by-product we get that a lattice is complete if and only if it is isomorphic to a concept lattice. In addition we introduce dual formal concepts and dual concept lattices and prove that the dual of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Experimental & Theoretical Artificial Intelligence
سال: 2002
ISSN: 0952-813X,1362-3079
DOI: 10.1080/09528130210164170