期刊文献+

一种基于粗糙集聚类的数据约简算法 被引量:5

A Data Reduction Algorithm Using Clustering Based on Rough Set Theory
下载PDF
导出
摘要 针对企业资源优化问题,首先采用了聚类分析的方法对原始数据进行约简,并且去除可疑信息,从而使得数据具有一致性,然后应用粗糙集理论将数据进行定性化分析和约简。通过系统聚类和粗糙集两种方法进行数据约简,使数据得到横向和纵向两个方向上的约简。算法应用于企业资源配置优化处理,取得了良好的效益。 To the question of the optimization of the enterprise resources, the study presented in this paper reduces the original data with clustering algorithm firstly, and eliminates the suspicious information, which makes the data consistent. Then the data are made a qualitative analysis and reduced based on rough set theory. The data are reduced in both horizontal and vertical directions by using hierarchical clustering and rough set methods. The favorable economic profit can be obtained by using this algorithm in the process of the optimization of the enterprise resources configuration.
作者 杨涛 李龙澍
出处 《系统仿真学报》 CAS CSCD 2004年第10期2195-2197,2200,共4页 Journal of System Simulation
基金 国家自然科学基金项目(60273043)
关键词 聚类 粗糙集 可疑信息 数据约简 clustering rough set suspicious information data reduction
  • 相关文献

参考文献5

二级参考文献43

  • 1李龙澍,程慧霞.一种面向对象产生式系统的体系结构和规则模型[J].计算机研究与发展,1997,34(6):415-420. 被引量:9
  • 2苗夺谦.Rough Set理论及其在机器学习中的应用研究(博士学位论文)[M].北京:中国科学院自动化研究所,1997..
  • 3[1]Fasulo, D. An analysis of recent work on clustering algorithms. Technical Report, Department of Computer Science and Engineering, University of Washington, 1999. http://www.cs.washington.edu.
  • 4[2]Baraldi, A., Blonda, P. A survey of fuzzy clustering algorithms for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999,29:786~801.
  • 5[3]Keim, D.A., Hinneburg, A. Clustering techniques for large data sets - from the past to the future. Tutorial Notes for ACM SIGKDD 1999 International Conference on Knowledge Discovery and Data Mining. San Diego, CA, ACM, 1999. 141~181.
  • 6[4]McQueen, J. Some methods for classification and Analysis of Multivariate Observations. In: LeCam, L., Neyman, J., eds. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. 1967. 281~297.
  • 7[5]Zhang, T., Ramakrishnan, R., Livny, M. BIRCH: an efficient data clustering method for very large databases. In: Jagadish, H.V., Mumick, I.S., eds. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. Quebec: ACM Press, 1996. 103~114.
  • 8[6]Guha, S., Rastogi, R., Shim, K. CURE: an efficient clustering algorithm for large databases. In: Haas, L.M., Tiwary, A., eds. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 73~84.
  • 9[7]Beyer, K.S., Goldstein, J., Ramakrishnan, R., et al. When is 'nearest neighbor' meaningful? In: Beeri, C., Buneman, P., eds. Proceedings of the 7th International Conference on Data Theory, ICDT'99. LNCS1540, Jerusalem, Israel: Springer, 1999. 217~235.
  • 10[8]Ester, M., Kriegel, H.-P., Sander, J., et al. A density-based algorithm for discovering clusters in large spatial databases with noises. In: Simoudis, E., Han, J., Fayyad, U.M., eds. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96). AAAI Press, 1996. 226~231.

共引文献498

同被引文献47

引证文献5

二级引证文献37

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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