Discrimination among Winding Mechanical Defects in Transformer Using Noise Detection and Data Mining Boosting Method

Outlier detection is the process of detecting the data objects which are grossly different from or inconsistent with the remaining set of data. Some of the important applications in the field of data mining are fraud detection, customer behavior analysis, and intrusion detection. There are number of good research algorithms for detecting outliers if the entire data is available and algorithms can operate in more than single passes to achieve the required results. Among the existing methods, LOF (Local outlier Factor) a density based method is very efficient in detecting all forms of outliers. LOF algorithm can not be directly applied to the datastream as the large number of nearest neighbor searches, LOF computation and lrd (local reachability distances) can make it highly inefficient for datastream. In this paper we propose a cluster based partitioning algorithm which can divide the stream in safe region and candidate regions. In Second phase apply LOF algorithm over these partitions separately with some slight enhancement for LOF computation over candidate region to achieve accurate results for finding most outstanding outliers. Several experiments on different dataset confirm that our technique can find better outliers with low computational cost than the direct LOF or compared to the other enhancements proposed for LOF.

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.

Outlier detection is an important task in data mining with numerous applications, including credit card fraud detection, video surveillance, etc. A recent work on outlier detection has introduced a novel notion of local outlier in which the degree to which an object is outlying is dependent on the density of its local neighborhood, and each object can be assigned a Local Outlier Factor (LOF) which represents the likelihood of that object being an outlier. Although the concept of local outliers is a useful one, the computation of LOF values for every data objects requires a large number of κ-nearest neighbors searches and can be computationally expensive. Since most objects are usually not outliers, it is useful to provide users with the option of finding only n most outstanding local outliers, i.e., the top-n data objects which are most likely to be local outliers according to their LOFs. However, if the pruning is not done carefully, finding top-n outliers could result in the same amount of computation as finding LOF for all objects. In this paper, we propose a novel method to efficiently find the top-n local outliers in large databases. The concept of "micro-cluster" is introduced to compress the data. An efficient micro-cluster-based local outlier mining algorithm is designed based on this concept. As our algorithm can be adversely affected by the overlapping in the micro-clusters, we proposed a meaningful cut-plane solution for overlapping data. The formal analysis and experiments show that this method can achieve good performance in finding the most outstanding local outliers.

Mode changes in today's sophisticated industrial processes result in unanticipated shutdowns, which could reduce the lifespan of critical machinery and result in high maintenance costs. A technique that can identify the fault of equipment operating in various modes is needed to prevent this issue. In light of this, we suggest a novel fault detection technique that makes use of the k-nearest neighbor normalization-based weight local outlier factor (WLOF). The suggested approach carries out local normalization using neighbors to take into account potential mode changes in the normal data, and WLOF is used for fault detection. In contrast to statistical methods, such as principal component analysis (PCA) and independent component analysis (ICA), the local outlier factor (LOF) uses the density of neighbors. However, conventional LOF is greatly affected by the distance between its neighbors, performance may deteriorate when faulty data is adjacent to normal data. To improve the defect detection performance of LOF, the proposed method multiplies proportionally by the distance between each neighbor. A circulating fluidized bed boiler and a multimode numerical case were used to assess the effectiveness of the suggested method. The results of the experiments demonstrate that the suggested method performs better than conventional PCA, kernel PCA (KPCA), k-nearest neighbor (kNN), and LOF. In particular, compared to conventional techniques, the suggested method increased detection accuracy by 20%. Therefore, the proposed technique is applicable to a real process operating in multiple modes.

