Centroid averaging algorithm for a clustering ensemble

Vadim Vladimirovich Tatarnikov; Igor Alekseevich Pestunov; Vladimir Borisovich Berikov

doi:10.18287/2412-6179-2017-41-5-712-718

Centroid averaging algorithm for a clustering ensemble

Vadim Vladimirovich Tatarnikov, Igor Alekseevich Pestunov, Vladimir Borisovich Berikov

Кафедра теоретической кибернетики ММФ

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

4 Цитирования (Scopus)

Аннотация

A collective approach to cluster analysis is considered in the paper. An algorithm of centroid averaging is proposed. The algorithm allows constructing the consensus partition of a dataset into clusters, using a set of partitions built with any centroid-based algorithm. We discuss results of applying the proposed algorithm to modeled data and for the segmentation of hyperspectral images with noise channels. Some details of implementation in a multithreaded environment that allows increasing the algorithm performance are given.

Язык оригинала	английский
Страницы (с-по)	712-718
Число страниц	7
Журнал	Computer Optics
Том	41
Номер выпуска	5
DOI	https://doi.org/10.18287/2412-6179-2017-41-5-712-718
Состояние	Опубликовано - 1 сен 2017

Доступ к документу

10.18287/2412-6179-2017-41-5-712-718

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Centroid averaging algorithm for a clustering ensemble». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

Tatarnikov, V. V., Pestunov, I. A., & Berikov, V. B. (2017). Centroid averaging algorithm for a clustering ensemble. Computer Optics, 41(5), 712-718. https://doi.org/10.18287/2412-6179-2017-41-5-712-718

@article{a1aa0a577d63447686c595ada6e6a841,

title = "Centroid averaging algorithm for a clustering ensemble",

abstract = "A collective approach to cluster analysis is considered in the paper. An algorithm of centroid averaging is proposed. The algorithm allows constructing the consensus partition of a dataset into clusters, using a set of partitions built with any centroid-based algorithm. We discuss results of applying the proposed algorithm to modeled data and for the segmentation of hyperspectral images with noise channels. Some details of implementation in a multithreaded environment that allows increasing the algorithm performance are given.",

keywords = "Centroid, Clustering ensemble, Hyperspectral image analysis, K-means",

author = "Tatarnikov, {Vadim Vladimirovich} and Pestunov, {Igor Alekseevich} and Berikov, {Vladimir Borisovich}",

year = "2017",

month = sep,

day = "1",

doi = "10.18287/2412-6179-2017-41-5-712-718",

language = "English",

volume = "41",

pages = "712--718",

journal = "Computer Optics",

issn = "0134-2452",

publisher = "Institution of Russian Academy of Sciences, Image Processing Systems Institute of RAS",

number = "5",

}

TY - JOUR

T1 - Centroid averaging algorithm for a clustering ensemble

AU - Tatarnikov, Vadim Vladimirovich

AU - Pestunov, Igor Alekseevich

AU - Berikov, Vladimir Borisovich

PY - 2017/9/1

Y1 - 2017/9/1

N2 - A collective approach to cluster analysis is considered in the paper. An algorithm of centroid averaging is proposed. The algorithm allows constructing the consensus partition of a dataset into clusters, using a set of partitions built with any centroid-based algorithm. We discuss results of applying the proposed algorithm to modeled data and for the segmentation of hyperspectral images with noise channels. Some details of implementation in a multithreaded environment that allows increasing the algorithm performance are given.

AB - A collective approach to cluster analysis is considered in the paper. An algorithm of centroid averaging is proposed. The algorithm allows constructing the consensus partition of a dataset into clusters, using a set of partitions built with any centroid-based algorithm. We discuss results of applying the proposed algorithm to modeled data and for the segmentation of hyperspectral images with noise channels. Some details of implementation in a multithreaded environment that allows increasing the algorithm performance are given.

KW - Centroid

KW - Clustering ensemble

KW - Hyperspectral image analysis

KW - K-means

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

U2 - 10.18287/2412-6179-2017-41-5-712-718

DO - 10.18287/2412-6179-2017-41-5-712-718

M3 - Article

AN - SCOPUS:85037527477

VL - 41

SP - 712

EP - 718

JO - Computer Optics

JF - Computer Optics

SN - 0134-2452

IS - 5

ER -