伪质心聚类
Pseudo-Centroid Clustering
摘要:
伪质心聚类用伪质心(或无坐标质心)的概念取代了传统的质心表示为重心的概念,其优点是适用于点没有数值坐标(或转换为数值形式的分类坐标)的聚类问题。这些问题,经典的质心不存在,在社会科学,市场营销,心理学和经济学中特别重要,其中距离不是从矢量坐标计算的,而是根据诸如亲和关系,心理偏好,广告响应,民意调查数据,市场互动等的特征来表达的,其中距离,广义地说,衡量特征、功能或结构的相似性(或不同性)。我们制定一个K-PC算法类似于一个K-Means算法,并确定两个关键类型的伪质心,最小最大质心和(加权)最小和质心,并描述它们如何分别产生一个K-MinMax算法和K-MinSum算法,这是类似于一个K-Means算法。K-PC算法能够利用问题结构来识别特殊的基于多样性和基于强度的起始方法,以生成初始伪质心和相关聚类,伴随着基于强度的方法的定理,该定理建立了它们从每个构建阶段可用的点获得选定大小的最佳聚类的能力。我们还介绍了一个遗憾阈值PC算法,修改K-PC算法与相关的多样化方法和一个新的标准,用于评估质量的集群的集合。
英文摘要:
Pseudo-Centroid Clustering replaces the traditional concept of a centroid expressed as a center of gravity with the notion of a pseudo-centroid (or a coordinate free centroid) which has the advantage of applying to clustering problems where points do not have numerical coordinates (or categorical coordinates that are translated into numerical form). Such problems, for which classical centroids do not exist, are particularly important in social sciences, marketing, psychology and economics, where distances are not computed from vector coordinates but rather are expressed in terms of characteristics such as affinity relationships, psychological preferences, advertising responses, polling data, market interactions and so forth, where distances, broadly conceived, measure the similarity (or dissimilarity) of characteristics, functions or structures. We formulate a K-PC algorithm analogous to a K-Means algorithm, and identify two key types of pseudo-centroids, MinMax centroids and (weighted) MinSum centroids, and describe how they respectively give rise to a K-MinMax algorithm and a K-MinSum algorithm which are analogous to a K-Means algorithm. The K-PC algorithms are able to take advantage of problem structure to identify special diversity-based and intensity-based starting methods to generate initial pseudo-centroids and associated clusters, accompanied by theorems for the intensity-based methods that establish their ability to obtain best clusters of a selected size from the points available at each stage of construction. We also introduce a Regret-Threshold PC algorithm that modifies the K-PC algorithm together with an associated diversification method and a new criterion for evaluating the quality of a collection of clusters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。