Parallel and Distributed Data Mining through Parallel Skeletons and Distributed Objects

Recent advances in computing, communications, digital storage technologies, and high-throughput data-acquisition technologies, make it possible to gather and store incredible volumes of data. It creates unprecedented opportunities for large-scale knowledge discovery from huge database. Data mining (DM) technology has emerged as a means of performing this discovery. There are countless researchers working on designing efficient data mining techniques, methods, and algorithms. Many data mining methods and algorithms have been developed and applied in a lot of application fields [1]. Unfortunately, most data mining researchers pay much attention to technique problems for developing data mining models and methods, while little to basic issues of data mining [2]. In this talk, some basic issues of data mining are addressed. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? What is the rule we should obey in a data mining process? Through analyzing existing data mining methods, and domain-driven (or user-driven) data mining models [3-5], we find that we should take a data mining process as a process of knowledge transformation. Based on this understanding of data mining, a conceptual data mining model of domain-oriented data-driven data mining (3DM) is proposed [2]. The relationship between traditional domain-driven (or user-driven) data mining models and our proposed 3DM model is also analyzed. Some domain-oriented data-driven data mining algorithms for mining such knowledge as default rule [6], decision tree [7], and concept lattice [8] from database are proposed. The experiment results for these algorithms are also shown to illustrate the efficiency and performance of the knowledge acquired by our 3DM data mining algorithms.

Big data analysis is essential for modern applications in areas such as healthcare, assistive technology, intelligent transportation, environment and climate monitoring. Traditional algorithms in data mining and machine learning do not scale well with data size. Mining and learning from big data need time and memory efficient techniques, albeit the cost of possible loss in accuracy. We have developed a data aggregation structure to summarize data with large number of instances and data generated from multiple data sources. Data are aggregated at multiple resolutions and resolution provides a trade-off between efficiency and accuracy. The structure is built once, updated incrementally, and serves as a common data input for multiple mining and learning algorithms. Data mining algorithms are modified to accept the aggregated data as input. Hierarchical data aggregation serves as a paradigm under which novel data representations and algorithms work together for analysis and mining of big data. To evaluate its performance, we have implemented a multi-resolution Naive Bayes Classifier on the data aggregation structure. Experimental results show that the proposed structure helps the classifier to reduce computation time to 25% on average and reduce the memory usage while preserving the accuracy of results.

As a result of the huge amounts of data available in any subject of research, data mining technologies confront considerable obstacles. Due to the large volume of data, most existing data mining methods are inapplicable to many real-world problems. Data mining methods become ineffective when the problem size becomes too large. Scalability is an issue that must be addressed in data mining algorithms in order to construct high-performance, efficient, and scalable data mining algorithms. A new scalability technique is proposed and applied to several data mining problems in this research. The proposed scaling methodology is developed using a cascade approach. The approach begins with the collection of a large data set from several sources, which is then preprocessed. Once the dataset has been preprocessed, decompose it into smaller data sets of equal size subsets. Then apply a data mining approach to each subset, with the identical data mining method stated for each subset. The findings of the data mining approach on all subsets are pooled and aggregated for the final output. The performance of the suggested algorithm is assessed using a number of criteria, including accuracy, precision, recall, F-score, and execution time. Social advertising and bank marketing are the two datasets on which the proposed method is tested. The suggested approach's performance is compared with non-scale data mining methods, and it is found that the scaling method outperformed non-scale data mining methods on all measures.

Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns. Existing SQL aggregations have limitations to prepare data sets because they return one column per aggregated group. In general, a significant manual effort is required to build data sets, where a horizontal layout is required. We propose simple, yet powerful, methods to generate SQL code to return aggregated columns in a horizontal tabular layout, returning a set of numbers instead of one number per row. This new class of functions is called horizontal aggregations. Horizontal aggregations build data sets with a horizontal denormalized layout (e.g. point-dimension, observation-variable, instance-feature), which is the standard layout required by most data mining algorithms. We propose three fundamental methods to evaluate horizontal aggregations: CASE: Exploiting the programming CASE construct; SPJ: Based on standard relational algebra operators (SPJ queries); PIVOT: Using the PIVOT operator, which is offered by some DBMSs. Experiments with large tables compare the proposed query evaluation methods. Our CASE method has similar speed to the PIVOT operator and it is much faster than the SPJ method. In general, the CASE and PIVOT methods exhibit linear scalability, where as the SPJ method does not. In a relational database, especially with normalized tables, a significant effort is required to prepare a summary data set that can be used as input for a data mining or statistical algorithm. Most algorithms require as input a data set with a horizontal layout, with several Records and one variable or dimension per column. That is the case with models like clustering, classification, regression and PCA; consult. Each research discipline uses different terminology to describe the data set. In data mining the common terms are point-dimension. Statistics literature generally uses observation-variable. Machine learning research uses instance-feature. This article introduces a new class of aggregate functions that can be used to build data sets in a horizontal layout (denormalized with aggregations), automating SQL query writing and extending SQL capabilities. We show evaluating horizontal aggregations is a challenging and interesting problem and we introduced alternative methods and optimizations for their efficient evaluation. II. MOTIVATION As mentioned above, building a suitable data set for data mining purposes is a time- consuming task. This task generally requires writing long SQL statements or customizing SQL Code if it is automatically generated by some tool. There are two main ingredients in such SQL code: joins and aggregations; we focus on the second one. The most widely- known aggregation is the sum of a column over groups of rows. Some other aggregations return the average, maximum, minimum or row count over groups of rows. There exist many aggregations functions and operators in SQL. Unfortunately, all these aggregations have limitations to build data sets for data mining purposes. The main reason is that, in general, data sets that are stored in a relational database (or a data warehouse) come

