Building and maintaining analysis-level class hierarchies using Galois Lattices
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Knowledge Spaces
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Limitations of Student Control: Do Students Know When They Need Help?
ITS '00 Proceedings of the 5th International Conference on Intelligent Tutoring Systems
On stability of a formal concept
Annals of Mathematics and Artificial Intelligence
Reducing the Representation Complexity of Lattice-Based Taxonomies
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Derivation of Knowledge Structures for Distributed Learning Objects
Proceedings of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services
On computing the minimal generator family for concept lattices and icebergs
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
| Hi-index | 0.00 |
In this paper we investigate stabilities of concepts resulting from extending partial ordering of a set of elements to partial ordering of a larger set of elements. This approach can be applied for facilitating the process of decision making related to automated tests based on knowledge states.