An Efficient Approach of Multi-Relational Data Mining and Statistical Technique

Relational databases are the most popular repository for structured data, and are thus one of the richest sources of knowledge in the world. In a relational database, multiple relations are linked together via entity-relationship links. Unfortunately, most existing data mining approaches can only handle data stored in single tables, and cannot be applied to relational databases. Therefore, it is an urgent task to design data mining approaches that can discover knowledge from multi-relational data. In this thesis we study three most important data mining tasks in multi-relational environments: classification, clustering, and duplicate detection. Since information is widely spread across multiple relations, the most crucial and common challenge in multi-relational data mining is how to utilize the relational information linked with each object. We rely on two types of information—neighbor tuples and linkages between objects—to analyze the properties of objects and relationships among them. Because of the complexity of multi-relational data, efficiency and scalability are two major concerns in multi-relational data mining. In this thesis we propose scalable and accurate approaches for each data mining task studied. In order to achieve high efficiency and scalability, the approaches utilize novel techniques for virtually joining different relations, single-scan algorithms, and multi-resolutional data structures to dramatically reduce computational costs. Our experiments show that our approaches are highly efficient and scalable, and also achieve high accuracies in multi-relational data mining.

The explosion of very large databases has created extraordinary opportunities for monitoring, analyzing and predicting global economical, geographical, demographic, medical, political, and other processes in the world. Statistical analysis and data mining techniques have emerged for these purposes. Data mining is the process of discovering previously unknown but potentially useful patterns, rules, or associations from huge quantity of data. Data mining can be performed on different data repositories such as relational databases, data warehouses, transactional databases, sequence databases, spatial databases, spatio-temporal databases, and text databases, etc. Typically, data mining functionalities can be classified into two categories: descriptive and predictive. Descriptive mining tasks aim at characterizing the general properties of the data in the databases, while predictive mining tasks perform inherence on the current data in order to make prediction in future.KeywordsRoot Mean Square ErrorData MiningAssociation RuleIntrusion DetectionAnomaly DetectionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Inductive Logic Programming (ILP) is used in relational data mining to discover rules in first order logic, given data in multiple relations. This form of data mining has to be distinguished from market basket analysis where the data comes from a single relational table. Although ILP addresses the problem of dealing with data from multiple relational tables, the fact remains that the efficiency of inferring rules in first order logic is significantly less than that of many-sorted logic. Further, many sorted logic is a closer reflection of the real world of objects that belong to sorts, in the presence of a sort hierarchy. We propose a new approach to ILP using many-sorted logic that is more computationally efficient than the approach based on unsorted first order logic.

Multi-relational data mining (MRDM) is to enumerate frequently appeared patterns in data, the patterns which are appeared not only in a relational table but over a collection of tables. Although a database usually consists of many relational tables, most of data mining approaches treat patterns only on a table. An approach based on ILP (inductive logic programming) is a promising approach and it treats patterns on many tables. Pattern miners based on the ILP approach produce expressive patterns and are wide-applicative but computationally expensive. MAPIX[2] has an advantage that it constructs patterns by combining atomic properties extracted from sampled examples. By restricting patterns into combinations of the atomic properties it gained efficiency compared with other algorithms. In order to scale MAPIX to treat large dataset on standard relational database systems, this paper studies implementation issues.

This study aimed to identify patients with the highest risk of periodontal disease (PD), and to provide recommendations for the effective use and application of data mining (DM) techniques when establishing evidence-based dental-care policies for vulnerable groups at a high risk of PD. This study used the SEMMA (Sample, Explore, Modify, Model, and Assess) methodology to construct DM models based on data acquired from the fifth and sixth Korea National Health and Nutrition Examination Surveys (2000-2015). We analyzed the sociodemographic and comorbidity variables that influence PD by applying the popular DM techniques of decision-tree, neural-network, and regression models, and also attempted to improve the predictive power and reliability by comparing the results obtained by these three models. Our comparisons of the three DM algorithms confirmed that the average squared error, misclassification rate, receiver operating characteristic index, Gini coefficient, and Kolmogorov-Smirnov test results were the most appropriate for the decision-tree model. The analysis of the decision-tree model revealed that age and smoking status exert major effects on the risk of PD, and that stress and education level exert effects in rural areas, whereas education level, sex, hyperlipidemia, and alcohol intake exert effects in urban areas. We demonstrated that the decision-tree model is an effective DM technique for identifying the complex risk factors for PD. These results are expected to be helpful in improving the equality and efficacy of dental-care policies for vulnerable groups at a high risk of PD.

