Skip to main content

Feature Group Weighting and Topological Biclustering

  • Conference paper
Neural Information Processing (ICONIP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8835))

Included in the following conference series:

Abstract

This paper proposes a new method to weight feature groups for biclustering. In this method, the observations and features are divided into biclusters, based on their characteristics. The weights are introduced to the biclustering process to simultaneously identify the relevance of feature groups in each bicluster. A new biclustering algorithm wBiTM (Weighted Biclustering Topological Map) is proposed. The new method is an extension to self-organizing map algorithm by adding the weight parameter and a new prototype for bicluster. Experimental results on synthetic data show the properties of the weights in wBiTM.

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

Access this chapter

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. Hartigan, J.A.: Direct Clustering of a Data Matrix. Journal of the American Statistical Association 67(337), 123–129 (1972)

    Article  Google Scholar 

  2. Shan, H., Banerjee, A.: Residual bayesian co-clustering for matrix approximation. In: SDM, pp. 223–234 (2010)

    Google Scholar 

  3. Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. In: Proceedings of ISMB 2002, pp. 136–144 (2002)

    Google Scholar 

  4. Benabdeslem, K., Allab, K.: Bi-clustering continuous data with self-organizing map. Neural Computing and Applications (7-8), 1551–1562 (2012)

    Google Scholar 

  5. Alelyani, S., Tang, J., Liu, H.: Feature selection for clustering: A review. In: Data Clustering: Algorithms and Applications, pp. 29–60 (2013)

    Google Scholar 

  6. Cheng, Y., Church, G.M.: Biclustering of expression data (2000)

    Google Scholar 

  7. Govaert, G.: Simultaneous clustering of rows and columns. Control and Cybernetics 24(4), 437–458 (1995)

    MATH  Google Scholar 

  8. Getz, G., Levine, E., Domany, E.: Coupled two-way clustering analysis of gene microarray data. Proceedings of the National Academy of Sciences of the United States of America 97(22), 12079–12084 (2000)

    Article  Google Scholar 

  9. Busygin, S., Jacobsen, G., Kremer, E., Ag, C.: Double conjugated clustering applied to leukemia microarray data. In: 2nd SIAM ICDM, Workshop on Clustering High Dimensional Data (2002)

    Google Scholar 

  10. Cottrell, M., Ibbou, S., Letrémy, P.: Som-based algorithms for qualitative variables. Neural Netw. 17(8-9), 1149–1167 (2004)

    Article  MATH  Google Scholar 

  11. Benabdeslem, K., Hindawi, M.: Constrained laplacian score for semi-supervised feature selection. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011, Part I. LNCS, vol. 6911, pp. 204–218. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl. 6(1), 90–105 (2004)

    Article  Google Scholar 

  13. Wettschereck, D., Aha, D.W., Mohri, T.: A review and empirical evaluation of feature weighting methods for aclass of lazy learning algorithms. Artif. Intell. Rev. 11(1-5), 273–314 (1997)

    Article  Google Scholar 

  14. Chen, X., Ye, Y., Xu, X., Huang, J.Z.: A feature group weighting method for subspace clustering of high-dimensional data. Pattern Recogn. 45(1), 434–446 (2012)

    Article  MATH  Google Scholar 

  15. Hartigan, J.A., Wong, M.A.: A k-means clustering algorithm. JSTOR: Applied Statistics 28(1), 100–108 (1979)

    MATH  Google Scholar 

  16. Bache, K., Lichman, M.: UCI machine learning repository (2013)

    Google Scholar 

  17. Chaibi, A., Lebbah, M., Azzag, H.: A new bi-clustering approach using topological maps. In: IJCNN, pp. 1–7 (2013)

    Google Scholar 

  18. Strehl, A., Ghosh, J., Cardie, C.: Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research 3, 583–617 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sarazin, T., Lebbah, M., Azzag, H., Chaibi, A. (2014). Feature Group Weighting and Topological Biclustering. In: Loo, C.K., Yap, K.S., Wong, K.W., Teoh, A., Huang, K. (eds) Neural Information Processing. ICONIP 2014. Lecture Notes in Computer Science, vol 8835. Springer, Cham. https://doi.org/10.1007/978-3-319-12640-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12640-1_45

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12639-5

  • Online ISBN: 978-3-319-12640-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics