Noise tolerant community detection using a mixed graph model

Anita Keszler, Akos Kiss, T. Szirányi

Research output: Chapter

1 Citation (Scopus)

Abstract

In this paper a new concept is proposed for finding communities in a social network based on a mixed graph theoretic model of a standard and a bipartite graph. Compared to previous methods the introduced algorithm has the advantage of noise-tolerance and is applicable independently of the size of the clusters in the graph. The cluster core-mining method is based on a modified MST algorithm. Clustering incomplete data is done by using bipartite graphs and fuzzy membership functions.

Original languageEnglish
Title of host publicationAdvances in Intelligent and Soft Computing
Pages59-68
Number of pages10
Volume80
DOIs
Publication statusPublished - 2010

Publication series

NameAdvances in Intelligent and Soft Computing
Volume80
ISSN (Print)18675662

Fingerprint

Membership functions

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Keszler, A., Kiss, A., & Szirányi, T. (2010). Noise tolerant community detection using a mixed graph model. In Advances in Intelligent and Soft Computing (Vol. 80, pp. 59-68). (Advances in Intelligent and Soft Computing; Vol. 80). https://doi.org/10.1007/978-3-642-14989-4_6

Noise tolerant community detection using a mixed graph model. / Keszler, Anita; Kiss, Akos; Szirányi, T.

Advances in Intelligent and Soft Computing. Vol. 80 2010. p. 59-68 (Advances in Intelligent and Soft Computing; Vol. 80).

Research output: Chapter

Keszler, A, Kiss, A & Szirányi, T 2010, Noise tolerant community detection using a mixed graph model. in Advances in Intelligent and Soft Computing. vol. 80, Advances in Intelligent and Soft Computing, vol. 80, pp. 59-68. https://doi.org/10.1007/978-3-642-14989-4_6
Keszler A, Kiss A, Szirányi T. Noise tolerant community detection using a mixed graph model. In Advances in Intelligent and Soft Computing. Vol. 80. 2010. p. 59-68. (Advances in Intelligent and Soft Computing). https://doi.org/10.1007/978-3-642-14989-4_6
Keszler, Anita ; Kiss, Akos ; Szirányi, T. / Noise tolerant community detection using a mixed graph model. Advances in Intelligent and Soft Computing. Vol. 80 2010. pp. 59-68 (Advances in Intelligent and Soft Computing).
@inbook{a14db0e4f9824bb4925522547aaef54b,
title = "Noise tolerant community detection using a mixed graph model",
abstract = "In this paper a new concept is proposed for finding communities in a social network based on a mixed graph theoretic model of a standard and a bipartite graph. Compared to previous methods the introduced algorithm has the advantage of noise-tolerance and is applicable independently of the size of the clusters in the graph. The cluster core-mining method is based on a modified MST algorithm. Clustering incomplete data is done by using bipartite graphs and fuzzy membership functions.",
author = "Anita Keszler and Akos Kiss and T. Szir{\'a}nyi",
year = "2010",
doi = "10.1007/978-3-642-14989-4_6",
language = "English",
isbn = "9783642149887",
volume = "80",
series = "Advances in Intelligent and Soft Computing",
pages = "59--68",
booktitle = "Advances in Intelligent and Soft Computing",

}

TY - CHAP

T1 - Noise tolerant community detection using a mixed graph model

AU - Keszler, Anita

AU - Kiss, Akos

AU - Szirányi, T.

PY - 2010

Y1 - 2010

N2 - In this paper a new concept is proposed for finding communities in a social network based on a mixed graph theoretic model of a standard and a bipartite graph. Compared to previous methods the introduced algorithm has the advantage of noise-tolerance and is applicable independently of the size of the clusters in the graph. The cluster core-mining method is based on a modified MST algorithm. Clustering incomplete data is done by using bipartite graphs and fuzzy membership functions.

AB - In this paper a new concept is proposed for finding communities in a social network based on a mixed graph theoretic model of a standard and a bipartite graph. Compared to previous methods the introduced algorithm has the advantage of noise-tolerance and is applicable independently of the size of the clusters in the graph. The cluster core-mining method is based on a modified MST algorithm. Clustering incomplete data is done by using bipartite graphs and fuzzy membership functions.

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

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

U2 - 10.1007/978-3-642-14989-4_6

DO - 10.1007/978-3-642-14989-4_6

M3 - Chapter

AN - SCOPUS:80052940136

SN - 9783642149887

VL - 80

T3 - Advances in Intelligent and Soft Computing

SP - 59

EP - 68

BT - Advances in Intelligent and Soft Computing

ER -