Data mining is the technique to find hidden patterns from a very large volume of historical data. Association rule is a type of data mining that correlates one set of items or events with another set of items or events. Another data mining strategy is clustering technique. This technique is used to create partitions so that all members of each set are similar according to a specified set of metrics. Both the association rule mining and clustering helps in more effective individual and group decision making for optimal inventory control. Owing to the above facts, association rules are mined from each cluster to find frequent items and then loss profit is calculated for each frequent item. Initially, the clustering algorithm is used to partition the transactional database into different clusters. Apriori, a classic data mining algorithm is utilized for mining association rules from each cluster to find frequent items. Later the loss profit is calculated for each frequent item. The obtained loss profit is used to rank frequent items in each cluster. Thus, the ranking of frequent items in each cluster using the proposed approach greatly facilitate optimal inventory control. An example is illustrated to validate the results.

Timely identification of newly emerging trends is needed in business process. Data mining techniques like clustering, association rule mining, classification, etc. are very important for business support and decision making. This paper presents a method for redesigning the ordering policy by including cross-selling effect. Initially, association rules are mined on the transactional database and EOQ is estimated with revenue earned. Then, transactions are clustered to obtain homogeneous clusters and association rules are mined in each cluster to estimate EOQ with revenue earned for each cluster. Further, this paper compares ordering policy for imperfect quality items which is developed by applying rules derived from apriori algorithm viz. a) without clustering the transactions, and b) after clustering the transactions. A numerical example is illustrated to validate the results.

With ever-increasing demands for high surface finish and complex shape geometries on various difficult-to-machine materials, conventional metal removal methods are now being replaced by non-traditional machining (NTM) processes. These NTM processes use energy in its direct form to remove material from the workpiece surface. They are also cost effective for a wide range of micro- and nano-level applications. For effective utilization of different NTM processes, it is quite important to study their characteristics and material removal mechanisms in order to identify the most significant control parameters affecting the process responses. In this paper, a data mining approach using classification and regression tree algorithm is employed to identify the most important input parameters of three NTM processes, i.e. micro electro discharge milling process, wire electrical discharge machining process and laser beam machining process. The derived observations are also validated using the analysis of variance results.

Case-based reasoning (CBR) is the process of solving new cases by retrieving the most relevant ones from an existing knowledge-base. Since, irrelevant or redundant features not only remarkably increase memory requirements but also the time complexity of the case retrieval, reducing the number of dimensions is an issue worth considering. This paper uses rough set theory (RST) in order to reduce the number of dimensions in a CBR classifier with the aim of increasing accuracy and efficiency. CBR exploits a distance based co-occurrence of categorical data to measure similarity of cases. This distance is based on the proportional distribution of different categorical values of features. The weight used for a feature is the average of co-occurrence values of the features. The combination of RST and CBR has been applied to real categorical datasets of Wisconsin Breast Cancer, Lymphography, and Primary cancer. The 5-fold cross validation method is used to evaluate the performance of the proposed approach. The results show that this combined approach lowers computational costs and improves performance metrics including accuracy and interpretability compared to other approaches developed in the literature.

One of the primary concerns in most financial institutions to have an appropriate method for ranking customers. Bank customers are the primary sources of creating income and the success of banking industry depends on how to select good customers for allocation of loans. This paper uses Decision Tree, K-nearest neighbor (KNN), Support Vector Machine (SVM), Naive Bayes, and Logistic Regression for data categorization to estimate credit ranking of bank customers in one of major banks in Middle East. The results indicate that Logistic Regression was considered as the best method for ranking customers with the precision of 76.17% while Decision Tree was considered as the weakest technique with the precision of 73.30%.

Highway accident data analysis provides probability of occurrence of road accidents by associating different accident factors using data mining algorithms. Analysis can be improved by using advanced data mining algorithms that compute relationships with minimum processing time. As accident datasets are very heterogeneous in nature, it is difficult to identify the relationship between critical factors responsible for road accidents without data mining algorithms. In this study, K-modes for clustering and frequent pattern growth algorithms to extract relationships between critical accident factors have been used. The accomplished result concludes better relationships with better accuracy than earlier implemented data mining algorithms and has found meaningful hidden situations that would be beneficial for future work in decreasing the number of highway accidents.

Nowadays credit scoring is an important issue for financial and monetary organizations that has substantial impact on reduction of customer attraction risks. Identification of high risk customer can reduce finished cost. An accurate classification of customer and low type 1 and type 2 errors have been investigated in many studies. The primary objective of this paper is to develop a new method, which chooses the best neural network architecture based on one column hidden layer MLP, multiple columns hidden layers MLP, RBFN and decision trees and ensembling them with voting methods. The proposed method of this paper is run on an Australian credit data and a private bank in Iran called Export Development Bank of Iran and the results are used for making solution in low customer attraction risks.

This paper deals with data mining applications for the supply chain inventory management. ABC characterization is typically utilized for stock items arrangement on the grounds that the quantity of stock items is large to the point that it is not computationally practical to set stock and admin-istration control rules for every individual item. Moreover, in ABC classification, the inter-relationship between items is not considered. But practically, the sale of one item could influence the sale of other items (cross selling effect). Consequently, within each cluster, the inventories should be classified. In this paper, a modified approach is proposed considering both cross-selling effect and clusters to rank stock items. A numerical case is utilized to clarify the new ap-proach. It is represented that by utilizing this modified approach; the ranking of items may get influenced bringing about higher profits.