Education can be utilized as a tool to face many problems, overcome many hurdles in life. The knowledge obtained from education helps to enhance opportunities in one's employment development. To extract useful information from the knowledge obtained, Educational Data Mining is widely used. Educational data mining provides the process of applying different data mining tools and techniques to analyze and visualize the data of an institution (school) and can be used to discover a unique pattern of students' academic performance and behavior. The present work intends to enhance students' academic performance in secondary school using data mining techniques. Real data was collected using school reports and questionnaire method by the Portugal school which has been used in this paper. Naive Bayesian algorithm can be easily implemented to predict the students' academic performance and behavior. Classification of students into two classes, pass and fail, involves training phase and testing phase. In training phase, Naive Bayes classifier is built and in the testing phase, Naive Bayes classifier is used to make the prediction. The accuracy of the classifier is calculated using WEKA tool in which confusion matrix is generated. The accuracy of the classifier obtained is 87% which can be further improved by the selection of appropriate attributes. Developing the classification algorithms in this way helps to obtain a more efficient student performance predictor tool using other data mining algorithms and it also helps to improve the quality of education in an educational institution.

Recent developments in computing, communications, digital storage technologies, and high-throughput data-acquisition technologies, make it possible to gather and store incredible volumes of data. It creates unprecedented opportunities for knowledge discovery large-scale database. Data mining technology is a useful tool for this task. It is an emerging area of computational intelligence that offers new theories, techniques, and tools for processing large volumes of data, such as data analysis, decision making, etc. There are countless researchers working on designing efficient data mining techniques, methods, and algorithms. Unfortunately,most data mining researchers pay much attention to technique problems for developing data mining models and methods, while little to basic issues of data mining. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? What is the rule we would obey in a data mining process? What is the relationship between the prior knowledge of domain experts and the knowledgemind from data? In this paper, we will address these basic issues of data mining from the viewpoint of informatics [1]. Data is taken as a manmade format for encoding knowledge about the natural world. We take data mining as a process of knowledge transformation. A domain-oriented data-driven data mining (3DM) model based on a conceptual data mining model is proposed. Some data-driven data mining algorithms are also proposed to show the validity of this model, e.g., the data-driven default rule generation algorithm, data-driven decision tree pre-pruning algorithm and data-driven knowledge acquisition from concept lattice.

