Improved Instrument Approach Stability Analysis for Helicopters Using Data Fusion and Analytics

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.

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.

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

Data fusion and data mining are complementary processes that contribute abductive-inductive (learning and discovery) and deductive (detection) capabilities. Not to be confused with each other, the processes offer distinct and reciprocal capabilities that, once integrated, provide powerful tools for improving the automatic recognition of targets by complex, nonliteral signatures from multiple sources. ERIM International is developing and applying this integrated technology to improve the performance of traditional data fusion processes.

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

The objective of this work is to provide a better understanding of helicopter accidents (rates, trends, and covariates) and to identify areas that deserve careful attention for accident prevention. Several questions were here investigated, including: (1) whether there are differences in accident rates for helicopters with different number of main rotor blades? (2) whether different engine types are associated with different accident rates, controlling for number of blades? And (3) whether there are seasonality effects in helicopter accident rates? To this effect, Record Linkage of two Federal data sources, the FAA civil helicopter registration data and the NTSB accident data, enabled the investigation of these and other questions. First, the accident rates and trend analysis highlighted the safety challenges that continue to face helicopters (significantly worse track record than commercial airlines, passenger cars, and motorcycles). Second, it was found that helicopter accident rates vary by number of rotor blades. Third, one result upended traditional wisdom, which posited that reciprocating engines are associated with higher accident rates; in its stead, it was shown that helicopter accident rates vary with engine type and number of blades, and that turboshaft are associated with significantly higher accident rates than reciprocating engines for the 4-, 5-, and 6-bladed helicopters. Furthermore, it was shown that helicopter accident rates display seasonality effect. Statistical significance and possible confounders for these results were discussed. The issues here examined deserve careful attention from the helicopter community, and several topics were identified as important areas for future work. Any serious effort to improve helicopter safety will entail action on multiple safety levers, including design, operational, and policy/inspection-related ones. All of these actions should be evidence-based, and they will require better helicopter accident investigations and better flight data.

The voluminous amount of data stored in databases contains hidden knowledge which could be valuable to improve decision making process of any organization. As it is not humanely possible to analyze large databases, it has become essential to apply advanced data mining algorithms for extracting patterns (models) from data to support decision making. A number of data mining algorithms produce information of a statistical nature that allows the user to assess how accurate and reliable the discovered knowledge is? However, in many cases this is not enough for the users. Even if the discovered knowledge is highly accurate from a statistical point of view, it might not be interesting to the user. Therefore the process of knowledge discovery in databases (KDD) aims at discovering knowledge that is interesting and useful to the user. Most of the data mining algorithms so far have paid lot of attention to discovery of accurate and comprehensible knowledge. Though, the question of interestingness has been addressed time to time, it is being increasingly realized by data mining community that this subject needs a renewed focus. This paper is an attempt to review the measures of interestingness used in the data mining literature. The main contribution of the paper is to improve the understanding of interestingness measures for discovery of knowledge and identify the unresolved problems to set the directions for the future research in this area.

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.

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.

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 concentrates an efficient event detection approa ch exploiting data fusion technology for the heterogeneous wireless sensor networks. In this type of wireless sensor networks, each sensor is equipped with multiple sensing units. Particularly, in this paper, we study on the data fusion approach based on the type of complementary heterogeneous wireless sensor networks, and the fire disaster detection is utilized as an example of event det ection. The proposed event detection model is constructed of data fusion level and information fusion level. In the data fusion level , resource data are collected from the sensors which are both in the sensing field out of the sensing field. In the information fusion level , the event can be detected by computing the data fusion probabilities. For the fire disaster detection process, data collected from temperature sensors and humidity sensors are combined, and then all the measurements are supposed independent on normal random variables. Afterwards, the data fusion process is implemented utilizing genetic algorithm, by which the population is evolved through a predetermined number of consults. Therefore, for each generation of answers, a new set of artificial creatures can be calculated. Furthermore, the answers can be solved by fragments of the most suitable individuals. Finally, experiments are conducted on a series of simulations using the OMNeT++ tool. Compared with other methods, the proposed data fusion based event detection algorithm can effectively find the event through detecting the notify sta te and alert state, and performs better than other two methods both in the fusion quality and fusion efficiency.

This paper presents a hybrid approach that integrates a genetic algorithm (GA) and data mining to produce control signatures. The control signatures define the best parameter intervals leading to a desired outcome. This hybrid method integrates multiple rule sets generated by a data mining algorithm with the fitness function of a GA. The solutions of the GA represent intersections among rules providing tight parameter bounds. The integration of intuitive rules provides an explanation for each generated control setting and it provides insights into the decision making process. The ability to analyze parameter trends and the feasible solutions generated by the GA with respect to the outcomes is another benefit of the proposed hybrid method. The presented approach for deriving control signatures is applicable to various domains, such as energy, medical protocols, manufacturing, airline operations, customer service, and so on. Control signatures were developed and tested for control of a power plant boiler. These signatures discovered insightful relationships among parameters. The results and benefits of the proposed method for the power plant boiler are discussed in the paper.

Розглянуто основні датчики координатної інформації літака цивільної авіації, що застосовуються для вирішення задачі позиціонування у просторі, а саме супутникову та інерціальну системи; алгоритми зональної навігації у обчислювальній системі літаководіння, що функціонують за сигналами наземних далекомірних (DME) та кутомірних (VOR) радіомаяків. Проаналізовано математичні підходи до об’єднання даних на різних рівнях обробки, зокрема розглянуто поєднання координатної інформації за методом максимальної достовірності. Вперше представлено структурну схему поєднання координат літака, отриманих за результатами попарного та множинного принципів позиціонування на основі даних наземних радіомаяків. Досліджено використання ймовірнісного підходу для поєднання координатної інформації літака у випадку, коли розподіли похибок вимірювання мають Гаусівський вигляд.

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.

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.