Skip to main content

2016 | OriginalPaper | Buchkapitel

An Improved Multi-SOM Algorithm for Determining the Optimal Number of Clusters

verfasst von : Imèn Khanchouch, Malika Charrad, Mohamed Limam

Erschienen in: Computer and Information Science 2015

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

The interpretation of the quality of clusters and the determination of the optimal number of clusters is still a crucial problem in cluster Analysis. In this paper, we focus in on multi-SOM clustering approach which overcomes the problem of extracting the number of clusters from the SOM map through the use of a clustering validity index. We test the multi-SOM algorithm using real and artificial data sets with different evaluation criteria not used previously such as Davies Bouldin index, and Silhouette index. The multi-SOM algorithm is compared to k-means and Birch methods. Results developed with R language show that it is more efficient than classical clustering methods.

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 Kohonen, T.: Automatic formation of topological maps of patterns in a self-organising system. In: Proceedings of the 2SCIA, Scandinavian Conference on Image Analysis, pp. 214–220 (1981) Kohonen, T.: Automatic formation of topological maps of patterns in a self-organising system. In: Proceedings of the 2SCIA, Scandinavian Conference on Image Analysis, pp. 214–220 (1981)
2.
Zurück zum Zitat Lamirel, J.C.: Using artificial neural networks for mapping of science and technology: a multi self-organizing maps approach. Scientometrics 51, 267–292 (2001)CrossRef Lamirel, J.C.: Using artificial neural networks for mapping of science and technology: a multi self-organizing maps approach. Scientometrics 51, 267–292 (2001)CrossRef
3.
Zurück zum Zitat Ghouila, A., Yahia, S.B., Malouche, D., Jmel, H., Laouini, D., Guerfali, Z., Abdelhak, S.: Application of multisom clustering approach to macrophage gene expression analysis. Infect. Genet. Evol. 9, 328–329 (2008)CrossRef Ghouila, A., Yahia, S.B., Malouche, D., Jmel, H., Laouini, D., Guerfali, Z., Abdelhak, S.: Application of multisom clustering approach to macrophage gene expression analysis. Infect. Genet. Evol. 9, 328–329 (2008)CrossRef
4.
Zurück zum Zitat Guha, S., Rastogi, R., Shim, K.: Cure: an efficient data clustering method for very large databases. In: SIGMOD, Proceedings ACM SIGMOD international conference on Management of data, pp. 73–84. ACM Press (1998) Guha, S., Rastogi, R., Shim, K.: Cure: an efficient data clustering method for very large databases. In: SIGMOD, Proceedings ACM SIGMOD international conference on Management of data, pp. 73–84. ACM Press (1998)
5.
Zurück zum Zitat Zhang, T., Ramakrishna, R., Livny, M.: Birch: an efficient data clustering method for very large databases, pp. 103–114 (1996) Zhang, T., Ramakrishna, R., Livny, M.: Birch: an efficient data clustering method for very large databases, pp. 103–114 (1996)
6.
Zurück zum Zitat Karypis, G., (Sam)Han, E.-H., Kumar, V.: Chameleon: hierarchical clustering using dynamic modeling. IEEE Xplore 32, 68–75 (1999) Karypis, G., (Sam)Han, E.-H., Kumar, V.: Chameleon: hierarchical clustering using dynamic modeling. IEEE Xplore 32, 68–75 (1999)
7.
Zurück zum Zitat MacQueen, J.: Some methods for classification and analysis of multivariate observations. Proc. Fifth Berkeley Symp. Math. Stat. Probab. 1, 281–289 (1967)MathSciNet MacQueen, J.: Some methods for classification and analysis of multivariate observations. Proc. Fifth Berkeley Symp. Math. Stat. Probab. 1, 281–289 (1967)MathSciNet
8.
Zurück zum Zitat Kaufman, L., Rousseeuw, P.: Methods clustering by means of medoids. Statistical Data Analysis Based on the L1-Norm and Related, pp. 405–417. Amsterdam, New York (1987) Kaufman, L., Rousseeuw, P.: Methods clustering by means of medoids. Statistical Data Analysis Based on the L1-Norm and Related, pp. 405–417. Amsterdam, New York (1987)
9.
Zurück zum Zitat Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of 2nd International Conference on KDD, Portland, Oregon, pp. 226–231 (1996) Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of 2nd International Conference on KDD, Portland, Oregon, pp. 226–231 (1996)
10.
Zurück zum Zitat Ankerst, M., Breunig, M., Kriegel, H.-P., Sander, J.: Optics: ordering points to identify the clustering structure. In: SIGMOD Proceedings ACM SIGMOD International Conference on Management of Data, June 1–3, Philadelphia, Pennsylvania, USA, vol. 28, pp. 49–60. ACM Press (1999) Ankerst, M., Breunig, M., Kriegel, H.-P., Sander, J.: Optics: ordering points to identify the clustering structure. In: SIGMOD Proceedings ACM SIGMOD International Conference on Management of Data, June 1–3, Philadelphia, Pennsylvania, USA, vol. 28, pp. 49–60. ACM Press (1999)
11.
Zurück zum Zitat Lamirel, J.C.: Multisom: a multimap extension of the SOM model. Appl. Inf. Discov. Iconogr. Context 3, 1790–1795 (2002) Lamirel, J.C.: Multisom: a multimap extension of the SOM model. Appl. Inf. Discov. Iconogr. Context 3, 1790–1795 (2002)
12.
Zurück zum Zitat Lamirel, J.C., Shehabi, S.: Multisom: a multimap extension of the SOM model. Application to information discovery in an iconographic context. In: IEEE Conference Publications, pp. 42–54 (2006) Lamirel, J.C., Shehabi, S.: Multisom: a multimap extension of the SOM model. Application to information discovery in an iconographic context. In: IEEE Conference Publications, pp. 42–54 (2006)
13.
Zurück zum Zitat Lamirel, J.C., Shehabi, S., Hoffmann, M., Francois, C.: Intelligent patent analysis through the use of a neural network: experiment of multi-viewpoint analysis with the multisom model, pp. 7–23 (2003) Lamirel, J.C., Shehabi, S., Hoffmann, M., Francois, C.: Intelligent patent analysis through the use of a neural network: experiment of multi-viewpoint analysis with the multisom model, pp. 7–23 (2003)
14.
Zurück zum Zitat Khanchouch, I., Boujenfa, K., Limam, M.: An Improved multi-SOM algorithm. Int. J. Netw. Secur. Appl. (IJNSA) 5(4), 181–186 (2013) Khanchouch, I., Boujenfa, K., Limam, M.: An Improved multi-SOM algorithm. Int. J. Netw. Secur. Appl. (IJNSA) 5(4), 181–186 (2013)
15.
Zurück zum Zitat Fort, J.-C., Letremy, P., Cottrell, M.: Batch Kohonen algorithm. pp. 223–230 (2002) Fort, J.-C., Letremy, P., Cottrell, M.: Batch Kohonen algorithm. pp. 223–230 (2002)
16.
Zurück zum Zitat Halkidi, M., Vazirgiannis, M., Batistakis, Y.: Quality scheme assessment in the clustering process. In: Proceedings of PKDD (Principles and Practice of Knowledge Discovery in Databases ), Lyon, France (2000) Halkidi, M., Vazirgiannis, M., Batistakis, Y.: Quality scheme assessment in the clustering process. In: Proceedings of PKDD (Principles and Practice of Knowledge Discovery in Databases ), Lyon, France (2000)
17.
Zurück zum Zitat Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 1, 224–227 (1979)CrossRef Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 1, 224–227 (1979)CrossRef
18.
Zurück zum Zitat Dunn, J.C.: A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. Cybern. Syst. 3, 32–57 (1974) Dunn, J.C.: A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. Cybern. Syst. 3, 32–57 (1974)
19.
Zurück zum Zitat Shen, J., Chang, S.I., Lee, E.S., Deng, Y., Brown, S.J.: Determination of cluster number in clustering microarray data. Appl. Math. Comput. 169(2), 1172–1185 (2005)MATHMathSciNetCrossRef Shen, J., Chang, S.I., Lee, E.S., Deng, Y., Brown, S.J.: Determination of cluster number in clustering microarray data. Appl. Math. Comput. 169(2), 1172–1185 (2005)MATHMathSciNetCrossRef
20.
Zurück zum Zitat Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Comput. Appl. Math. 20, 53–65 (1987)MATHCrossRef Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Comput. Appl. Math. 20, 53–65 (1987)MATHCrossRef
Metadaten
Titel
An Improved Multi-SOM Algorithm for Determining the Optimal Number of Clusters
verfasst von
Imèn Khanchouch
Malika Charrad
Mohamed Limam
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-23467-0_13