Medical datasets hold huge number of records about the patients, the doctors and the diseases. The extraction of useful information which will provide knowledge in decision making process for the diagnosis and treatment of the diseases are becoming increasingly determinant. Knowledge Discovery and data mining make use of Artificial Intelligence (AI) algorithms which are applied to discover hidden patterns and relations in complex datasets using intelligent agents. The existing data mining algorithms and techniques are designed to solve the individual problems, such as classification or clustering. Up till now, no unifying theory is developed.Among the different algorithms in data mining for prediction, classification, interpretation and visualization, ‘k-means clustering’, ‘Decision Trees (C4.5)’, ‘Neural Network (NNs)’ and ‘Data Visualization (2D or 3D scattered graphs)’ algorithms are frequently utilized in data mining tools. The choice of the algorithm depends on the intended use of extracted knowledge.In this paper, the mentioned algorithms are unified into a tool, called Unified Medical Data Miner (UMDM) that will enable prediction, classification, interpretation and visualization on a diabetes dataset.KeywordsMedicineClusteringClassification & PredictionVisualizationAgent Data miningUnified Medical Data Miner

A fuzzy logic based resource manager (RM) has been developed that automatically allocates electronic attack resources in real-time over many dissimilar platforms. Two different data mining algorithms have been developed to determine rules, strategies, and fuzzy decision tree structure. The first data mining algorithm uses a genetic algorithm as a data mining function and is called from an electronic game. The game allows a human expert to play against the resource manager in a simulated battlespace with each of the defending platforms being exclusively directed by the fuzzy resource manager and the attacking platforms being controlled by the human expert or operating autonomously under their own logic. This approach automates the data mining problem. The game automatically creates a database reflecting the domain expert's knowledge. It calls a data mining function, a genetic algorithm, for data mining of the database as required and allows easy evaluation of the information mined in the second step. The criterion for re- optimization is discussed as well as experimental results. Then a second data mining algorithm that uses a genetic program as a data mining function is introduced to automatically discover fuzzy decision tree structures. Finally, a fuzzy decision tree generated through this process is discussed.

This paper describes an approach to identify the state of a power system using Data Mining Algorithms. With the advent of Phasor Measurement Units (PMU), a huge amount of power system data is being stored day-to-day in the Phasor Data Collectors (PDCs). Knowledge discovery and machine learning techniques can make use of this data to extract valuable information and interesting patterns in these databases. In this paper, Symbolic Aggregate ApproXimation (SAX) is used to convert the time stamped phasor data from the PMUs into symbolic strings and Data Mining (DM) algorithms are used to predict the current state of a power system. Along with the state, the location and cause of disturbance is also identified in minimal time. The effectiveness of different DM algorithms for determining state of a power system is also shown using the measures of accuracy, precision and recall.

With the huge amount of information available online, the World Wide Web is a fertile area for data mining research. The data mining research is at the cross road of research from several research communities, such as database, information retrieval, and within AI, especially the sub-areas of machine learning and data integrity. Every E-commerce and social website in World Wide Web uses the Classification is one of the data mining problems receiving great attention recently in the database community. Neural network is not suitable for data mining directly, because how the classifications were made is not explicitly stated as symbolic rules that are suitable for verification or interpretation by humans. Different concise symbolic rules with high accuracy can be extracted from a neural network with the proposed approach. The neural network is first trained to achieve the required accuracy in data mining. In this paper we are going to combine neural network with the three different algorithms which are commonly used in data mining to improve the data mining result. These three algorithms are CHARM Algorithm, Top K Rules mining and CM SPAM Algorithm. The different datasets of online e-commerce website filpkart and Amazon are used to train the neural network and to use in data mining. The results of all three data mining algorithm with neural network techniques then tested on the available datasets and result are compared by computational complexity of the algorithm.

This paper conducts a methodological research on the academic performance of online learners. This paper applies classification models commonly used in data mining algorithms, such as random forests based on decision trees, support vector machines, neural networks, K nearest neighbor algorithms, etc., combined with data mining tools S software and statistical analysis tools, and analyzes the University of Finance and Economics Tools scores of online learners in the class of 2019. It studies the important factors that affect the academic performance of college students' online learners, and uses these factors to predict students' academic performance. Based on the distance calculation method in mathematics, the article separately studied the application of Euclidean distance correlation analysis algorithm and correlation coefficient correlation algorithm in curriculum relevance, and compared several correlation algorithms. Experimental research results show that in the era of big data, learners will accumulate a large amount of structured and unstructured data during online learning. We can explore the influencing factors of online learners' academic performance through data mining technology, and we can also use machine learning to automatically learn from the data to the academic performance prediction model.

