2 resultados para Mining operations

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

60.00% 60.00%

Publicador:

Resumo:

Mining operations around the world make extensive use of blasthole sampling for short-term planning, which has two undisputed advantages: (1) blastholes are closely spaced providing relatively high sampling density per ton, and (2) there is no additional cost since the blastholes must be drilled anyway. However, blasthole sampling usually presents poor sampling precision, and the inconstant sampling bias caused by particle size and density segregation is an even more serious problem, generally precluding representativeness. One of the main causes of this bias is a highly varying loss of fines, which can lead to both under- and over-estimation of grade depending on the ore type and the gangue. This study validates a new, modified sectorial sampler, designed to reduce the loss of fines and thereby increase sampling accuracy for narrow-diameter blasthole sampling. First results show a significantly improved estimation of gold grade as well as the minimization of the loss of fines.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Abstract Background Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.