首页> 外文期刊>Journal of Intelligent Information Systems >Clustering of semantically enriched short texts
【24h】

Clustering of semantically enriched short texts

机译:聚类语义丰富的短文本

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

摘要

The paper is devoted to the issue of clustering small sets of very short texts. Such texts are often incomplete and highly inconclusive, so establishing a notion of proximity between them is a challenging task. In order to cope with polysemy we adapt the SenseSearcher algorithm (SnS), by Kozlowski and Rybinski in Computational Intelligence 33(3): 335-367, 2017b. In addition, we test the possibilities of improving the quality of clustering ultra-short texts by means of enriching them semantically. We present two approaches, one based on neural-based distributional models, and the other based on external knowledge resources. The approaches are tested on SnSRC and other knowledge-poor algorithms.
机译:本文致力于聚类小组非常短的文本问题。这些文本通常不完整,高度不确定,因此在他们之间建立邻近的概念是一项有挑战性的任务。为了应对多义,我们通过计算智能的Kozlowski和Rybinski调整SenseSearcher算法(SNS),33(3):335-367,2017B。此外,我们通过在语义上通过丰富它们来测试提高聚类超短文本质量的可能性。我们提出了两种方法,一个基于神经的分布模型,另一个基于外部知识资源。该方法在SNSRC和其他知识差的算法上进行了测试。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号