Skip to main content

Hierarchy of Groups Evaluation Using Different F-Score Variants

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2016)

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

Included in the following conference series:

  • 2302 Accesses

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.

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 EPUB and 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

References

  1. 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)

    Article  Google Scholar 

  2. Blundell, C., Teh, Y.W., Heller, K.A.: Bayesian rose trees. arXiv preprint. (2012). arxiv:1203.3468

  3. 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)

    Google Scholar 

  4. Desgraupes, B.: Clustering indices (2013). https://cran.r-project.org/web/packages/clusterCrit/vignettes/clusterCrit.pdf

  5. Everitt, B.S., Landau, S., Leese, M., Stahl, D.: Cluster Analysis. John Wiley and Sons Ltd, New York (2011)

    Book  MATH  Google Scholar 

  6. Ghahramani, Z., Jordan, M.I., Adams, R.P.: Tree-structured stick breaking for hierarchical data. In: NIPS, pp. 19–27 (2010)

    Google Scholar 

  7. Hartigan, J.A., Wong, M.A.: Algorithm as 136: A k-means clustering algorithm. Appl. Stat. 28(1), 100–108 (1979)

    Article  MATH  Google Scholar 

  8. Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)

    Article  Google Scholar 

  9. Kogan, J., Nicholas, C.K., Teboulle, M.: Grouping Multidimensional Data: Recent Advances in Clustering. Springer, Heidelberg (2006)

    Book  MATH  Google Scholar 

  10. 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)

    Google Scholar 

  11. Madhulatha, T.S.: An overview on clustering methods. CoRR abs/1205.1117 (2012)

    Google Scholar 

  12. Mirzaei, A., Rahmati, M., Ahmadi, M.: A new method for hierarchical clustering combination. Intell. Data Anal. 12(6), 549–571 (2008)

    Google Scholar 

  13. Oded, M., Lior, R. (eds.): Data Mining and Knowledge Discovery Handbook. Springer, New York (2010)

    MATH  Google Scholar 

  14. 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)

    Google Scholar 

  15. 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)

    Article  Google Scholar 

  16. van Rijsbergen, C.J.: Information Retrieval. Butterworth, London (1979)

    MATH  Google Scholar 

  17. Sevillano, X., Valero, X., Alas, F.: Look, listen and find: A purely audiovisual approach to online videos geotagging. Inf. Sci. 295, 558–572 (2015)

    Article  Google Scholar 

  18. 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)

    Google Scholar 

  19. Xu, R., Wunsch, D.: Survey of clustering algorithms. Trans. Neur. Netw. 16(3), 645–678 (2005)

    Article  Google Scholar 

Download references

Acknowledgements

The research was supported by the European Commission under the 7th Framework Programme, Coordination and Support Action, Grant Agreement Number 316097, ENGINE – European research centre of Network intelliGence for INnovation Enhancement (http://engine.pwr.wroc.pl/).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Łukasz P. Olech .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spytkowski, M., Olech, Ł.P., Kwaśnicka, H. (2016). Hierarchy of Groups Evaluation Using Different F-Score Variants. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49381-6_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49381-6_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49380-9

  • Online ISBN: 978-3-662-49381-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics