首页> 外文会议>International Conference on Enterprise Information Systems >Using the Google Similarity Distance for OLAP Textual Aggregation
【24h】

Using the Google Similarity Distance for OLAP Textual Aggregation

机译:使用Google相似距离进行OLAP文本聚合

获取原文

摘要

With the tremendous growth of unstructured data in the Business Intelligence, there is a need for incorporating textual data into data warehouses, to provide an appropriate multidimensional analysis (OLAP) and develop new approaches that take into account the textual content of data. This will provide textual measures to users who wish to analyse documents online. In this paper, we propose a new aggregation function for textual data in an OLAP context. For aggregating keywords, our contribution is to use a data mining technique, such as k-means, but with a distance based on the Google similarity distance. Thus our approach considers the semantic similarity of keywords for their aggregation. The performance of our approach is analyzed and compared to another method using the k-bisecting clustering algorithm and based on the Jensen-Shannon divergence for the probability distributions. The experimental study shows that our approach achieves better performances in terms of recall, precision, F-measure complexity and runtime.
机译:随着非结构化数据的商业智能的巨大增长,有必要用于将文本数据到数据仓库,为客户提供适当的多维分析(OLAP),并制定考虑到数据的文本内容的新方法。这将为希望在线分析文件的用户提供文本措施。在本文中,我们提出了在OLAP上下文中的文本数据的新聚合函数。对于聚合关键字,我们的贡献是使用数据挖掘技术,例如K-means,但基于Google相似距离的距离。因此,我们的方法考虑了它们的聚合的关键字的语义相似性。通过使用K-Boting聚类算法的另一种方法分析我们方法的性能,并基于Jensen-Shannon发散的概率分布。实验研究表明,我们的方法在召回,精度,F测量复杂性和运行时实现了更好的表现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号