首页> 外文期刊>Neural Networks and Learning Systems, IEEE Transactions on >New Semi-Supervised Classification Method Based on Modified Cluster Assumption
【24h】

New Semi-Supervised Classification Method Based on Modified Cluster Assumption

机译:基于改进聚类假设的半监督分类新方法

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

摘要

The cluster assumption, which assumes that “similar instances should share the same label,” is a basic assumption in semi-supervised classification learning, and has been found very useful in many successful semi-supervised classification methods. It is rarely noticed that when the cluster assumption is adopted, there is an implicit assumption that every instance should have a crisp class label assignment. In real applications, however, there are cases where it is difficult to tell that an instance definitely belongs to one class and does not belong to other neighboring classes. In such cases, it is more adequate to assume that “similar instances should share similar label memberships” rather than sharing a crisp label assignment. Here “label memberships” can be represented as a vector, where each element corresponds to a class, and the value at the element expresses the likelihood of the concerned instance belonging to the class. By adopting this modified cluster assumption, in this paper we propose a new semi-supervised classification method, that is, semi-supervised classification based on class membership (SSCCM). Specifically, we try to solve the decision function and adequate label memberships for instances simultaneously, and constrain that an instance and its “local weighted mean” (LWM) share the same label membership vector, where the LWM is a robust image of the instance, constructed by calculating the weighted mean of its neighboring instances. We formulate the problem in a unified objective function for the labeled, unlabeled data and their LWMs based on the square loss function, and take an alternating iterative strategy to solve it, in which each step generates a closed-form solution, and the convergence is guaranteed. The solution will provide both the decision function and the label membership function for classification, their classification results can verify each other, and the relia- ility of semi-supervised classification learning might be enhanced by checking the consistency between those two predictions. Experiments show that SSCCM obtains encouraging results compared to state-of-the-art semi-supervised classification methods.
机译:聚类假设(假设“相似实例应该共享相同的标签”)是半监督分类学习中的基本假设,并且在许多成功的半监督分类方法中都非常有用。很少注意到,当采用聚类假设时,存在一个隐式假设,即每个实例都应具有清晰的类标签分配。但是,在实际应用中,有些情况下很难说出实例确实属于一个类而不属于其他相邻类。在这种情况下,假设“相似的实例应该共享相似的标签成员身份”,而不是共享明确的标签分配,就足够了。在这里,“标签成员资格”可以表示为向量,其中每个元素对应于一个类,并且该元素上的值表示所关注实例属于该类的可能性。通过采用这种改进的聚类假设,本文提出了一种新的半监督分类方法,即基于类隶属度的半监督分类(SSCCM)。具体来说,我们尝试同时解决决策函数和实例的适当标签成员资格,并约束实例及其“局部加权均值”(LWM)共享相同的标签成员向量,其中LWM是实例的可靠图像,通过计算其相邻实例的加权平均值来构造。我们基于平方损失函数,针对带标签的,未标记的数据及其LWM在统一的目标函数中表述问题,并采取交替的迭代策略来解决该问题,其中每一步都生成一个封闭形式的解决方案,并且收敛是保证。该解决方案将提供分类的决策函数和标签隶属函数,它们的分类结果可以相互验证,并且可以通过检查这两个预测之间的一致性来增强半监督分类学习的可靠性。实验表明,与最新的半监督分类方法相比,SSCCM获得了令人鼓舞的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号