Skip to main content
SpringerLink
Log in

Classification based on formal concept analysis and biclustering: possibilities of the approach

  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

Recent attempts have focused on the application of formal concept analysis (FCA) to classification (pattern recognition) problems. The article explores the effectiveness of this approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations, Springer (1999).

  2. S. O. Kuznetsov, Lattice Theory for Intelligent Data Analysis [in Russian] (http://ami.hse.ru/data/165/315/1234/book.pdf).

  3. G. Birkhoff, Lattice Theory [Russian translation], Nauka, Moscow (1984).

    Google Scholar 

  4. O. Ore, Theory of Graphs [Russian translation], Nauka, Moscow (1980).

    Google Scholar 

  5. S. I. Gurov, Ordered Sets and Universal Algebra [in Russian], MGU, Moscow (2004).

    Google Scholar 

  6. V. K. Finn, “On machine-oriented formalization of plausible reasoning in the style of F. Bacon and D. S. Mill,” Semiotika i Informatika, 20, 35-101 (1983).

    MathSciNet  MATH  Google Scholar 

  7. B. G. Mirkin, Mathematical Classification and Clustering, Kluwer Academic Publishers (1996).

  8. D. Ignatov, Biclustering Methods for the Analysis of Internet Data [in Russian] (http://citforum.ru/consulting/BI/biclustering).

  9. D. I. Ignatov, Models, Algorithms, and Software for Biclustering Using Closed Sets [in Russian], abstract of candidate thesis, subject 05.13.18: Mathematical Modeling, Numerical Methods, and Software Systems.

  10. S. O. Kuznetsov, “On stability of a formal concept,” in: E. San Juan, ed., JIM, Metz, France (2003).

    Google Scholar 

  11. S. I. Gurov, N. S. Dolotova, and I. N. Fatkhutdinov, “Noncompact recognition problems. Circuit design according to E. Gilbert,” in: Spectral and Evolution Problems: Proc. 17 th Crimean Autumn Mathematical School-Symposium, Simferopol, Crimean Scientific Center of Ukrainian Academy of Sciences, 17: 37-44 (2007).

  12. Formal Concept Analysis [in Russian] (http://www.machinelearning.ru/wiki/index.php?title=Анализформальныхпонятий).

Download references

Author information

Authors and Affiliations

  1. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia

    A. A. Onishchenko & S. I. Gurov

Authors
  1. A. A. Onishchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. I. Gurov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Onishchenko.

Additional information

Translated from Prikladnaya Matematika i Informatika, No. 38, pp. 77–87, 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Onishchenko, A.A., Gurov, S.I. Classification based on formal concept analysis and biclustering: possibilities of the approach. Comput Math Model 23, 329–336 (2012). https://doi.org/10.1007/s10598-012-9141-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10598-012-9141-2

Keywords

Search

Navigation