首页> 外文会议>International Conference on Machine Learning and Data Mining in Pattern Recognition(MLDM 2005) >Discovery of Hidden Correlations in a Local Transaction Database Based on Differences of Correlations
【24h】

Discovery of Hidden Correlations in a Local Transaction Database Based on Differences of Correlations

机译:根据相关性差异发现本地交易数据库中的隐藏相关性

获取原文
获取外文期刊封面目录资料

摘要

Given a transaction database as a global set of transactions and its sub-database regarded as a local one, we consider a pair of item-sets whose degrees of correlations are higher in the local database than in the global one. If they show high correlation in the local database, they are detectable by some search methods of previous studies. On the other hand, there exist another kind of paired itemsets such that they are not regarded as characteristic and cannot be found by the methods of previous studies but that their degrees of correlations become drastically higher by the conditioning to the local database. We pay much attention to the latter kind of paired itemsets, as such pairs of itemsets can be an implicit and hidden evidence showing that something particular to the local database occurs even though they are not yet realized as characteristic ones. Prom this viewpoint, we measure paired itemsets by a difference of two correlations before and after the conditioning to the local database, and define a notion of DC pairs whose degrees of differences of correlations are high. As the measure is non-monotonic, we present an algorithm, searching for DC pairs, with some new pruning rules for cutting off hopeless itemsets. We show by an experimental result that potentially significant DC pairs can be actually found for a given database and the algorithm successfully detects such DC pairs.
机译:鉴于交易数据库作为全局交易集及其子数据库被视为本地数据库,我们考虑一对项目集,其在本地数据库中的相关程度比全局在全球数据库中更高。如果它们在本地数据库中显示出高的相关性,则通过先前研究的一些搜索方法可检测到它们。另一方面,存在另一种成对的项目集,使得它们不被认为是特征,并且不能通过先前研究的方法找到,但是,由于对本地数据库的调节,它们的相关程度变得越来越较高。我们非常注重后一种配对的项目集,因为这些项目集可以是隐式和隐藏的证据,表明,即使它们尚未被实现为特征性,也会出现对本地数据库的某些东西。促销此观点,我们通过在调理到本地数据库之前和之后的两个相关性的差异来测量配对项集,并定义其相关性相关性的DC对的概念。由于该措施是非单调的,我们呈现了一种算法,搜索DC对,具有一些新的修剪规则,用于切断无望的项目集。我们通过实验结果表明,对于给定数据库,实际可以找到潜在的显着的DC对,并且该算法成功地检测了这种DC对。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号