Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial Intelligence and Soft Computing

ICAISC 2012: Artificial Intelligence and Soft Computing pp 144–151Cite as

Foundations of Rough Biclustering

  • Conference paper

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

Abstract

Amongst the algorithms for biclustering using some rough sets based steps none of them uses the formal concept of rough bicluster with its lower and upper approximation. In this short article the new foundations of rough biclustering are described. The new relation β generates β −description classes that build the rough bicluster defined with its lower and upper approximation.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proc. of the 8th Int. Conf. on Intell. Syst. for Mol. Biol., pp. 93–103 (2000)

    Google Scholar 

  2. Emilyn, J.J., Ramar, K.: Rough Set Based Clustering of Gene Expression Data: A Survey. Int. J. of Eng. Sci. and Technol. 2(12), 7160–7164 (2010)

    Google Scholar 

  3. Emilyn, J.J., Ramar, K.: A Rough Set Based Gene Expression Clustering Algorithm. J. of Comput. Sci. 7(7), 986–990 (2011)

    Article  Google Scholar 

  4. Emilyn, J.J., Ramar, K.: A Rough Set Based Novel Biclustering Algorithm for Gene Expression Data. In: Int. Conf. on Electron. Comput. Techn., pp. 284–288 (2011)

    Google Scholar 

  5. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of 2nd Int. Conf. on Knowl. Discov. and Data Min., pp. 226–231 (1996)

    Google Scholar 

  6. Hartigan, J.A.: Direct Clustering of a Data Matrix. J. Am. Stat. Assoc. 67(337), 123–129 (1972)

    Google Scholar 

  7. MacQueen, J.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proc. Fifth Berkeley Symp. on Math. Statist. and Prob., pp. 281–297 (1967)

    Google Scholar 

  8. Michalak, M., Stawarz, M.: Generating and Postprocessing of Biclusters from Discrete Value Matrices. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part I. LNCS, vol. 6922, pp. 103–112. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Pawlak, Z.: Rough Sets. J. of Comput. and Inf. Sci. 5(11), 341–356 (1982)

    Article  MathSciNet  Google Scholar 

  10. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishing (1991)

    Google Scholar 

  11. Pensa, R., Boulicaut, J.F.: Constrained Co-clustering of Gene Expression Data. In: Proc. SIAM Int. Conf. on Data Min., SDM 2008, pp. 25–36 (2008)

    Google Scholar 

  12. Wang, R., Miao, D., Li, G., Zhang, H.: Rough Overlapping Biclustering of Gene Expression Data. In: Proc. of the 7th IEEE Int. Conf. on Bioinforma. and Bioeng. (2007)

    Google Scholar 

  13. Yang, E., Foteinou, P.T., King, K.R., Yarmush, M.L., Androulakis, I.P.: A Novel Non-overlapping biclustering Algorithm for Network Generation Using Living Cell Array Data. Bioinforma. 17(23), 2306–2313 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Silesian University of Technology, ul. Akademicka 16, 44-100, Gliwice, Poland

    Marcin Michalak

Authors
  1. Marcin Michalak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski , Marcin Korytkowski  & Rafał Scherer ,  & 

  2. AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Computer Science Division, University of California Berkeley, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Computational Intelligence Laboratory, Electrical and Computer Engineering, University of Louisville, 405 Lutz Hall, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Michalak, M. (2012). Foundations of Rough Biclustering. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2012. Lecture Notes in Computer Science(), vol 7268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29350-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29350-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29349-8

  • Online ISBN: 978-3-642-29350-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation