Mining patterns from fuzzy temporal data is an important data mining problem. One of these mining task is to find locally frequent sets, In most of the earlier works fuzziness was considered in the time attribute of the datasets .Although a couple of works have been done in dealing with such data, little has been done on the implementation side. In this article, we propose an efficient implemen...

Optimization of the exploitation operation is one of the most important issues facing the mining engineers. Since several technical and economic parameters depend on the cut-off grade, optimization of this parameter is of particular importance. The aim of this optimization is to maximize the net present value (NPV). Since the objective function of this problem is non-linear, three methods can b...

Clustering is an effective technique in data mining to generate groups that are the matter of interest. Among various clustering approaches, the family of k-means algorithms and min-cut algorithms gain most popularity due to their simplicity and efficacy. The classical k-means algorithm partitions a number of data points into several subsets by iteratively updating the clustering centers and th...

For an undirected graph without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of is even; (ii) that the number of the closed patterns is precisely double the number of maximal complete bipartite subgraphs of ; (iii) that for every maximal complete bipartite subgraph, there always exists a unique and distinct pair of closed patterns that matches the two vert...

We present a method for identifying errors in EHRs caused by copying and pasting text containing relative dates. Our method utilizes a sequence alignment method for recognizing instances of copy/paste, and regular expressions for relative dates. We furthermore present an analysis of our method on the MIMIC-II dataset. Introduction Electronic health records (EHR) are a powerful enabling technolo...

Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit problem determines a set of notional three-dimensional blocks containing ore and/or waste material to ...