Abstract: The service dramatically affects the number of guests staying at the hotel. Bali is the most visited tourist area by foreign tourists. Therefore, improved service is crucial for determining the rating level of a hotel. This research aims to combine two data mining algorithms: clustering and classification. This research is expected to contribute to hospitality in improving the best services for tourists, especially in the City of Bali. Clustering algorithms are used to group the best number of hotels based on the four clusters selected from the k-means clustering algorithm. The classification algorithm using C4.5 determines the factors most dominant in determining the hotel rating level based on the gain ratio. The data used in this study results from observations on the website agoda.com in Bali of 51 data. The results of this study explained that cluster_0 is the highest-rated cluster, with a total number of 19 hotels found in claster_0. Data cluster0 is used for classification analysis using a decision tree, and the most dominant factor is the service factor, with an accuracy of 80%. Keywords: data mining; kmeans; decision tree; hotel; bali; Abstrak: Pelayanan sangat mempengaruhi jumlah pengunjung yang menginap dihotel. Bali merupakan daerah wisata paling banyak dikunjungi oleh wisatawan mancanegara. Oleh karena itu, peningkatan pelayanan sangat penting untuk penentuan level rating dari hotel. Tujuan dari penelitian ini untuk menggabungkan dua algoritma data mining yaitu clustering dan klasifikasi. Dengan penelitian ini diharapkan dapat memberikan kontribusi bagi perhotelan dalam meningkatkan pelayanan yang terbaik bagi wisatawan khususnya di Kota Bali. Algoritma Clustering digunakan untuk mengelompokkan dari jumlah hotel yang terbaik berdasarkan empat cluster yang dipilih dari algoritma clustering berupa k-means. Algoritma klasifikasi menggunakan C4.5 digunakan untuk mengetahui faktor apa yang paling dominan dalam menentukan level rating hotel berdasarkan gain ratio. Data yang digunakan dalam penelitian ini hasil observasi di website agoda.com di bali sebanyak 51 data. Hasil dari penelitian ini menjelaskan dataset cluster_0 merupakan cluster rating tertinggi dengan jumlah 19 hotel yang terdapat di cluster_0. Data cluster_0 digunakan untuk analisis klasifikasi menggunakan decesion tree, didapat faktor yang paling dominan adalah faktor layanan dengan nilai akurasi sebesar 80%. Kata kunci: data mining; kmeans; decision tree; hotel; bali;

Electronic payments is something that is currently in high demand by investors today, but transactions are often constrained due to various problems, especially from third parties. For this reason, cryptocurrency emerged, which is one of the solutions for conducting electronic payment transactions. Some types of cryptocurrency that are most in demand by investors are bitcoin, ethereum, and ripple. The fluctuation value of cryptocurrency is very difficult to predict so that investors often experience losses when making transactions. This study aims to predict cryptocurrency prices such as bitcoin, ethereum and ripple using data mining algorithms. The data mining algorithm used in this prediction process is K-NN, Neural Network, SVM, Linear Regression, Random Forest and Decision Tree. Data mining modeling is done by dividing the dataset into each type of commodity and then analyzed using each algorithm. The results of this study indicate that the accuracy value obtained from some data mining algorithms is good enough to predict cryptocurrency prices

The growth of cyber threats and network traffic has highlighted the need for effective methods for detecting anomalies. The purpose of the study was to develop a hybrid model for detecting anomalies in telecommunications networks with increased accuracy based on comparative analysis of uncontrolled algorithms. Four main algorithms were compared: Isolation Forest, Local Outlier Factor (LOF), One-Class Support Vector Machine (SVM), and Elliptic Envelope using simulated network traffic data. Analysis methods included data normalisation using Z-score and Min-Max Scaling to eliminate large-scale differences between traits. An ensemble of 100 decision trees was used to improve the accuracy of anomaly detection. As a result, it was found that Isolation Forest provided the highest accuracy of anomaly detection (F1-Score = 85.8%) and high processing speed (processing time per 10,000 records in 2.5 seconds), which is important for real-world conditions of telecommunications networks with large amounts of data. LOF showed high accuracy in detecting local anomalies, but with greater computational complexity. The one-class SVM algorithm detected global anomalies, but showed lower accuracy for local ones. Elliptic Envelope had limited performance due to the assumption of normal data distribution. Additionally, a comprehensive model was developed that combined the advantages of Isolation Forest, LOF, and Density-Based Spatial Clustering of applications with Noise, which allowed increasing the F1-Score to 88% and exceeding the results of individual models. The hybrid model showed adaptability to multimodal distributions and efficiency in detecting local anomalies. Practical significance lies in improving the accuracy and stability of network security systems and form the basis for adaptive real-time algorithms, which allowed cybersecurity and telecommunications specialists to more effectively monitor and protect networks from threats

