• Article
  • | |
  • Metrics
  • |
  • Reference [9]
  • |
  • Related [20]
  • |
  • Cited by [2]
  • | |
  • Comments
    Abstract:

    Optimized association rules are permitted to contain uninstantiated attributes.The optimization procedure is to determine the instantiations such that some measures of the roles are maximized.This paper tries to maximize interest to find more interesting rules.On the other hand,the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence.A naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute.Unfortunately,that results in a poor performance.A heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance.The experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes.The experiments with real data set show the approximate linear scalability and good accuracy of the algorithm.

    Reference
    [1]Agarwal R,Imielinski T,Swami A.Mining association rules between sets of items in large databases.In:Peter B,Sushil J,eds.Proc.of the '93 ACM SIGMOD Int'l Conf.on Management of Data.Washington:ACM Press,1993.207-216.
    [2]Fukuda T,Morimoto Y,Morishita S,Tokuyama T.Mining optimized association rules for numeric attributes.In:Egenhofer Max J,ed.Proc.of the 15th ACM SIGACTSIGMOD-SIGART Symp.on Principles of Database Systems.Montreal:ACM Press,1996.182-191.
    [3]Fukuda T,Morimoto Y,Morishita S,Tokuyama T.Data mining using two-dimensional optimized association rules:Scheme,algorithms,and visualization.In:Jagadish HV,Mumick IS,eds.Proc.of the ACMSIGMOD Conf.On Management of Data.Montreal:ACM Press,1996.13-23.
    [4]Rastogi R,Shim K.Mining optimized support rules for numeric attributes.In:Dayal U,Ramamritham K,Vijayaraman TM,eds.Proc.of the 15th Int'l Conf.on Data Engineering.Sydney:IEEE Computer Society Press,1999.126-135.
    [5]Rastogi R,Shim K.Mining optimized association rules with categorical and numeric attributes.IEEE Trans.on Knowledge and Data Engineering,2002,14(1):29-50.
    [6]Rastogi SBR,Shim K.Mining optimized gain rules for numeric attributes.IEEE Trans.on Knowledge and Data Engineering,2003,15(2):324-338.
    [7]Elble J,Heeren C,Pitt L.Optimized disjunctive association rules via sampling.In:Wu XD,Alex T,eds.Proc.of the 3rd IEEE Int'l Conf.on Data Mining.Melbourne:IEEE Computer Society Press,2003.43-50.
    [8]Brin S,Motwani R,Silverstein C.Beyond market baskets:Generalizing association rules to correlations.In:Joan P,ed.Proc.of the ACM SIGMOD Int'l Conf.on Management of Data.Tucson:ACM Press,1997.265-276.
    [9]Ruggles S,Sobek M,Alexander T,Fitch CA,Goeken R,Hall PK,King M,Ronnander C.Integrated public use microdata series:Version 3.0[Machine-readable database].Minneapolis:Minnesota Population Center[producer and distributor],2004.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

贺志,田盛丰,黄厚宽.一种挖掘数值属性的二维优化关联规则方法.软件学报,2007,18(10):2528-2537

Copy
Share
Article Metrics
  • Abstract:4225
  • PDF: 5226
  • HTML: 0
  • Cited by: 0
History
  • Received:July 24,2005
  • Revised:June 06,2006
You are the first2034280Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063