Over the last decade data warehousing and data mining tools have evolved from research into a unique and popular applications, ranging from data warehousing and data mining for decision support to business intelligence and other kind of applications. The chapter presents and discusses data warehousing methodologies along with the main components of data mining tools and technologies and how they all could be integrated together for knowledge management in a broader sense. Knowledge management refers to the set of processes developed in an organization to create, extract, transfer, store and apply knowledge. The chapter also focuses on how data mining tools and technologies could be used in extracting knowledge from large databases or data warehouses. Knowledge management increases the ability of an organization to learn from its environment and to incorporate knowledge into the business processes by adapting to new tools and technologies. Knowledge management is also about the reusability of the knowledge that is being extracted and stored in the knowledge base. One way to improve the reusability is to use this knowledge base as front-ends to case-based reasoning (CBR) applications. The chapter further focuses on the reusability issues of knowledge management and presents an integrated framework for knowledge management by combining data mining (DM) tools and technologies with CBR methodologies. The purpose of the integrated framework is to discover, validate, retain, reuse and share knowledge in an organization with its internal users as well as its external users. The framework is independent of application domain and would be suitable for uses in areas, such as data mining and knowledge management in e-government.

Use of machine learning (ML) and data mining (DM) algorithms has surfaced more often in the recent years for disease risk prediction problems in the healthcare communities. Several traditional feature selection models are combined with the DM and ML algorithms to improve accuracy of the disease risk prediction. In this study, a new Bio-inspired Ensemble Feature Selection (BEFS) model is introduced which is applied with the DM and ML algorithms. In the BEFS model, the most relevant and highly contributing features in the prediction are determined with a bio-inspired algorithm i.e., genetic algorithm, and an ensemble algorithm i.e., random forest algorithm. These important features obtained from the proposed model are then combined in various combinations and applied with the DM and ML algorithms, here logistic regression (LR) and random forest (RF), and the results obtained are promising. The experiment is executed using the famous ML language R. To accomplish this objective, the Breast Cancer Wisconsin (Diagnostic) dataset of UCI (University of California, Irvine) ML repository is utilized. In the experimental outcomes, the highest accuracy attained with the BEFS model is 96.49%, the AUC (Area Under Curve) achieved is 96%, and the sensitivity is 98.11%. These results, which greatly improve the disease risk prediction, are higher than several other existing works, while utilizing only six most relevant features out of the thirty two features of the dataset.

The subfield of technologies within the discipline of computer science is known as "data mining" Moreover, statistics are put to use in order to identify trends within the database. Essentially, the primary goal of the data mining methods is to extract from the database any information that will be valuable in the future or that will be needed at some point in the future and transform it into a usable format. Understandable framework for future usage. There are several approaches to choose from, each of which may be helpful in carrying out data mining operations in an effective manner. There is some information accessible in this document concerning comparative studies or analyses of various data mining approaches and certain data mining algorithms. This information may be found in this publication. This means that reading this paper will assist us in gaining knowledge regarding data mining technologies, data mining algorithms, as well as some data of corporations that have upgraded or enhanced their profits by modifying their data mining technologies and have obtained impressive output as a result of doing so.

SummaryOne of the most important challenges of African countries is the effective use of information and communication technologies and its generalization in the different sectors (education, economic, political, and so on). This will have a great impact on different aspects of society and economic activities by making everyday procedures easier and more efficient. In this same context, we are interested in this article by the proposition of a decision support framework based on the use of data mining (DM) techniques. Using DM in e‐government is the process of translating data to appropriate knowledge which can be useful for decision‐making. We propose a framework whose goal is the generation of association rules (ARs) for better decision‐making. This framework includes two approaches: (1) the first approach applies different DM algorithms and (2) the second approach optimizes the first one by considering two different metaheuristics: the Genetic algorithm and the Cuckoo search algorithm. A new relevance measure called “Weighted Dominance” has been considered to evaluate the quality of the generated ARs. Extensive experiments have been conducted using different datasets. The results obtained demonstrated the effectiveness of combining DM and optimization algorithms compared to the first approach. Finally, a case study related to an Algerian mobile phone company has been presented illustrating the use of our framework in the decision‐making process.