On Balanced Clustering (Indices, Models, Examples)


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

The paper describes and approach to balanced clustering problems. The list of balanced structures includes balanced partitioning of a set, balanced trees, balanced decomposition of a graph, and balanced multilevel structures. Balance indices (characteristics) for balanced structures (clustering solutions) are based on the difference between the cluster parameters: cardinality of a cluster, the total cluster weight, the total weight of edges/arcs of a cluster, and the structure of a cluster in terms of the types of its elements. The proposed balance indices are used as components for optimization models of balanced clustering: objective functions and constraints. Three numerical examples are presented: (1) calculating the balance indices for clustering based on the structure of a cluster in terms of the types of its elements; (2) calculating the balance indices for a clustering solution for a sample network; (3) balanced clustering for forming several student teams.

作者简介

M. Levin

Kharkevich Institute for Information Transmission Problems

编辑信件的主要联系方式.
Email: mslevin@acm.org
俄罗斯联邦, Moscow, 127994


版权所有 © Pleiades Publishing, Inc., 2017
##common.cookie##