期刊文献+

基于图像映射的关联规则数据挖掘方法 被引量:1

Data Mining Approach of Association Rules Based on Image Mapping
在线阅读 下载PDF
导出
摘要 针对大多数关联规则数据挖掘算法难以适应支持度或数据集的变化问题,提出一种基于图像映射的关联规则数据挖掘算法Pix-DM。该算法利用图像在操作系统中的显示及存储特点,结合数据挖掘理论,通过映射有效地将数据挖掘过程在线性空间中实现,提高了算法对支持度或数据集变化的适应能力。实验证明,Pix—DM算法是有效且可行的。 Most data mining algorithms of association rules can not adapt well to the changes of support and datasets. This paper proposes a novel algorithm based on image mapping, namely Pix-DM. By using the points of images displaying and storage on operating system, and combining the method of data mining, it carries out the process of data mining in a linear space and improves the flexibility of the support and datasets changes. The experiment on real datasets proves that Pix-DM is effective and feasible.
出处 《计算机工程》 CAS CSCD 北大核心 2008年第21期71-72,75,共3页 Computer Engineering
基金 国家"863"计划基金资助项目(2006AA04Z212)
关键词 数据挖掘 关联规则 图像 映射 data mining association rule image mapping
  • 相关文献

参考文献5

二级参考文献13

  • 1.[EB/OL].http://www. ics. uci. edu/~ mlearn/MLRepository. html,1996.
  • 2D. Burdick, M. Calimlim, J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In: D.Georgakopoulos, et al, eds. Proc. of 17th Int'l Conf. on Data Engineering. Heidelberg: IEEE Press, 2001. 443~452.
  • 3K. Gouda, M. Zaki. Efficiently mining maximal frequent itemsets. In: N. Cercone, T. Y. Lin, X. Wu, eds. Proc. of the 2001 IEEE Int'l Conf. on Data Mining. San Jose: IEEE Press,2001. 163~170.
  • 4R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large database. In: P. Buneman, S.Jajodia, eds. Proc. of 1993 ACM SIGMOD Conf. on Management of Data. Washington DC: ACM Press, 1993. 207~216.
  • 5R. Agrawal, R. Srikant. Fast algorithms for mining association rules. In: J. Bocca, M. Jarke, C. Zaniolo, eds. Proc. of the 20th Int'l Conf. on Very Large Databases (VLDB' 94) .Santiago: Morgan Kaufmann, 1994. 487~499.
  • 6J. Han, J. Pei, Y. Yin. Mining frequent patterns without candidate generation. In: M. Dunham, J. Naughton, W. Chen,eds. Proc. of 2000 ACM-SIGMOD Int'l Conf. on Management of Data (SIGMOD'00). Dallas, TX, New York: ACM Press,2000. 1~ 12.
  • 7N. Pasquier, Y. Bastide, R. Taouil, et al.. Discovering frequent colsed itemsets for association rules. In: C. Beeri, et al,eds. Proc. of 7th Int'l Conf. on Database Theory. Jerusalem:Springer-Verlag, 1999. 398~416.
  • 8J. Pei, J. Han, R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In: D Gunopulos, et al, eds.Proc. of the 2000 ACM SIGMOD Int' l Workshop on Data Mining and Knowledge Discovery. Dallas: ACM Press, 2000. 21~30.
  • 9M. Zaki, C. Hsiao. CHARM: An efficient algorithm for closed association rule mining. In: R. Grossman, et al., eds. Proc. of 2nd SIAM Int'l Conf. on Data Mining. Arlington:SIAM, 2002.12~28.
  • 10R. Bayardo. Efficiently mining long patterns from databases. In:L. Haas, A. Tiwary eds. Proc. of 1998 ACM SIGMOD Int'l Conf. on Management of Data (SIGMOD'98), New York: ACM Press, 1998. 85~93.

共引文献58

同被引文献4

  • 1Web Coverage Service(WCS) Implementation Standard[EB/OL]. [2008-3-19]. http://www.opengeospatial.org/legal/.
  • 2Wang Yunsong, Bollig E F, Benjamin J, et al. Web-IS(Integrated System): An Overall View[J]. Visual Geosciences, 2005, (10):27-42.
  • 3Sceppa D. Programming Microsoft ADO.Net 2.0 Core Reference[M].北京:清华大学出版社,2007-06.
  • 4梅彪,姜新文,吴恒.WS-BPEL业务流程与访问控制[J].计算机工程,2008,34(19):144-146. 被引量:3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部