A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Closure-based constraints in formal concept analysis
2013
Discrete Applied Mathematics
We present a method of imposing constraints in extracting formal concepts (equivalently, closed itemsets or fixpoints of Galois connections) from a binary relation. The constraints are represented by closure operators and their purpose is to mimic background knowledge a user may have of the data. The idea is to consider relevant and thus to extract only these itemsets that are compatible with the background knowledge. As a result, the method extracts less clusters, those that are interesting
doi:10.1016/j.dam.2013.02.029
fatcat:3osrlm34fjd6lhpb3jjtbn6w3i