In the field of data mining and machine learning, outlier detection is considered a significant procedure for many applications, such as fraud detection in bank transactions and decision support systems. Data streams are a major player in the big data era. Currently, data streams are generated from various sources with huge amounts of data. This has led to difficulty when using older algorithms, which are designed for static data. The Local Outlier Factor (LOF) is one of these algorithms. The most challenging issue of the LOF is that it needs to preserve the whole dataset in computer memory. A new LOF that can deal with a data stream in limited memory is needed. This paper is a case study of several benchmark datasets for outlier detection that aim to increase the efficiency of the accuracy of local outlier detection in data streams.

Industrial processes typically have multiple operating modes with complex data distribution and locality faults, which challenges the traditional multivariate statistical process monitoring methods. To address this problem, a double‐level local information‐based local outlier factor (LOF) method is proposed in this work for multimode complex process monitoring. First, to handle the multimodality, the local neighborhood standardization strategy is adopted to utilize the statistical information of local data structure. Second, the variable LOF method is proposed to determine reasonable boundary for complex data distribution and simultaneously reflect local variable behaviors. For better online monitoring, a weighting strategy is applied to emphasize the local variable information, and the Bayesian inference is employed to integrate the LOF value of each variable. To isolate the fault variables, a contribution plot is designed. Finally, a numerical example and the benchmark Tennessee Eastman process are used to demonstrate the effectiveness and superiority of the proposed method.

Shaft misalignment is one of the most common defects observed in rotating systems and has a substantial effect on dynamic behaviour, stability, and lifetime. Aim of this study is the binary identification of misalignment using five Machine Learning techniques: Logistic Regression, K-Nearest Neighbours, Support Vector Machines, Decision Tree and Random Forest. Nevertheless, the limited quantity of provided data points coupled with the substantial imbalance between the aligned and misaligned cases necessitated the implementation of oversampling and data augmentation methods. The utilization of SMOTE-LOF for oversampling the minority class, alongside the adoption of a Conditional Tabular GAN for the generation of synthetic data points yielded substantial outcomes. The application of SMOTE with the Local Outlier Factor on the original dataset achieves the oversampling of the minority class by using additional synthetic data, while the LOF factor overcome the noise problem. After the SMOTE-LOF implementation, new synthetic samples of the minority class are added to the dataset, eliminating the imbalance, however the ‘cleaned’ dataset’s small number of samples could lead to poor performance of the Machine Learning techniques. Hence, using a Generative Adversarial Network to expand the dataset is requisite, and since the experimental data is tabular, utilizing a Conditional Tabular Generative Adversarial Network is ideal for this case of study. The results of the current study elucidate the dataset that, among the augmented datasets, exhibits the best quality score when contrasted with the original dataset. Furthermore, the dataset that performs the best on the Machine Learning algorithms is determined.

Behavioral fingerprinting to detect ransomware in resource-constrained devices

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

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.

Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial problems such as customer relationship management (CRM), are useful in pointing out customers who are likely attritors and customers who are loyal, but they require human experts to postprocess the discovered knowledge manually. Most of the postprocessing techniques have been limited to producing visualization results and interestingness ranking, but they do not directly suggest actions that would lead to an increase in the objective function such as profit. In this paper, we present novel algorithms that suggest actions to change customers from an undesired status (such as attritors) to a desired one (such as loyal) while maximizing an objective function: the expected net profit. These algorithms can discover cost-effective actions to transform customers from undesirable classes to desirable ones. The approach we take integrates data mining and decision making tightly by formulating the decision making problems directly on top of the data mining results in a postprocessing step. To improve the effectiveness of the approach, we also present an ensemble of decision trees which is shown to be more robust when the training data changes. Empirical tests are conducted on both a realistic insurance application domain and UCI benchmark data