Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
Authors:
- Jan OutrataJOJan Outrata
- Vilem VychodilVVVilem Vychodil
- 1 February 2012
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 185 (1) , 114-127
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Evaluation of IPAQ questionnaires supported by formal concept analysis☆Information Sciences, 2011
- Multi-adjoint t-concept latticesInformation Sciences, 2010
- Top-down mining of frequent closed patterns from very high dimensional dataInformation Sciences, 2009
- Random walk biclustering for microarray dataInformation Sciences, 2008
- Using a concept lattice of decomposition slices for program understanding and impact analysisIEEE Transactions on Software Engineering, 2003
- Conceptual knowledge discovery--a human-centered approachApplied Artificial Intelligence, 2003
- Comparing performance of algorithms for generating concept latticesJournal of Experimental & Theoretical Artificial Intelligence, 2002
- Understanding class hierarchies using concept analysisACM Transactions on Programming Languages and Systems, 2000
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993
- On generating all maximal independent setsInformation Processing Letters, 1988