Detecting mistakes in binary data tables
- 40 Downloads
We suggest a classification of possible mistakes in lines of binary data tables (in formal contexts) and discuss their detection. An approach is proposed to detect some types of mistakes in new lines (contents of objects) of binary data tables (formal contexts). This approach is based on detecting those implications from implication bases of the formal contexts that are not met by a new object. It is noted that this approach can result in a complex computational solution. An alternative approach based on computing closures of subsets of object’s intent. This approach allows one to find a polynomial algorithm for the solution. The algorithm of unnecessary and extra missing properties can also be used. The results of experiments are dealt with.
Keywordsformal context implication mistake search
Unable to display preview. Download preview PDF.
- 1.Fan, W., Li, J., Ma, S., Tang, N., and Yu, W., Towards certain fixes with editing rules and master data, Proc. Very Large Data Base Endowment, 2010, vol. 3, pp. 173–184.Google Scholar
- 6.Kautz, H.A., Kearns, M.J., and Selman, B., Reasoning with characteristic models, Proc. 11th Nat. Conf. on Artificial Intelligence (AAAI-93), Washington, July 11–15, 1993.Google Scholar
- 9.Ganter, B., Two basic algorithms in concept analysis, Preprint Technische Hochschule, Darmstadt, 1984, no. 831.Google Scholar
- 12.Kuznetsov, S.O. and Obiedkov, S.A., Counting pseudointents and #P-completeness, Proc. 4th Int. Conf. on Formal Concept Analysis, Dresden, Feb. 13–17, 2006, pp. 306–308.Google Scholar
- 14.Ryssel, U., Distel, F., and Borchmann, D., Fast computation of proper premises, Proc. 8th Int. Conf. on Concept Lattices and Their Applications, Nancy, Oct. 17–21, 2011, pp. 101–113.Google Scholar
- 15.Romashkin, N., Python package for formal concept analysis. http://github.com/jupp/fca