首页> 外文会议>ICMLA 2012;International Conference on Machine Learning and Applications >Can Frequent Itemset Mining Be Efficiently and Effectively Used for Learning from Graph Data?
【24h】

Can Frequent Itemset Mining Be Efficiently and Effectively Used for Learning from Graph Data?

机译:可以有效地有效地使用频繁项集挖掘以从图数据中学习吗?

获取原文

摘要

Standard graph learning approaches are often challenged by the computational cost involved when learning from very large sets of graph data. One approach to overcome this problem is to transform the graphs into less complex structures that can be more efficiently handled. One obvious potential drawback of this approach is that it may degrade predictive performance due to loss of information caused by the transformations. An investigation of the tradeoff between efficiency and effectiveness of graph learning methods is presented, in which state-of-the-art graph mining approaches are compared to representing graphs by itemsets, using frequent itemset mining to discover features to use in prediction models. An empirical evaluation on 18 medicinal chemistry datasets is presented, showing that employing frequent itemset mining results in significant speedups, without sacrificing predictive performance for both classification and regression.
机译:从大量图形数据中学习时,标准图形学习方法通​​常会受到所涉及的计算成本的挑战。解决此问题的一种方法是将图形转换为可以更有效地处理的较不复杂的结构。这种方法的一个明显的潜在缺点是,由于转换导致的信息丢失,它可能会降低预测性能。提出了对图学习方法的效率和有效性之间的权衡的研究,其中将最先进的图挖掘方法与由项集表示的图进行比较,并使用频繁项集挖掘来发现要在预测模型中使用的特征。提出了对18种药物化学数据集的实证评估,表明采用频繁的项集挖掘可显着提高速度,而不会牺牲分类和回归的预测性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号