期刊文献+

双聚类的关联规则挖掘方法 被引量:4

Data Mining Method of Association Rule for Bi-cluster
下载PDF
导出
摘要 为了使所有关联规则算法都可用于双聚类挖掘,将双聚类问题转化为关联规则的频繁集挖掘问题.在为双聚类挖掘提供大量算法的同时,不但能获得双聚类,而且还能得到额外的双聚类关联信息.基因表达数据的实验结果证明了其有效性. In order to make all the association rule algorithms be used for bi-clustering,the bi-cluster problem has been translated into the problem of finding frequent sets in the association rule.With the advent of many algorithms for bi-clustering,the author s technique not only can obtain the bi-clusters,but also can get extra information associated with the bi-cluster.Experimental results on gene expression data show the effectiveness of the strategy.
出处 《北京工业大学学报》 EI CAS CSCD 北大核心 2009年第4期561-565,共5页 Journal of Beijing University of Technology
基金 国家自然科学基金资助项目(10631070 10601064).
关键词 双聚类 关联规则 频繁集 基因表达数据 bi-cluster association rule frequent itemset gene expression data
  • 相关文献

参考文献2

  • 1Weiyang Lin,Sergio A. Alvarez,Carolina Ruiz. Efficient Adaptive-Support Association Rule Mining for Recommender Systems[J] 2002,Data Mining and Knowledge Discovery(1):83~105
  • 2Mohammed J. Zaki,Srinivasan Parthasarathy,Mitsunori Ogihara,Wei Li. Parallel Algorithms for Discovery of Association Rules[J] 1997,Data Mining and Knowledge Discovery(4):343~373

同被引文献34

  • 1宋伟,董云卫.一种智能家庭嵌入式系统的设计与实现[J].计算机应用研究,2009,26(3):974-976. 被引量:2
  • 2黄晓斌.基于协同过滤的数字图书馆推荐系统研究[J].大学图书馆学报,2006,24(1):53-57. 被引量:33
  • 3LIU Jian-ping, LI Jing, BAI Jian, et al. A heuristic algorithm of spaeeborn TT&C resources scheduling [C ]// 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems. Xiamen: IEEE Press, 2010: 180-182.
  • 4BAI Jian, FENG Zu-ren, LI Jing, et al. An algorithm for TT&C resources scheduling based on modified CNP[ C ]// 2010 International Conference on Computer Application and System Modeling. Taiyuan: IEEE Press, 2010: 349- 353.
  • 5TANG H K, RAMANATHAN P, COMPTON K. Combining hard periodic and soft aperiodic real-time task scheduling on heterogeneous compute resources [ C ]//2011 International Conference on Parallel Processing. Taipei: IEEE Press, 2011: 753-762.
  • 6MANGALAMPALLI A, PUDI V. Fuzzy clustering driven efficient automated pre-processing for fuzzy association rule mining [ C ]//2010 IEEE International Conference on Fuzzy Systems. Barcelona: IEEE Press, 2010: 1-8.
  • 7CHATZIS S, VARVARIGOU T. Factor analysis latent subspace modeling and robust fuzzy clustering using t- distributions[ J]. IEEE Transactions on Fuzzy Systems, 2009, 17(3) : 505-517.
  • 8杜静,敖富江,杨学军,杨灿群.基于模糊聚类分析的构件并行技术研究[J].计算机学报,2007,30(11):1939-1946. 被引量:7
  • 9Balabanovic M, Shoham Y. Fab: Content - based, CollaborativeRecommendation [J]. Ccanmunications of the ACM, 2)07,40 (3):6672.
  • 10Rucker J, Polance M J. Siteseer: Personalized Navigation for the Web[j] . Communications of the ACM, 1997,40 (3): 7375.

引证文献4

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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