Theory of preference modelling for communities in scale-free networks

Abstract Detecting a community structure on networks is a problem of interest in science and many other domains. Communities are special structures which may consist nodes with some common features. The identification of overlapping communities can clarify not so apparent features about relationship...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	József Dombi, Sakshi Dhama
Formato:	article
Lenguaje:	EN
Publicado:	SpringerOpen 2021
Materias:	Overlapping-communities Continuous-value-logic Preference-implication Power-law Networks Applied mathematics. Quantitative methods T57-57.97
Acceso en línea:	https://doaj.org/article/636498f9bf844fa0a364dbed45c174d7
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:636498f9bf844fa0a364dbed45c174d7
record_format	dspace
spelling	oai:doaj.org-article:636498f9bf844fa0a364dbed45c174d72021-11-07T12:18:53ZTheory of preference modelling for communities in scale-free networks10.1007/s41109-021-00424-02364-8228https://doaj.org/article/636498f9bf844fa0a364dbed45c174d72021-11-01T00:00:00Zhttps://doi.org/10.1007/s41109-021-00424-0https://doaj.org/toc/2364-8228Abstract Detecting a community structure on networks is a problem of interest in science and many other domains. Communities are special structures which may consist nodes with some common features. The identification of overlapping communities can clarify not so apparent features about relationships among the nodes of a network. A node in a community can have a membership in a community with a different degree. Here, we introduce a fuzzy based approach for overlapping community detection. A special type of fuzzy operator is used to define the membership strength for the nodes of community. Fuzzy systems and logic is a branch of mathematics which introduces many-valued logic to compute the truth value. The computed truth can have a value between 0 and 1. The preference modelling approach introduces some parameters for designing communities of particular strength. The strength of a community tells us to what degree each member of community is part of a community. As for relevance and applicability of the community detection method on different types of data and in various situations, this approach generates a possibility for the user to be able to control the overlap regions created while detecting the communities. We extend the existing methods which use local function optimization for community detection. The LFM method uses a local fitness function for a community to identify the community structures. We present a community fitness function in pliant logic form and provide mathematical proofs of its properties, then we apply the preference implication of continuous-valued logic. The preference implication is based on two important parameters $$\nu$$ ν and $$\alpha$$ α . The parameter $$\nu$$ ν of the preference-implication allows us to control the design of the communities according to our requirement of the strength of the community. The parameter $$\alpha$$ α defines the sharpness of preference implication. A smaller value of the threshold for community membership creates bigger communities and more overlapping regions. A higher value of community membership threshold creates stronger communities with nodes having more participation in the community. The threshold is controlled by $$\delta$$ δ which defines the degree of relationship of a node to a community. To balance the creation of overlap regions, stronger communities and reducing outliers we choose a third parameter $$\delta$$ δ in such a way that it controls the community strength by varying the membership threshold as community evolves over time. We test the theoretical model by conducting experiments on artificial and real scale-free networks. We test the behaviour of all the parameters on different data-sets and report the outliers found. In our experiments, we found a good relationship between $$\nu$$ ν and overlapping nodes in communities.József DombiSakshi DhamaSpringerOpenarticleOverlapping-communitiesContinuous-value-logicPreference-implicationPower-lawNetworksApplied mathematics. Quantitative methodsT57-57.97ENApplied Network Science, Vol 6, Iss 1, Pp 1-32 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Overlapping-communities Continuous-value-logic Preference-implication Power-law Networks Applied mathematics. Quantitative methods T57-57.97
spellingShingle	Overlapping-communities Continuous-value-logic Preference-implication Power-law Networks Applied mathematics. Quantitative methods T57-57.97 József Dombi Sakshi Dhama Theory of preference modelling for communities in scale-free networks
description	Abstract Detecting a community structure on networks is a problem of interest in science and many other domains. Communities are special structures which may consist nodes with some common features. The identification of overlapping communities can clarify not so apparent features about relationships among the nodes of a network. A node in a community can have a membership in a community with a different degree. Here, we introduce a fuzzy based approach for overlapping community detection. A special type of fuzzy operator is used to define the membership strength for the nodes of community. Fuzzy systems and logic is a branch of mathematics which introduces many-valued logic to compute the truth value. The computed truth can have a value between 0 and 1. The preference modelling approach introduces some parameters for designing communities of particular strength. The strength of a community tells us to what degree each member of community is part of a community. As for relevance and applicability of the community detection method on different types of data and in various situations, this approach generates a possibility for the user to be able to control the overlap regions created while detecting the communities. We extend the existing methods which use local function optimization for community detection. The LFM method uses a local fitness function for a community to identify the community structures. We present a community fitness function in pliant logic form and provide mathematical proofs of its properties, then we apply the preference implication of continuous-valued logic. The preference implication is based on two important parameters $$\nu$$ ν and $$\alpha$$ α . The parameter $$\nu$$ ν of the preference-implication allows us to control the design of the communities according to our requirement of the strength of the community. The parameter $$\alpha$$ α defines the sharpness of preference implication. A smaller value of the threshold for community membership creates bigger communities and more overlapping regions. A higher value of community membership threshold creates stronger communities with nodes having more participation in the community. The threshold is controlled by $$\delta$$ δ which defines the degree of relationship of a node to a community. To balance the creation of overlap regions, stronger communities and reducing outliers we choose a third parameter $$\delta$$ δ in such a way that it controls the community strength by varying the membership threshold as community evolves over time. We test the theoretical model by conducting experiments on artificial and real scale-free networks. We test the behaviour of all the parameters on different data-sets and report the outliers found. In our experiments, we found a good relationship between $$\nu$$ ν and overlapping nodes in communities.
format	article
author	József Dombi Sakshi Dhama
author_facet	József Dombi Sakshi Dhama
author_sort	József Dombi
title	Theory of preference modelling for communities in scale-free networks
title_short	Theory of preference modelling for communities in scale-free networks
title_full	Theory of preference modelling for communities in scale-free networks
title_fullStr	Theory of preference modelling for communities in scale-free networks
title_full_unstemmed	Theory of preference modelling for communities in scale-free networks
title_sort	theory of preference modelling for communities in scale-free networks
publisher	SpringerOpen
publishDate	2021
url	https://doaj.org/article/636498f9bf844fa0a364dbed45c174d7
work_keys_str_mv	AT jozsefdombi theoryofpreferencemodellingforcommunitiesinscalefreenetworks AT sakshidhama theoryofpreferencemodellingforcommunitiesinscalefreenetworks
_version_	1718443489996308480

Theory of preference modelling for communities in scale-free networks

Ejemplares similares