首页> 外文会议>Advanced data mining and applications >A Semi-supervised Clustering Algorithm Based on Must-Link Set
【24h】

A Semi-supervised Clustering Algorithm Based on Must-Link Set

机译:基于必须链接集的半监督聚类算法

获取原文
获取原文并翻译 | 示例

摘要

Clustering analysis is traditionally considered as an unsu-pervised learning process. In most cases, people usually have some prior or background knowledge before they perform the clustering. How to use the prior or background knowledge to imporve the cluster quality and promote the efficiency of clustering data has become a hot research topic in recent years. The Must-Link and Cannot-Link constraints between instances are common prior knowledge in many real applications. This paper presents the concept of Must-Link Set and designs a new semi-supervised clustering algorithm MLC-KMeans using Musk-Link Set as assistant centroid. The preliminary experiment on several UCI datasets confirms the effectiveness and efficiency of the algorithm.
机译:传统上,聚类分析被认为是未经监督的学习过程。在大多数情况下,人们在执行聚类之前通常具有一些先验知识或背景知识。如何利用先验知识或背景知识来提高聚类质量并提高聚类数据的效率已成为近年来研究的热点。实例之间的Must-Link和Cannot-Link约束是许多实际应用程序中的常识。本文提出了Must-Link集的概念,并设计了一种新的基于Musk-Link集作为辅助质心的半监督聚类算法MLC-KMeans。在几个UCI数据集上的初步实验证实了该算法的有效性和效率。

著录项

  • 来源
  • 会议地点 Chengdu(CN);Chengdu(CN)
  • 作者单位

    Computer Department, College of Information Science and Technology, Beijing University of Chemical Technology, 100029, Beijing, China;

    Computer Department, College of Information Science and Technology, Beijing University of Chemical Technology, 100029, Beijing, China;

    Computer Department, College of Information Science and Technology, Beijing University of Chemical Technology, 100029, Beijing, China;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 TP311.13;
  • 关键词

    semi-supervised learning; data clustering; constraint; MLC-KMeans algorithm;

    机译:半监督学习;数据聚类;约束; MLC-KMeans算法;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号