KFU. Card publication. Clustering of the points lying on monotonous curves as a partition into antichains

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

CLUSTERING OF THE POINTS LYING ON MONOTONOUS CURVES AS A PARTITION INTO ANTICHAINS

Form of presentation

Articles in international journals and collections

Year of publication

2015

��

��

Authors, employees of KFU

Voloskov Dmitriy Sergeevich, author

Lerner Eduard Yulevich, author

Bibliographic description in the original language

Eduard Lerner and Dmitry Voloskov.Clustering of the points lying on monotonous curves as a partition into antichains // 2015. J. Phys.: Conf. Ser. 633 012066

Annotation

Let us consider some set of points on the Cartesian plane. Each point is a part of one of few curves describing the dependency between abscissas and ordinates. In this work a problem of distributing these points into clusters corresponding to different curves is being investigated. Our original method based on presenting data points as elements of partial ordered sets with coordinate order is proposed. Thus to solve clustering problem one needs to find all the points which are parts of maximum length chains and to distribute them into corresponding antichains.

Keywords

Clustering, partial ordered set, antichain, Mirsky?s theorem, Dushnik?Miller dimension

The name of the journal

J. Phys. Conf. Series

URL

http://iopscience.iop.org/article/10.1088/1742-6596/633/1/012066/pdf

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=119896&p_lang=2

Resource files

File name	Size (MB)	Format
pdf.pdf	0,76	pdf	show / download

Full metadata record

Field DC	Value	Language
dc.contributor.author	Voloskov Dmitriy Sergeevich	ru_RU
dc.contributor.author	Lerner Eduard Yulevich	ru_RU
dc.date.accessioned	2015-01-01T00:00:00Z	ru_RU
dc.date.available	2015-01-01T00:00:00Z	ru_RU
dc.date.issued	2015	ru_RU
dc.identifier.citation	Eduard Lerner and Dmitry Voloskov.Clustering of the points lying on monotonous curves as a partition into antichains // 2015. J. Phys.: Conf. Ser. 633 012066	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=119896&p_lang=2	ru_RU
dc.description.abstract	J. Phys. Conf. Series	ru_RU
dc.description.abstract	Let us consider some set of points on the Cartesian plane. Each point is a part of one of few curves describing the dependency between abscissas and ordinates. In this work a problem of distributing these points into clusters corresponding to different curves is being investigated. Our original method based on presenting data points as elements of partial ordered sets with coordinate order is proposed. Thus to solve clustering problem one needs to find all the points which are parts of maximum length chains and to distribute them into corresponding antichains.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Clustering	ru_RU
dc.subject	partial ordered set	ru_RU
dc.subject	antichain	ru_RU
dc.subject	Mirsky?s theorem	ru_RU
dc.subject	Dushnik?Miller dimension	ru_RU
dc.title	Clustering of the points lying on monotonous curves as a partition into antichains	ru_RU
dc.type	Articles in international journals and collections	ru_RU