期刊文献+

一种组合K近邻聚类在煤与瓦斯突出预测中的应用 被引量:6

Application of K nearest neighbor clustering based on the combination technology on coal and gas outburst forecasting
下载PDF
导出
摘要 针对煤与瓦斯突出影响因素复杂,即不仅具有随机性,又具有模糊性。为了保证预测的准确性,采用组合聚类策略。通过建立多个k近邻聚类器,可以产生多个簇集。来自不同簇集的子簇之间必然存在交集,最后利用子簇的加权连通图合并子簇。以平顶山八煤矿煤与瓦斯突出的相关因素指标为基础,对历年的煤与瓦斯突出的数据进行聚类分析,预测结果表明,该方法具有较好的预测效果,为煤与瓦斯突出预测提供了一种新的解决方案。 Coal and gas outburst is affected by many complicated factors,which are uncertain due to their randomness and fuzziness.This paper adopts a strategy of combination clustering in order to enhance the forecast accuracy.By constructing various K nearest clustering models,a collection of clusters can be obtained.The different sub-clusters from the cluster collection must contain intersections.Therefore,the sub-clusters can be merged by a weighted connection graph.A case study at No.8 Mine at Pingdingshan was conducted to apply the forecast method developed in this paper.The clustering analysis was based on the relevant factors with coal and gas outburst.The results show that the method generates a better forecast result,and can provide a new solution in forecasting coal and gas outburst.
作者 张宇 邵良杉
出处 《辽宁工程技术大学学报(自然科学版)》 CAS 北大核心 2010年第6期1039-1041,共3页 Journal of Liaoning Technical University (Natural Science)
基金 国家自然科学基金资助项目(70971059)
关键词 煤与瓦斯突出 K均值聚类 组合技术 K近邻聚类 预测 coal and gas outburst K-means clustering combination technology K nearest neighbor clustering forecast
  • 相关文献

参考文献7

二级参考文献11

  • 1王保和.船舶动力装置运行状态监测与故障诊断系统[J].仪表技术,1994(6):5-8. 被引量:3
  • 2Guo De-yong, Song Guang-tui.Research on cool structure indices to coal and gas outbursts in Pingdingshan Mine Area, China-Journal of Coal Science&Engineering ( China )2002 ( 1 ).
  • 3Han JW, Kamber M. Data Mining: Concepts and Techniques. 2nd ed., San Francisco: Morgan Kaufmann Publishers, 2001. 223-250.
  • 4Ester M, Kriegel HP, Sander J, Xu XW. A density-based algorithm for discovering clusters in large spatial database with noise. In: Simoudis E, Han J, Fayyad UM, eds. Proc. of the 2nd Int'l Conf. on Knowledge Discovery and Data Mining. Portland: AAAI Press, 1996. 226-231.
  • 5Zhang T, Ramakrishnan R, Linvy M. BIRCH: An efficient data clustering method for very large databases. In: Jagadish HV, Mumick IS, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Montreal: ACM Press, 1996. 103-114.
  • 6Guha S, RastogiR, Shim K. CURE: An efficient clustering algorithm for large databases. In: Haas LM, Tiwary A, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1998. 73-84.
  • 7Ankerst M, Breuning M, Kriegel HP, Sander J. OPTICS: Ordering points to identify the clustering structure. In: Delis A, Faloutsos C, Ghandeharizadeh S, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Philadelphia: ACM Press, 1999. 49-60.
  • 8Karypis G, Han EH, Kumar V. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. Computer, 1999,32(8): 68-75.
  • 9Hand DJ, Vinciotti V. Choosing k for two-class nearest neighbour classifiers with unbalanced classes. Pattern Recognition Letters, 2003,24(9): 1555-1562.
  • 10Stonebraker M, Frew J, Gardels K, Meredith J. The SEQUOIA 2000 storage benchmark. In: Buneman P, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Washington: ACM Press, 1993.2-11.

共引文献125

同被引文献246

引证文献6

二级引证文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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