【24h】

String Similarity Computing Based on Position And Cosine

机译:基于位置和余弦的字符串相似性计算

获取原文

摘要

E-Business platform needs to have the production selection functionalities according to the products' feature and their cost performance, and at the same time, we need to clean data in the production and sale process, so it is important to calculate similarity between products. This paper proposes a new way to compute the similarity of string by segmenting string into words, numbering the corresponding positions and vectorizing the string. Then the similarity between the strings is computed by computing the cosine angle of the two vectors. Experiments show that the method avoids the maximum or minimum of LCS and GST. In addition, the proposed method also improves the accuracy of similarity calculation.
机译:E-Business Platform需要根据产品的功能和成本表现进行生产选择功能,同时,我们需要清洁生产和销售过程中的数据,因此计算产品之间的相似性很重要。本文提出了一种通过将字符串分割为单词来计算字符串相似性的新方法,编号相应的位置和矢量化字符串。然后通过计算两个向量的余弦角来计算字符串之间的相似性。实验表明,该方法避免了LCS和GST的最大值或最小值。此外,所提出的方法还提高了相似性计算的准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号