The apparel industry houses a huge amount and variety of data. At every step of the supply chain, data is collected and stored by each supply chain actor. This data, when used intelligently, can help with solving a good deal of problems for the industry. In this regard, this article is devoted to the application of data mining on the industry’s product data, i.e., data related to a garment, such as fabric, trim, print, shape, and form. The purpose of this article is to use data mining and symmetry-based learning techniques on product data to create a classification model that consists of two subsystems: (1) for predicting the garment category and (2) for predicting the garment sub-category. Classification techniques, such as Decision Trees, Naïve Bayes, Random Forest, and Bayesian Forest were applied to the ‘Deep Fashion’ open-source database. The data contain three garment categories, 50 garment sub-categories, and 1000 garment attributes. The two subsystems were first trained individually and then integrated using soft classification. It was observed that the performance of the random forest classifier was comparatively better, with an accuracy of 86%, 73%, 82%, and 90%, respectively, for the garment category, and sub-categories of upper body garment, lower body garment, and whole-body garment.

With the requirement to find methods to analysis the rapidly increasing data, as a branch of computer science, data mining technique has been widely apply in different domain .One of the most enticing application areas of data mining in these emerging technologies is in finance. To complete the financial tasks, data mining technique is used refer to Stock market forecasting, Bankruptcy Prediction, Credit Risk Estimation, Corporate Performance Prediction and Management Fraud. This paper focuses on new data mining applications in finance. The fast development of Compute technology (such as Cloud Computing) and database together gives data mining a new challenge and chance in data mining of finance. How to apply the new computer and database technique to the data mining, and integrate the previous framework and the new technology together to build a more efficiency and safer framework is a long way to go in the future . Meanwhile, after accumulate enough empirical regularity and experiences, deep field-specific theories will be set up. This means, in the future, it will have more standardized and accurate model and method to apply in different domain of finance by generating more empirical regularities and combining them with domain knowledge.

The online version contains supplementary material available at 10.1007/s40200-021-00884-2.

The data mining technique is used to transform raw data into useful information, which is carried out by recognizing the hidden patterns in the data. It is used in various sectors and fields such as education, marketing, fraud detection, manufacturing and health care. Educational Data Mining (EDM) is the Use of these techniques of data mining for data extraction from educational environment. Data mining in educational sector has widespread applications. Educational sector produces huge amount of student data which if analysed can be used for various purposes such as predicting the needs of students and evaluating their progress, also helping the institutions. We intend to compare all the techniques and algorithms used in various applications, thus assessing their efficiency.

Increasing the products service life and reducing the number of service visits are becoming more and more top priorities for Original Equipment Manufacturer companies (OEM’s). Condition-based maintenance is often proposed as a solution to reach this goal. However, this latter, is often hampered by the lack of the right information that gives a good indication of the health of the equipment. Furthermore, the processing power needed to compute this information is often not afforded by machine’s processor. In this paper, a remote platform which connects the OEM’s to the customer’s premises is described, allowing thus a local computation of available information. Two approaches are then combined to process the optimal maintenance time. First, data mining techniques and reliability estimation are applied to historical databases of machines running in the field in order to extract the relevant features together with their associated thresholds. Second, prediction algorithm is applied to the selected features in order to estimate the optimal time to preventively perform a maintenance action. The proposed method has been applied to a database of more than 2000 copy machines running in the field and proved to identify easily the relevant features to be forecasted and to offer an accurate prediction of the maintenance action.

Attribute-value based representations, standard in today's data mining systems, have a limited expressiveness. Inductive Logic Programming provides an interesting alternative, particularly for learning from structured examples whose parts, each with its own attributes, are related to each other by means of first-order predicates. Several subsets of first-order logic (FOL) with different expressive power have been proposed in Inductive Logic Programming (ILP). The challenge lies in the fact that the more expressive the subset of FOL the learner works with, the more critical the dimensionality of the learning task. The Datalog language is expressive enough to represent realistic learning problems when data is given directly in a relational database, making it a suitable tool for data mining. Consequently, it is important to elaborate techniques that will dynamically decrease the dimensionality of learning tasks expressed in Datalog, just as Feature Subset Selection (FSS) techniques do it in attribute-value learning. The idea of re-using these techniques in ILP runs immediately into a problem as ILP examples have variable size and do not share the same set of literals. We propose here the first paradigm that brings Feature Subset Selection to the level of ILP, in languages at least as expressive as Datalog. The main idea is to first perform a change of representation, which approximates the original relational problem by a multi-instance problem. The representation obtained as the result is suitable for FSS techniques which we adapted from attribute-value learning by taking into account some of the characteristics of the data due to the change of representation. We present the simple FSS proposed for the task, the requisite change of representation, and the entire method combining those two algorithms. The method acts as a filter, preprocessing the relational data, prior to the model building, which outputs relational examples with empirically relevant literals. We discuss experiments in which the method was successfully applied to two real-world domains.

