Skip to main content
Top

2016 | OriginalPaper | Chapter

Hierarchy of Groups Evaluation Using Different F-Score Variants

Authors : Michał Spytkowski, Łukasz P. Olech, Halina Kwaśnicka

Published in: Intelligent Information and Database Systems

Publisher: Springer Berlin Heidelberg

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The paper presents a cursory examination of clustering, focusing on a rarely explored field of hierarchy of clusters. Based on this, a short discussion of clustering quality measures is presented and the F-score measure is examined more deeply. As there are no attempts to assess the quality for hierarchies of clusters, three variants of the F-Score based index are presented: classic, hierarchical and partial order. The partial order index is the authors’ approach to the subject. Conducted experiments show the properties of the considered measures. In conclusions, the strong and weak sides of each variant are presented.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
1.
go back to reference Andreopoulos, B., An, A., Wang, X., Schroeder, M.: A roadmap of clustering algorithms: finding a match for a biomedical application. Brief. Bioinform. 10(3), 297–314 (2009)CrossRef Andreopoulos, B., An, A., Wang, X., Schroeder, M.: A roadmap of clustering algorithms: finding a match for a biomedical application. Brief. Bioinform. 10(3), 297–314 (2009)CrossRef
3.
go back to reference Cimiano, P., Hotho, A., Staab, S.: Comparing conceptual, divise and agglomerative clustering for learning taxonomies from text. In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on AI, Spain, pp. 435–439. IOS Press (2004) Cimiano, P., Hotho, A., Staab, S.: Comparing conceptual, divise and agglomerative clustering for learning taxonomies from text. In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on AI, Spain, pp. 435–439. IOS Press (2004)
5.
go back to reference Everitt, B.S., Landau, S., Leese, M., Stahl, D.: Cluster Analysis. John Wiley and Sons Ltd, New York (2011)CrossRefMATH Everitt, B.S., Landau, S., Leese, M., Stahl, D.: Cluster Analysis. John Wiley and Sons Ltd, New York (2011)CrossRefMATH
6.
go back to reference Ghahramani, Z., Jordan, M.I., Adams, R.P.: Tree-structured stick breaking for hierarchical data. In: NIPS, pp. 19–27 (2010) Ghahramani, Z., Jordan, M.I., Adams, R.P.: Tree-structured stick breaking for hierarchical data. In: NIPS, pp. 19–27 (2010)
7.
go back to reference Hartigan, J.A., Wong, M.A.: Algorithm as 136: A k-means clustering algorithm. Appl. Stat. 28(1), 100–108 (1979)CrossRefMATH Hartigan, J.A., Wong, M.A.: Algorithm as 136: A k-means clustering algorithm. Appl. Stat. 28(1), 100–108 (1979)CrossRefMATH
8.
go back to reference Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)CrossRef Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)CrossRef
9.
go back to reference Kogan, J., Nicholas, C.K., Teboulle, M.: Grouping Multidimensional Data: Recent Advances in Clustering. Springer, Heidelberg (2006)CrossRefMATH Kogan, J., Nicholas, C.K., Teboulle, M.: Grouping Multidimensional Data: Recent Advances in Clustering. Springer, Heidelberg (2006)CrossRefMATH
10.
go back to reference Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: Fayyad, U.M., Chaudhuri, S., Madigan, D. (eds.) Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, USA, pp. 16–22. ACM (1999) Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: Fayyad, U.M., Chaudhuri, S., Madigan, D. (eds.) Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, USA, pp. 16–22. ACM (1999)
11.
go back to reference Madhulatha, T.S.: An overview on clustering methods. CoRR abs/1205.1117 (2012) Madhulatha, T.S.: An overview on clustering methods. CoRR abs/1205.1117 (2012)
12.
go back to reference Mirzaei, A., Rahmati, M., Ahmadi, M.: A new method for hierarchical clustering combination. Intell. Data Anal. 12(6), 549–571 (2008) Mirzaei, A., Rahmati, M., Ahmadi, M.: A new method for hierarchical clustering combination. Intell. Data Anal. 12(6), 549–571 (2008)
13.
go back to reference Oded, M., Lior, R. (eds.): Data Mining and Knowledge Discovery Handbook. Springer, New York (2010)MATH Oded, M., Lior, R. (eds.): Data Mining and Knowledge Discovery Handbook. Springer, New York (2010)MATH
14.
go back to reference Olech, L.P., Paradowski, M.: Hierarchical gaussian mixture model with objects attached to terminal and non-terminal dendrogram nodes. In: 9th International Conference on Computer Recognition Systems, Poland (2015) Olech, L.P., Paradowski, M.: Hierarchical gaussian mixture model with objects attached to terminal and non-terminal dendrogram nodes. In: 9th International Conference on Computer Recognition Systems, Poland (2015)
15.
go back to reference Pohl, D., Bouchachia, A., Hellwagner, H.: Social media for crisis management: clustering approaches for sub-event detection. Multimed. Tools Appl. 74(11), 3901–3932 (2015)CrossRef Pohl, D., Bouchachia, A., Hellwagner, H.: Social media for crisis management: clustering approaches for sub-event detection. Multimed. Tools Appl. 74(11), 3901–3932 (2015)CrossRef
16.
go back to reference van Rijsbergen, C.J.: Information Retrieval. Butterworth, London (1979)MATH van Rijsbergen, C.J.: Information Retrieval. Butterworth, London (1979)MATH
17.
go back to reference Sevillano, X., Valero, X., Alas, F.: Look, listen and find: A purely audiovisual approach to online videos geotagging. Inf. Sci. 295, 558–572 (2015)CrossRef Sevillano, X., Valero, X., Alas, F.: Look, listen and find: A purely audiovisual approach to online videos geotagging. Inf. Sci. 295, 558–572 (2015)CrossRef
18.
go back to reference Spytkowski, M., Kwasnicka, H.: Hierarchical clustering through bayesian inference. In: Nguyen, N.-T., Hoang, K., Jȩdrzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol. 7653, pp. 515–524. Springer, Heidelberg (2012) Spytkowski, M., Kwasnicka, H.: Hierarchical clustering through bayesian inference. In: Nguyen, N.-T., Hoang, K., Jȩdrzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol. 7653, pp. 515–524. Springer, Heidelberg (2012)
19.
go back to reference Xu, R., Wunsch, D.: Survey of clustering algorithms. Trans. Neur. Netw. 16(3), 645–678 (2005)CrossRef Xu, R., Wunsch, D.: Survey of clustering algorithms. Trans. Neur. Netw. 16(3), 645–678 (2005)CrossRef
Metadata
Title
Hierarchy of Groups Evaluation Using Different F-Score Variants
Authors
Michał Spytkowski
Łukasz P. Olech
Halina Kwaśnicka
Copyright Year
2016
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-49381-6_63

Premium Partner