Skip to main content
SpringerLink
Log in

Approximate Bicluster and Tricluster Boxes in the Analysis of Binary Data

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6743))

Abstract

A disjunctive model of box bicluster and tricluster analysis is considered. A least-squares locally-optimal one cluster method is proposed, oriented towards the analysis of binary data. The method involves a parameter, the scale shift, and is proven to lead to ”contrast” box bi- and tri-clusters. An experimental study of the method is reported.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Book  MATH  Google Scholar 

  2. Hartigan, J.A.: Direct clustering of a data matrix. Journal of the American Statistical Association 67(337), 123–129 (1972)

    Article  Google Scholar 

  3. Hartigan, J.A.: Clustering Algorithms. Wiley, Chichester (1975)

    MATH  Google Scholar 

  4. Ignatov, D., Kuznetsov, S.: Biclustering methods using lattices of closed subsets. In: Proceedings of 12th National Conference on Artificial Intelligence, Moscow, FML, vol. 1, pp. 175–182 (2010) (in Russian)

    Google Scholar 

  5. Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 1(1), 24–45 (2004)

    Article  Google Scholar 

  6. Mirkin, B., Arabie, P., Hubert, L.: Additive two-mode clustering: the error-variance approach revisited. Journal of Classification 12, 243–263 (1995)

    Article  MATH  Google Scholar 

  7. Mirkin, B.: Mathematical Classification and Clustering, p. 448. Kluwer, Dordrecht (1996)

    Book  MATH  Google Scholar 

  8. Mirkin, B.: Two goals for biclustering: ”Box” and ”Dual” methods (2008) (unpublished manuscript)

    Google Scholar 

  9. Pensa, R.G., Boulicaut, J.-F.: Towards fault-tolerant formal concept analysis. In: Bandini, S., Manzoni, S. (eds.) AI*IA 2005. LNCS (LNAI), vol. 3673, pp. 212–223. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Prelic, A., Bleuler, S., Zimmermann, P., Wille, A., Bühlmann, P., Gruissem, W., Hennig, L., Thiele, L., Zitzler, E.: A Systematic Comparison and Evaluation of Biclustering Methods for Gene Expression Data. Bioinformatics 22(9), 1122–1129 (2006)

    Article  Google Scholar 

  11. Rome, J.E., Haralick, R.M.: Towards a formal concept analysis approach to exploring communities on the World Wide Web. In: International Conference on Formal Concept Analysis, Lens, France (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University–Higher School of Economics, Moscow, Russia

    Boris G. Mirkin & Andrey V. Kramarenko

  2. Department of Computer Science and Information Systems, Birkbeck University of London, UK

    Boris G. Mirkin

Authors
  1. Boris G. Mirkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrey V. Kramarenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. State University Higher School of Economics, Pokrovskiy Bd. 11, 109028, Moscow, Russia

    Sergei O. Kuznetsov

  2. Institute of Mathematics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Dominik Ślęzak

  3. Department of Computer Science, University of Regina, 3737 Wascana Parkway, S4S 0A2, Regina, SK, Canada

    Daryl H. Hepting

  4. Birbeck University of London, Malet Street, WC1E 7HX, London, UK

    Boris G. Mirkin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mirkin, B.G., Kramarenko, A.V. (2011). Approximate Bicluster and Tricluster Boxes in the Analysis of Binary Data. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2011. Lecture Notes in Computer Science(), vol 6743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21881-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21881-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21880-4

  • Online ISBN: 978-3-642-21881-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation