对于给定一个聚类中心的二聚类问题，一些保证精度的算法

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) Pub Date : 2017-09-01 DOI:10.1109/SIBIRCON.2017.8109844

A. Kel'manov, V. Khandeev

{"title":"对于给定一个聚类中心的二聚类问题，一些保证精度的算法","authors":"A. Kel'manov, V. Khandeev","doi":"10.1109/SIBIRCON.2017.8109844","DOIUrl":null,"url":null,"abstract":"We consider the problem of 2-partitioning a finite set of points in Euclidean space minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on the results for this problem.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster\",\"authors\":\"A. Kel'manov, V. Khandeev\",\"doi\":\"10.1109/SIBIRCON.2017.8109844\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of 2-partitioning a finite set of points in Euclidean space minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on the results for this problem.\",\"PeriodicalId\":135870,\"journal\":{\"name\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2017.8109844\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们考虑在欧几里得空间中有限点集的2-划分问题，最小化聚类元素与相应聚类中心之间距离的平方和。假设其中一个期望聚类的中心是原点，而另一个聚类的中心是未知的，并确定为聚类元素的平均值。在这项工作中，我们对这个问题的结果进行了简短的调查。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster

We consider the problem of 2-partitioning a finite set of points in Euclidean space minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on the results for this problem.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

自引率

0.00%

发文量