Skip to main content

2017 | OriginalPaper | Buchkapitel

Co-clustering with Manifold and Double Sparse Representation

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Clustering is a fundamental tool that has been applied in dealing with huge volumes of text documents and images. For extracting relevant information from the enormous volumes of available data, some co-clustering algorithms have been proposed and shown to be superior to traditional one-side clustering. In this paper, we proposed a novel co-clustering approach called double sparse manifold learning (DSML). We based our formulation on double sparse constraints and manifold learning which use a modified version of mutual k-nearest neighbor graph to capture the underlying structure, modeled sample-feature relationship from the data reconstruction perspective. We developed an iterative procedure to get the solution. Our method preserves local geometrical structure better. Experiments on three benchmark datasets show that our method can get more promising performance on all analyzed data-sets.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Rohe, K., Qin, T., Bin, Y.: Co-clustering directed graphs to discover asymmetries and directional communities. Proc. Nat. Acad. Sci. 113(45), 12679–12684 (2016)MathSciNetCrossRef Rohe, K., Qin, T., Bin, Y.: Co-clustering directed graphs to discover asymmetries and directional communities. Proc. Nat. Acad. Sci. 113(45), 12679–12684 (2016)MathSciNetCrossRef
2.
Zurück zum Zitat Wang, S., Huang, A.: Penalized nonnegative matrix tri-factorization for co-clustering. Expert Syst. Appl. 78, 64–73 (2017)CrossRef Wang, S., Huang, A.: Penalized nonnegative matrix tri-factorization for co-clustering. Expert Syst. Appl. 78, 64–73 (2017)CrossRef
3.
Zurück zum Zitat Del Buono, N., Pio, G.: Non-negative matrix tri-factorization for co-clustering: an analysis of the block matrix. Inf. Sci. 301, 13–26 (2015)CrossRef Del Buono, N., Pio, G.: Non-negative matrix tri-factorization for co-clustering: an analysis of the block matrix. Inf. Sci. 301, 13–26 (2015)CrossRef
4.
5.
Zurück zum Zitat Gu, Q., Zhou, J.: Co-clustering on manifolds. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 359–368. ACM (2009) Gu, Q., Zhou, J.: Co-clustering on manifolds. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 359–368. ACM (2009)
6.
Zurück zum Zitat Li, P., Bu, J., Chen, C., He, Z.: Relational co-clustering via manifold ensemble learning. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 1687–1691. ACM (2012) Li, P., Bu, J., Chen, C., He, Z.: Relational co-clustering via manifold ensemble learning. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 1687–1691. ACM (2012)
7.
Zurück zum Zitat Li, P., Jiajun, B., Chen, C., He, Z., Cai, D.: Relational multimanifold coclustering. IEEE Trans. Cybern. 43(6), 1871–1881 (2013)CrossRef Li, P., Jiajun, B., Chen, C., He, Z., Cai, D.: Relational multimanifold coclustering. IEEE Trans. Cybern. 43(6), 1871–1881 (2013)CrossRef
8.
Zurück zum Zitat Allab, K., Labiod, L., Nadif, M.: Multi-manifold matrix decomposition for data co-clustering. Pattern Recogn. 64, 386–398 (2017)CrossRef Allab, K., Labiod, L., Nadif, M.: Multi-manifold matrix decomposition for data co-clustering. Pattern Recogn. 64, 386–398 (2017)CrossRef
9.
Zurück zum Zitat Papalexakis, E.E., Sidiropoulos, N.D., Bro, R.: From k-means to higher-way co-clustering: multilinear decomposition with sparse latent factors. IEEE Trans. Signal Process. 61(2), 493–506 (2013)CrossRef Papalexakis, E.E., Sidiropoulos, N.D., Bro, R.: From k-means to higher-way co-clustering: multilinear decomposition with sparse latent factors. IEEE Trans. Signal Process. 61(2), 493–506 (2013)CrossRef
10.
Zurück zum Zitat Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Sig. Process. 54(11), 4311–4322 (2006)CrossRef Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Sig. Process. 54(11), 4311–4322 (2006)CrossRef
11.
Zurück zum Zitat Sill, M., Kaiser, S., Benner, A., Kopp-Schneider, A.: Robust biclustering by sparse singular value decomposition incorporating stability selection. Bioinformatics 27(15), 2089–2097 (2011)CrossRef Sill, M., Kaiser, S., Benner, A., Kopp-Schneider, A.: Robust biclustering by sparse singular value decomposition incorporating stability selection. Bioinformatics 27(15), 2089–2097 (2011)CrossRef
12.
Zurück zum Zitat Lee, M., Shen, H., Huang, J.Z., Marron, J.S.: Biclustering via sparse singular value decomposition. Biometrics 66(4), 1087–1095 (2010)MathSciNetCrossRefMATH Lee, M., Shen, H., Huang, J.Z., Marron, J.S.: Biclustering via sparse singular value decomposition. Biometrics 66(4), 1087–1095 (2010)MathSciNetCrossRefMATH
13.
Zurück zum Zitat Ji, S., Zhang, W., Liu, J.: A sparsity-inducing formulation for evolutionary co-clustering. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 334–342. ACM (2012) Ji, S., Zhang, W., Liu, J.: A sparsity-inducing formulation for evolutionary co-clustering. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 334–342. ACM (2012)
14.
Zurück zum Zitat Kontschieder, P., Donoser, M., Bischof, H.: Improving affinity matrices by modified mutual KNN-graphs. In: 33rd Workshop of the Austrian Association for Pattern Recognition (AAPR/OAGM) (2009) Kontschieder, P., Donoser, M., Bischof, H.: Improving affinity matrices by modified mutual KNN-graphs. In: 33rd Workshop of the Austrian Association for Pattern Recognition (AAPR/OAGM) (2009)
15.
Zurück zum Zitat Donoser, M.: Replicator graph clustering. In: BMVC (2013) Donoser, M.: Replicator graph clustering. In: BMVC (2013)
16.
Zurück zum Zitat Zheng, M., Jiajun, B., Chen, C., Wang, C., Zhang, L., Qiu, G., Cai, D.: Graph regularized sparse coding for image representation. IEEE Trans. Image Process. 20(5), 1327–1336 (2011)MathSciNetCrossRef Zheng, M., Jiajun, B., Chen, C., Wang, C., Zhang, L., Qiu, G., Cai, D.: Graph regularized sparse coding for image representation. IEEE Trans. Image Process. 20(5), 1327–1336 (2011)MathSciNetCrossRef
17.
Zurück zum Zitat Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. In: Advances in Neural Information Processing Systems, vol. 19, p. 801 (2007) Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. In: Advances in Neural Information Processing Systems, vol. 19, p. 801 (2007)
18.
Zurück zum Zitat Cai, D., He, X., Wu, X., Han, J.: Non-negative matrix factorization on manifold. In: Eighth IEEE International Conference on Data Mining, ICDM 2008, pp. 63–72. IEEE (2008) Cai, D., He, X., Wu, X., Han, J.: Non-negative matrix factorization on manifold. In: Eighth IEEE International Conference on Data Mining, ICDM 2008, pp. 63–72. IEEE (2008)
19.
Zurück zum Zitat Cai, D., He, X., Han, J., Huang, T.S.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1548–1560 (2011)CrossRef Cai, D., He, X., Han, J., Huang, T.S.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1548–1560 (2011)CrossRef
Metadaten
Titel
Co-clustering with Manifold and Double Sparse Representation
verfasst von
Fang Li
Sanyuan Zhang
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-68935-7_31

Premium Partner