首页> 外文会议>IEEE Symposium Series on Computational Intelligence >Constrained ant brood clustering algorithm with adaptive radius: A case study on aspect based sentiment analysis
【24h】

Constrained ant brood clustering algorithm with adaptive radius: A case study on aspect based sentiment analysis

机译:具有自适应半径的约束蚁群算法:基于方面情感分析的案例研究

获取原文
获取外文期刊封面目录资料

摘要

Semi-supervised or constrained clustering refers to clustering data instances in the presence of very limited supervisory information. Although it has been widely investigated in traditional clustering algorithms such as k-means, hierarchical and spectral clustering, little research has addressed the problem of incorporating such knowledge into swarm-intelligence based clustering algorithms. In this study, we present a new Constrained Ant Clustering Algorithm (CACA) with its application to the task of aspect category identification in product reviews, a central clustering task in Aspect-Based Sentiment Analysis (ABSA). We validate our CACA on benchmark datasets, and we show its effectiveness to real-world datasets for ABSA.
机译:半监督或约束聚类是指在监管信息非常有限的情况下对数据实例进行聚类。尽管已在传统聚类算法(例如k均值,分层聚类和频谱聚类)中进行了广泛研究,但很少有研究解决将此类知识纳入基于群体智能的聚类算法中的问题。在这项研究中,我们提出了一种新的约束蚂蚁聚类算法(CACA),并将其应用于产品评论中方面类别识别的任务,这是基于方面的情感分析(ABSA)中的中心聚类任务。我们在基准数据集上验证了CACA,并向ABSA的实际数据集展示了其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号