his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On network analysis using non-additive integrals: extending the game-theoretic network centrality
University of Skövde, School of Informatics. University of Skövde, The Informatics Research Centre. Hamilton Institute, Maynooth University, Ireland. (Skövde Artificial Intelligence Lab (SAIL))ORCID iD: 0000-0002-0368-8037
Department of Management Science, Tamagawa University, Japan.
2019 (English)In: Soft Computing - A Fusion of Foundations, Methodologies and Applications, ISSN 1432-7643, E-ISSN 1433-7479, Vol. 23, no 7, p. 2321-2329Article in journal (Refereed) Published
Abstract [en]

There are large amounts of information that can be represented in terms of graphs. This includes social networks and internet. We can represent people and their interactions by means of graphs. Similarly, we can represent web pages (and sites) as well as links between pages by means of graphs. In order to study the properties of graphs, several indices have been defined. They include degree centrality, betweenness, and closeness. In this paper, we propose the use of Choquet and Sugeno integrals with respect to non-additive measures for network analysis. This is a natural extension of the use of game theory for network analysis. Recall that monotonic games in game theory are non-additive measures. We discuss the expected force, a centrality measure, in the light of non-additive integral network analysis. We also show that some results by Godo et al. can be used to compute network indices when the information associated with a graph is qualitative.

Place, publisher, year, edition, pages
Springer, 2019. Vol. 23, no 7, p. 2321-2329
Keywords [en]
Non-additive measures and integrals, Graphs, Aggregation, Network analysis
National Category
Computer Sciences
Research subject
Infection Biology
Identifiers
URN: urn:nbn:se:his:diva-16741DOI: 10.1007/s00500-018-03710-9ISI: 000461580400016Scopus ID: 2-s2.0-85059054946OAI: oai:DiVA.org:his-16741DiVA, id: diva2:1302282
Available from: 2019-04-04 Created: 2019-04-04 Last updated: 2019-04-09Bibliographically approved

Open Access in DiVA

fulltext(493 kB)44 downloads
File information
File name FULLTEXT01.pdfFile size 493 kBChecksum SHA-512
ee889b16f6bc1ca955009f491ef92285a631e1fc953cdc3c384b016530c374df0367279f3947317ba44372aa53e07670a8138bb3b405390d06103cfe57f04c36
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Torra, Vicenç

Search in DiVA

By author/editor
Torra, Vicenç
By organisation
School of InformaticsThe Informatics Research Centre
In the same journal
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 44 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 84 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf