首页> 外文会议>International Conference on Computational Materials Science >Top-K Strongly Related Projects Pairs Mining Algorithm Based on Threshold Estimate
【24h】

Top-K Strongly Related Projects Pairs Mining Algorithm Based on Threshold Estimate

机译:基于阈值估计的Top-K强大相关项目对挖掘算法

获取原文

摘要

This paper presents a candidate set in the case does not produce only scan through a database to extract the top-k strongly correlated item pairs method. Secondly, the structural information using a relational database, an appropriate estimate of the effective threshold, so that the results of K contains at least one project to effectively address the relational database on the Top-K strongly related to the problem of mining projects, and without Pay too much computational cost.
机译:本文介绍了在案例中的候选集,不会仅通过数据库产生扫描以提取Top-K强相关的项目对方法。其次,使用关系数据库的结构信息,适当估计有效阈值,使得k的结果包含至少一个项目,以有效地解决与采矿项目问题强烈相关的主题数据库,以及没有支付太多的计算成本。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号