Sorting concepts by priority using the theory of monotone systems

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Formal concept analysis is a powerful tool for conceptual modeling and knowledge discovery. As size of a concept lattice can easily get very large, there is a need for presenting information in the lattice in a more compressed form. We propose a novel method MONOCLE for this task that is based on the theory of monotone systems. The result of our method is a sequence of concepts, sorted by "goodness" thus enabling us to select a subset and a corresponding sub-lattice of desired size. That is achieved by defining a weight function that is monotone, correlated with area of data table covered and inversely correlated to overlaps of concepts. We can also use monotone systems theory of "kernels" to detect good cut-off points in the concept sequence. We apply our method to social and economic data of two Estonian islands and show that results are compact and useful. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Torim, A., & Lindroos, K. (2008). Sorting concepts by priority using the theory of monotone systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5113 LNAI, pp. 175–188). https://doi.org/10.1007/978-3-540-70596-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free