首页 | 本学科首页   官方微博 | 高级检索  
     

基于紧密型的兴趣度挖掘算法
引用本文:李重周,杨君锐.基于紧密型的兴趣度挖掘算法[J].数字社区&智能家居,2007,2(10):1048-1050.
作者姓名:李重周  杨君锐
作者单位:西安科技大学计算机学院 陕西西安710054
基金项目:陕西省教委(重点)专项科研基金(03JS043)。
摘    要:关联规则采掘是数据挖掘中的重要课题,针对当前关联规则采掘中可能产生许多无效关联规则的问题,分析其原因,引入了紧密度的概率,通过此约束值,将事务集中两者紧密相联的项或是在很大程度上是紧密相联系的事务挖掘出来,其主导思想是一种事务的出现必然导致或大部分另一种事务的出现,根据此紧密性关联关系,将关联规则分为紧密性、高紧密性和非紧密性的关联关系。并对事务项进行实验分析,实验数据表明,新方法能减少无效的,非紧密的项集。

关 键 词:数据挖掘  关联规则  紧密度
文章编号:1009-3044(2007)10-21048-03
修稿时间:2007年4月3日

One Association Argrithm Which Not Generate Candidate Item
LI Chong-zhou,YANG Jun-rui.One Association Argrithm Which Not Generate Candidate Item[J].Digital Community & Smart Home,2007,2(10):1048-1050.
Authors:LI Chong-zhou  YANG Jun-rui
Abstract:Association rule mining has been data important problem in data mining,a lot of useless data in Association rule mining,has analysed whose cause ,has led into rapid and intense degree probability ,the value restraining by this,the affair concentrating affair rapid and intense associations of both item or being rapid and intense to a great extent look at and appraise connection excavates out,appearing being one kind of affair leads to whose dominant ideas surely or most another one kind of affair's appears,relation being connected according to this rapid and intense,The regulation being connected is concerned mark for rapid and intense ,high rapid and intense and the correlation being not rapid and intense. And the item carries out the experiment analysis on affair ,the experiment data indicates,new method can cut down futility's and intenseless Item.
Keywords:Data Mining  Association Rule  Intense degree
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号