Metabolic syndrome (MS) is a condition associated with metabolic abnormalities that are characterized by central obesity (e.g. waist circumference or body mass index), hypertension (e.g. systolic or diastolic blood pressure), hyperglycemia (e.g. fasting plasma glucose) and dyslipidemia (e.g. triglyceride and high-density lipoprotein cholesterol). It is also associated with the development of diabetes mellitus (DM) type 2 and cardiovascular disease (CVD). Therefore, the rapid identification of MS is required to prevent the occurrence of such diseases. Herein, we review the utilization of data mining approaches for MS identification. Furthermore, the concept of quantitative population-health relationship (QPHR) is also presented, which can be defined as the elucidation/understanding of the relationship that exists between health parameters and health status. The QPHR modeling uses data mining techniques such as artificial neural network (ANN), support vector machine (SVM), principal component analysis (PCA), decision tree (DT), random forest (RF) and association analysis (AA) for modeling and construction of predictive models for MS characterization. The DT method has been found to outperform other data mining techniques in the identification of MS status. Moreover, the AA technique has proved useful in the discovery of in-depth as well as frequently occurring health parameters that can be used for revealing the rules of MS development. This review presents the potential benefits on the applications of data mining as a rapid identification tool for classifying MS.

The trends of data mining on healthcare data for improving medical services have increased because of the electronic healthcare record(EHR) system, which collects a massive amount of data on a daily basis. In the current scenario, hospital maintains its EHR system and stores the detailed information of patients. Data mining for healthcare improvement requires the data from all the EHR systems located at a different location to be stored at the central data mining server. Collection of healthcare data at some untrusted central data mining server raises privacy threats. Healthcare data contains patients’ private information and sharing this information for data mining creates privacy issues. Most of the previous research either focused on k-anonymity technique which causes information loss and decreases data mining accuracy or privacy preserving data mining which is focused on only specific data mining technique. We adopt source anonymous technique as privacy preserving scheme and present a novel scheme for healthcare data collection and mining in this paper. Our scheme collects data from all EHR systems without any information loss and stores at a single central data mining server, also ensuring privacy is preserved. Central data mining server helps to analyze the collected data with different data mining techniques (Association rule mining, Classification, Clustering, etc.) without the involvement of EHR systems. Our scheme is collusion resilient against central data mining server and EHR systems. Theoretical and experimental analysis show the efficiency of our scheme in terms of computation and communication cost. The experimental results using Heart disease dataset show the advantage to EHR systems using the proposed approach in terms of disease prediction accuracy.

Energy supply is characterized by its diversity, including traditional energy, such as fossil fuels, nuclear power, as well as renewable energy, such as solar, hydroelectric, geothermal, biomass, and wind energy. It involves a complex network system composed of energy generation, energy transformation, energy transportation, and energy consumption. The network does provide the great flexibility for energy transformation and transportation; meanwhile, it presents a complex task for conducting agile energy dispatching when extreme events have caused local energy shortages that need to be restored timely. One of the useful methodologies to solve such a problem is data mining and analysis. Their main objective is to take advantage of inherent tolerance of the imprecision and uncertainty to obtain tractability, robustness, and low solution-cost. The applications and developments of data mining and analysis have amazingly evolved in the last two decades. Many of these applications can be found in the field of renewable energy and energy efficiency where data mining and analysis techniques are showing a great potential to solve the problems that arise in this area. In this chapter, data mining and analysis techniques are briefly introduced. Then the implementation procedures are presented to demonstrate the application of curve fitting for renewable energy network design and optimization, which has the capability to handle the restoration during extreme and emergency situations with uncertain parameters.

Data mining techniques provide people with new power to research and manipulate the existing large volume of data. A data mining process discovers interesting information from the hidden data that can either be used for future prediction and/or intelligently summarising the details of the data. There are many achievements of applying data mining techniques to various areas such as marketing, medical, and financial, although few of them can be currently seen in software engineering domain. In this paper, a proposed data mining application in software engineering domain is explained and experimented. The empirical results demonstrate the capability of data mining techniques in software engineering domain and the potential benefits in applying data mining to this area.