.png){kind=icon}
返回
A new semi-supervised clustering algorithm with pairwise constraints by competitive agglomeration
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2011.05.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently semi-supervised fuzzy clustering with pairwise constraints was developed, in which the disagreement on the magnitude order between penalty cost function and the basic objective function will cause over adjustment of membership values and their deviation from the normal range. In order to solve this problem, an improved semi-supervised fuzzy clustering algorithm with pairwise constraints (SCAPC) was proposed based on a redefined objective function. The new penalty cost function in SCAPC theoretically conforms to the methodology of classical fuzzy clustering, which is expressed as the violation cost incurred by the pairs, and has the same magnitude order as the basic objective function. Experimental results on benchmark datasets and images showed that SCAPC can produce more accurate clustering by moderately enhancing or reducing the ambiguous memberships. Research indicates that constraint term of the proposed algorithm can achieve a good agreement and cooperation with the basic objective function. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Fuzzy clustering
Semi-supervised
Pairwise constraints
Penalty cost function
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏
An analytical algorithm for determining the generalized optimal set of discriminant vectors.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容