Advertisement

Detecting mistakes in binary data tables

  • A. V. Revenko
Article
  • 40 Downloads

Abstract

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.

Keywords

formal context implication mistake search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Huffman, W.C. and Pless, V.S., Fundamentals of ErrorCorrecting Codes, Cambridge: University Press, 2003.CrossRefGoogle Scholar
  3. 3.
    Kumar, Y. and Suryawanshi, V., A new approach for handling null values in web log using k-nearest neighbor and tabu search k-nearest neighbor, Int. J. Data Mining Knowledge Manag. Proc., 2011, vol. 1, no. 5, pp. 9–19.CrossRefGoogle Scholar
  4. 4.
    Silva-Ramrez, E.-L., Pino-Mejas, R., Lopez-Coello, M., and Cubiles-de-la Vega, M.D., Missing value imputation on missing completely at random data using multilayer perceptrons, Neural Networks: Official. J. Int. Neural Network Soc., 2011, vol. 24, pp. 121–129.CrossRefGoogle Scholar
  5. 5.
    Song, Q. and Shepperd, M., A new imputation method for small software project data sets, J. Syst. Software, 2007, vol. 80, pp. 51–62.CrossRefGoogle Scholar
  6. 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
  7. 7.
    Ganter, B. and Wille, R., Formal Concept Analysis: Mathematical Foundations, Berlin: Springer-Verlag, 1999.zbMATHCrossRefGoogle Scholar
  8. 8.
    Guigues, J.-L. and Duquenne, V., Familles minimales dimplications informatives resultant d’un tableau de donnes binaries, Math. Sci. Hum., 1986, vol. 24, no. 95, pp. 5–18.MathSciNetGoogle Scholar
  9. 9.
    Ganter, B., Two basic algorithms in concept analysis, Preprint Technische Hochschule, Darmstadt, 1984, no. 831.Google Scholar
  10. 10.
    Distel, F. and Sertkaya, B., On the complexity of enumerating pseudo-intents, Discrete Appl. Mathem., 2011, vol. 159, pp. 450–466.MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Babin, M.A. and Kuznetsov, S.O., Computing premises of a minimal cover of functional dependencies is intractable, Discrete Appl. Mathem., 2013, vol. 161, pp. 742–749. doi 10.1016/j.dam.2012.10.026.MathSciNetzbMATHCrossRefGoogle Scholar
  12. 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
  13. 13.
    Kuznetsov, S.O. and Obiedkov, S.O., Some decision and counting problems of the Duquenne-Guigues basis of implications, Discrete Appl. Mathem., 2008, vol. 156, pp. 1994–2003.MathSciNetzbMATHCrossRefGoogle Scholar
  14. 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. 15.
    Romashkin, N., Python package for formal concept analysis. http://github.com/jupp/fca
  16. 16.
    Obiedkov, S.A. and Duquenne, V., Attribute-incremental construction of the canonical implication basis, Ann. Mathem. Artif. Intell., 2007, vol. 49, pp. 1–4.MathSciNetCrossRefGoogle Scholar
  17. 17.
    Frank, A. and Asuncion, A., UCI machine learning repository, 2010. http://archive.ics.uci.edu/ml/ Google Scholar

Copyright information

© Allerton Press, Inc. 2013

Authors and Affiliations

  1. 1.Higher Economics SchoolNational Research UniversityMoscowRussia

Personalised recommendations