Javascript must be enabled to continue!
Mining method selection based on hierarchical clustering and correspondence analysis
View through CrossRef
Selecting an optimal mining method is a complex and critical decision in underground mining, influ-enced by multiple geological, technical, and economic parameters. This study introduces a novel framework that combines Hierarchical Clustering (HC) and Correspondence Analysis (CA) to en-hance the selection process by evaluating the consistency and similarity among outcomes from both first-pass methods (UBC and Nicholas) and several multi-criteria decision-making (MCDM) tech-niques (including AHP, EDAS, PROMETHEE II, AHP-PROMETHEE, TOPSIS, and VIKOR). The proposed HC-CA approach identifies consistent conflicts among the considered mining methods and quantifies the agreement among the initial assumptions of the adopted selection procedures. A case study of a Pb-Zn deposit demonstrates that the framework can effectively detect consistent and co-occurring (i.e. conflicting) solutions, such as Cut-and-Fill Stoping, Shrinkage Stoping, and Sublevel Stoping. The results show that the adopted design criteria align more closely with the UBC selection method, compared to the Nicholas selection procedure for the considered deposit. Additionally, ap-plying the HC-CA approach to the input matrices prior to applying the MCDM methods can yield different results, compared to subjecting the MCDM output scores to the proposed framework. This integrative approach extends traditional selection procedures and links them with commonly used MCDM methodologies and unsupervised machine learning methods by enabling flexible strategy development, with the inclusion of considering mixed-mining-method scenarios tailored to the depos-it. Additionally, the approach offers improved decision support in early project stages by visualizing affinities among different assumptions and hence potentially mitigating biases during the following design stage.
Politechnika Wroclawska Oficyna Wydawnicza
Title: Mining method selection based on hierarchical clustering and correspondence analysis
Description:
Selecting an optimal mining method is a complex and critical decision in underground mining, influ-enced by multiple geological, technical, and economic parameters.
This study introduces a novel framework that combines Hierarchical Clustering (HC) and Correspondence Analysis (CA) to en-hance the selection process by evaluating the consistency and similarity among outcomes from both first-pass methods (UBC and Nicholas) and several multi-criteria decision-making (MCDM) tech-niques (including AHP, EDAS, PROMETHEE II, AHP-PROMETHEE, TOPSIS, and VIKOR).
The proposed HC-CA approach identifies consistent conflicts among the considered mining methods and quantifies the agreement among the initial assumptions of the adopted selection procedures.
A case study of a Pb-Zn deposit demonstrates that the framework can effectively detect consistent and co-occurring (i.
e.
conflicting) solutions, such as Cut-and-Fill Stoping, Shrinkage Stoping, and Sublevel Stoping.
The results show that the adopted design criteria align more closely with the UBC selection method, compared to the Nicholas selection procedure for the considered deposit.
Additionally, ap-plying the HC-CA approach to the input matrices prior to applying the MCDM methods can yield different results, compared to subjecting the MCDM output scores to the proposed framework.
This integrative approach extends traditional selection procedures and links them with commonly used MCDM methodologies and unsupervised machine learning methods by enabling flexible strategy development, with the inclusion of considering mixed-mining-method scenarios tailored to the depos-it.
Additionally, the approach offers improved decision support in early project stages by visualizing affinities among different assumptions and hence potentially mitigating biases during the following design stage.
Related Results
Clustering Analysis of Data with High Dimensionality
Clustering Analysis of Data with High Dimensionality
Clustering analysis has been widely applied in diverse fields such as data mining, access structures, knowledge discovery, software engineering, organization of information systems...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
Clustering is the process of arranging comparable data elements into groups. One of the most frequent data mining analytical techniques is clustering analysis; the clustering algor...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the nonālinear manifold. Recently, linear discriminant analysis (LDA) based vario...
Optimisation of potash mining technology for cell and pillar mining method
Optimisation of potash mining technology for cell and pillar mining method
The diverse demand for inorganic fertilizers has predetermined the intensification of potash mining, which is a raw material for their production. In this regard, it has become nec...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
<p>Clustering is an important technique for data analysis and knowledge discovery. In the context of big data, the density-based clustering algorithm faces three challenging ...

