Graph-based clustering algorithms

Ágnes Vathy-Fogarassy, J. Abonyi

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

The way how graph-based clustering algorithms utilize graphs for partitioning data is very various. In this chapter, two approaches are presented. The first hierarchical clustering algorithm combines minimal spanning trees and Gath-Geva fuzzy clustering. The second algorithm utilizes a neighborhood-based fuzzy similarity measure to improve k-nearest neighbor graph based Jarvis-Patrick clustering.

Original languageEnglish
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages17-41
Number of pages25
Edition9781447151579
DOIs
Publication statusPublished - Jan 1 2013

Publication series

NameSpringerBriefs in Computer Science
Number9781447151579
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Fingerprint

Clustering algorithms
Fuzzy clustering

Keywords

  • Cluster algorithm
  • Cluster rate
  • Fuzzy cluster
  • Minimal span tree
  • Single linkage

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Vathy-Fogarassy, Á., & Abonyi, J. (2013). Graph-based clustering algorithms. In SpringerBriefs in Computer Science (9781447151579 ed., pp. 17-41). (SpringerBriefs in Computer Science; No. 9781447151579). Springer. https://doi.org/10.1007/978-1-4471-5158-6_2

Graph-based clustering algorithms. / Vathy-Fogarassy, Ágnes; Abonyi, J.

SpringerBriefs in Computer Science. 9781447151579. ed. Springer, 2013. p. 17-41 (SpringerBriefs in Computer Science; No. 9781447151579).

Research output: Chapter in Book/Report/Conference proceedingChapter

Vathy-Fogarassy, Á & Abonyi, J 2013, Graph-based clustering algorithms. in SpringerBriefs in Computer Science. 9781447151579 edn, SpringerBriefs in Computer Science, no. 9781447151579, Springer, pp. 17-41. https://doi.org/10.1007/978-1-4471-5158-6_2
Vathy-Fogarassy Á, Abonyi J. Graph-based clustering algorithms. In SpringerBriefs in Computer Science. 9781447151579 ed. Springer. 2013. p. 17-41. (SpringerBriefs in Computer Science; 9781447151579). https://doi.org/10.1007/978-1-4471-5158-6_2
Vathy-Fogarassy, Ágnes ; Abonyi, J. / Graph-based clustering algorithms. SpringerBriefs in Computer Science. 9781447151579. ed. Springer, 2013. pp. 17-41 (SpringerBriefs in Computer Science; 9781447151579).
@inbook{98c20c6d3bbb46e4b5ae816e6774d75b,
title = "Graph-based clustering algorithms",
abstract = "The way how graph-based clustering algorithms utilize graphs for partitioning data is very various. In this chapter, two approaches are presented. The first hierarchical clustering algorithm combines minimal spanning trees and Gath-Geva fuzzy clustering. The second algorithm utilizes a neighborhood-based fuzzy similarity measure to improve k-nearest neighbor graph based Jarvis-Patrick clustering.",
keywords = "Cluster algorithm, Cluster rate, Fuzzy cluster, Minimal span tree, Single linkage",
author = "{\'A}gnes Vathy-Fogarassy and J. Abonyi",
year = "2013",
month = "1",
day = "1",
doi = "10.1007/978-1-4471-5158-6_2",
language = "English",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9781447151579",
pages = "17--41",
booktitle = "SpringerBriefs in Computer Science",
edition = "9781447151579",

}

TY - CHAP

T1 - Graph-based clustering algorithms

AU - Vathy-Fogarassy, Ágnes

AU - Abonyi, J.

PY - 2013/1/1

Y1 - 2013/1/1

N2 - The way how graph-based clustering algorithms utilize graphs for partitioning data is very various. In this chapter, two approaches are presented. The first hierarchical clustering algorithm combines minimal spanning trees and Gath-Geva fuzzy clustering. The second algorithm utilizes a neighborhood-based fuzzy similarity measure to improve k-nearest neighbor graph based Jarvis-Patrick clustering.

AB - The way how graph-based clustering algorithms utilize graphs for partitioning data is very various. In this chapter, two approaches are presented. The first hierarchical clustering algorithm combines minimal spanning trees and Gath-Geva fuzzy clustering. The second algorithm utilizes a neighborhood-based fuzzy similarity measure to improve k-nearest neighbor graph based Jarvis-Patrick clustering.

KW - Cluster algorithm

KW - Cluster rate

KW - Fuzzy cluster

KW - Minimal span tree

KW - Single linkage

UR - http://www.scopus.com/inward/record.url?scp=84976483337&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976483337&partnerID=8YFLogxK

U2 - 10.1007/978-1-4471-5158-6_2

DO - 10.1007/978-1-4471-5158-6_2

M3 - Chapter

T3 - SpringerBriefs in Computer Science

SP - 17

EP - 41

BT - SpringerBriefs in Computer Science

PB - Springer

ER -