Applying Cooperative Games with Coalition Structure for Data Clustering

V. M. Bure, K. Yu Staroverova

Результат исследований: Научные публикации в периодических изданияхстатья

Выдержка

This paper considers a cooperative game in which the distance (or similarity) between some objects (players) can be measured numerically. For this game, a characteristic function is defined so that it takes high values for the coalitions consisting of most close (similar) players in comparison with the players from the other coalitions. Such a function does not satisfy superadditivity, and hence it seems reasonable to introduce the model with coalition structure. Therefore, this game can be treated as a clustering procedure for objects (players). Finally, the existence conditions of a stable coalition structure are established, which allow to perform efficient (crisp) clustering.

Язык оригиналаанглийский
Страницы (с-по)1541-1551
ЖурналAutomation and Remote Control
Том80
Номер выпуска8
DOI
СостояниеОпубликовано - 1 авг 2019

Предметные области Scopus

  • Системотехника
  • Электротехника и электроника

Цитировать

Bure, V. M. ; Staroverova, K. Yu. / Applying Cooperative Games with Coalition Structure for Data Clustering. В: Automation and Remote Control. 2019 ; Том 80, № 8. стр. 1541-1551.
@article{b96eef84a06f4515b05639197f13e778,
title = "Applying Cooperative Games with Coalition Structure for Data Clustering",
abstract = "This paper considers a cooperative game in which the distance (or similarity) between some objects (players) can be measured numerically. For this game, a characteristic function is defined so that it takes high values for the coalitions consisting of most close (similar) players in comparison with the players from the other coalitions. Such a function does not satisfy superadditivity, and hence it seems reasonable to introduce the model with coalition structure. Therefore, this game can be treated as a clustering procedure for objects (players). Finally, the existence conditions of a stable coalition structure are established, which allow to perform efficient (crisp) clustering.",
keywords = "Aumann—Dreze value, clustering, coalition, ESD value, Shapley value, stable coalition structure",
author = "Bure, {V. M.} and Staroverova, {K. Yu}",
year = "2019",
month = "8",
day = "1",
doi = "10.1134/S0005117919080125",
language = "English",
volume = "80",
pages = "1541--1551",
journal = "Automation and Remote Control",
issn = "0005-1179",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "8",

}

Applying Cooperative Games with Coalition Structure for Data Clustering. / Bure, V. M.; Staroverova, K. Yu.

В: Automation and Remote Control, Том 80, № 8, 01.08.2019, стр. 1541-1551.

Результат исследований: Научные публикации в периодических изданияхстатья

TY - JOUR

T1 - Applying Cooperative Games with Coalition Structure for Data Clustering

AU - Bure, V. M.

AU - Staroverova, K. Yu

PY - 2019/8/1

Y1 - 2019/8/1

N2 - This paper considers a cooperative game in which the distance (or similarity) between some objects (players) can be measured numerically. For this game, a characteristic function is defined so that it takes high values for the coalitions consisting of most close (similar) players in comparison with the players from the other coalitions. Such a function does not satisfy superadditivity, and hence it seems reasonable to introduce the model with coalition structure. Therefore, this game can be treated as a clustering procedure for objects (players). Finally, the existence conditions of a stable coalition structure are established, which allow to perform efficient (crisp) clustering.

AB - This paper considers a cooperative game in which the distance (or similarity) between some objects (players) can be measured numerically. For this game, a characteristic function is defined so that it takes high values for the coalitions consisting of most close (similar) players in comparison with the players from the other coalitions. Such a function does not satisfy superadditivity, and hence it seems reasonable to introduce the model with coalition structure. Therefore, this game can be treated as a clustering procedure for objects (players). Finally, the existence conditions of a stable coalition structure are established, which allow to perform efficient (crisp) clustering.

KW - Aumann—Dreze value

KW - clustering

KW - coalition

KW - ESD value

KW - Shapley value

KW - stable coalition structure

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

U2 - 10.1134/S0005117919080125

DO - 10.1134/S0005117919080125

M3 - Article

AN - SCOPUS:85070745744

VL - 80

SP - 1541

EP - 1551

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 8

ER -