Prediction of Status Patterns of Wind Turbines: A Data-Mining Approach

2011 ◽  
Vol 133 (1) ◽  
Author(s):  
Andrew Kusiak ◽  
Anoop Verma
Keyword(s):  
Data Mining ◽  
Wind Turbines ◽  
Association Rule ◽  
Performance Monitoring ◽  
Prediction Models ◽  
Rule Mining ◽  
Data Mining Algorithms ◽  
Data Mining Approach ◽  
The Status ◽  
Mining Algorithms

This paper presents the application of data-mining techniques for identification and prediction of status patterns in wind turbines. Early prediction of status patterns benefits turbine maintenance by indicating the deterioration of components. An association rule mining algorithm is used to identify frequent status patterns of turbine components and systems that are in turn predicted using historical wind turbine data. The status patterns are predicted at six time periods spaced at 10 min intervals. The prediction models are generated by five data-mining algorithms. The random forest algorithm has produced the best prediction results. The prediction results are used to develop a component performance monitoring scheme.

Association Rule Mining of Relational Data

2011 ◽  
pp. 87-93
Author(s):  
Anne Denton
Keyword(s):  
Data Mining ◽  
Data Structures ◽  
Association Rule ◽  
Association Rule Mining ◽  
Relational Data ◽  
Rule Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithms ◽  
Relational Database Management ◽  
Relational Database Management Systems

Most data of practical relevance are structured in more complex ways than is assumed in traditional data mining algorithms, which are based on a single table. The concept of relations allows for discussing many data structures such as trees and graphs. Relational data have much generality and are of significant importance, as demonstrated by the ubiquity of relational database management systems. It is, therefore, not surprising that popular data mining techniques, such as association rule mining, have been generalized to relational data. An important aspect of the generalization process is the identification of challenges that are new to the generalized setting.

Fault Monitoring of Wind Turbine Generator Brushes: A Data-Mining Approach

2012 ◽  
Vol 134 (2) ◽  
Author(s):  
Anoop Verma ◽  
Andrew Kusiak
Keyword(s):  
Data Mining ◽  
Wind Turbine ◽  
Wind Turbines ◽  
Turbine Generator ◽  
Wind Turbine Generator ◽  
Data Mining Algorithms ◽  
Data Mining Approach ◽  
Carbon Brushes ◽  
Critical Components ◽  
Mining Algorithms

Components of wind turbines are subjected to asymmetric loads caused by variable wind conditions. Carbon brushes are critical components of the wind turbine generator. Adequately maintaining and detecting abnormalities in the carbon brushes early is essential for proper turbine performance. In this paper, data-mining algorithms are applied for early prediction of carbon brush faults. Predicting generator brush faults early enables timely maintenance or replacement of brushes. The results discussed in this paper are based on analyzing generator brush faults that occurred on 27 wind turbines. The datasets used to analyze faults were collected from the supervisory control and data acquisition (SCADA) systems installed at the wind turbines. Twenty-four data-mining models are constructed to predict faults up to 12 h before the actual fault occurs. To increase the prediction accuracy of the models discussed, a data balancing approach is used. Four data-mining algorithms were studied to evaluate the quality of the models for predicting generator brush faults. Among the selected data-mining algorithms, the boosting tree algorithm provided the best prediction results. Research limitations attributed to the available datasets are discussed.

scholarly journals Present State-of-The-ART of Dynamic Association Rule Mining Algorithms

2019 ◽  
Vol 9 (1) ◽  
pp. 309-316
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Healthcare Data ◽  
Data Mining Approach ◽  
Mining Community ◽  
Pattern Growth ◽  
Mining Algorithms

Association Rule Mining (ARM) is a data mining approach for discovering rules that reveal latent associations among persisted entity sets. ARM has many significant applications in the real world such as finding interesting incidents, analyzing stock market data and discovering hidden relationships in healthcare data to mention few. Many algorithms that are efficient to mine association rules are found in the existing literature, apriori-based and Pattern-Growth. Comprehensive understanding of them helps data mining community and its stakeholders to make expert decisions. Dynamic update of association rules that have been discovered already is very challenging due to the fact that the changes are arbitrary and heterogeneous in the kind of operations. When new instances are added to existing dataset that has been subjected to ARM, only those instances are to be used in order to go for incremental mining of rules instead of considering the whole dataset again. Recently some algorithms were developed by researchers especially to achieve incremental ARM. They are broadly grouped into Apriori-based and Pattern-Growth. This paper provides review of Apriori-based and Pattern-Growth techniques that support incremental ARM.

Association Rule Mining of Regional Data

2011 ◽  
pp. 70-73
Author(s):  
Anne Denton ◽  
Christopher Besemann
Keyword(s):  
Data Mining ◽  
Data Structures ◽  
Association Rule ◽  
Association Rule Mining ◽  
Relational Data ◽  
Rule Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithms ◽  
Relational Database Management ◽  
Relational Database Management Systems

Most data of practical relevance are structured in more complex ways than is assumed in traditional data mining algorithms, which are based on a single table. The concept of relations allows for discussing many data structures such as trees and graphs. Relational data have much generality and are of significant importance, as demonstrated by the ubiquity of relational database management systems. It is, therefore, not surprising that popular data mining techniques, such as association rule mining, have been generalized to relational data. An important aspect of the generalization process is the identification of problems that are new to the generalized setting.

Algorithms of Mining Maximum Frequent Itemsets Based on Compression Matrix

2014 ◽  
Vol 571-572 ◽  
pp. 57-62
Author(s):  
Si Hui Shu ◽  
Zi Zhi Lin
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Recursive Algorithm ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Temporal Complexity ◽  
Data Mining Algorithms ◽  
Association Data ◽  
Mining Algorithms

Association rule mining is one of the most important and well researched techniques of data mining, the key procedure of the association rule mining is to find frequent itemsets , the frequent itemsets are easily obtained by maximum frequent itemsets. so finding maximum frequent itemsets is one of the most important strategies of association data mining. Algorithms of mining maximum frequent itemsets based on compression matrix are introduced in this paper. It mainly obtains all maximum frequent itemsets by simply removing a set of rows and columns of transaction matrix, which is easily programmed recursive algorithm. The new algorithm optimizes the known association rule mining algorithms based on matrix given by some researchers in recent years, which greatly reduces the temporal complexity and spatial complexity, and highly promotes the efficiency of association rule mining.

Sensitive Items in Privacy Preserving — Association Rule Mining

2008 ◽  
Vol 07 (01) ◽  
pp. 31-35
Author(s):  
K. Duraiswamy ◽  
N. Maheswari
Keyword(s):  
Data Mining ◽  
Private Information ◽  
Association Rule ◽  
Association Rule Mining ◽  
Privacy Preserving ◽  
Data Input ◽  
Rule Mining ◽  
Privacy Preserving Data Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Privacy-preserving has recently been proposed in response to the concerns of preserving personal or sensible information derived from data-mining algorithms. For example, through data-mining, sensible information such as private information or patterns may be inferred from non-sensible information or unclassified data. As large repositories of data contain confidential rules that must be protected before published, association rule hiding becomes one of important privacy preserving data-mining problems. There have been two types of privacy concerning data-mining. Output privacy tries to hide the mining results by minimally altering the data. Input privacy tries to manipulate the data so that the mining result is not affected or minimally affected. For some applications certain sensitive predictive rules are hidden that contain given sensitive items. To identify the sensitive items an algorithm SENSITEM is proposed. The results of the work have been given.

scholarly journals Present State-of-The-Art of Association Rule Mining Algorithms

2019 ◽  
Vol 9 (1) ◽  
pp. 6398-6405
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
State Of The Art ◽  
Synthetic Data ◽  
Data Sets ◽  
Evolutionary Analysis ◽  
Rule Mining ◽  
Transaction Database ◽  
Mining Algorithms

A Data mining is the method of extracting useful information from various repositories such as Relational Database, Transaction database, spatial database, Temporal and Time-series database, Data Warehouses, World Wide Web. Various functionalities of Data mining include Characterization and Discrimination, Classification and prediction, Association Rule Mining, Cluster analysis, Evolutionary analysis. Association Rule mining is one of the most important techniques of Data Mining, that aims at extracting interesting relationships within the data. In this paper we study various Association Rule mining algorithms, also compare them by using synthetic data sets, and we provide the results obtained from the experimental analysis

scholarly journals Finding Efficient Positive and Negative Itemsets Using Interestingness Measures

2018 ◽  
Vol 7 (4.36) ◽  
pp. 533
Author(s):  
P. Asha ◽  
T. Prem Jacob ◽  
A. Pravin
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Data Gathering ◽  
Unstructured Data ◽  
Rule Mining ◽  
Interestingness Measures ◽  
Data Mining Algorithms ◽  
Data Formats ◽  
Mining Algorithms ◽  
Rare Itemsets

Currently, data gathering techniques have increased through which unstructured data creeps in, along with well defined data formats. Mining these data and bringing out useful patterns seems difficult. Various data mining algorithms were put forth for this purpose. The associated patterns generated by the association rule mining algorithms are large in number. Every ARM focuses on positive rule mining and very few literature has focussed on rare_itemsets_mining. The work aims at retrieving the rare itemsets that are of most interest to the user by utilizing various interestingness measures. Both positive and negative itemset mining would be focused in this work.  

A Data Mining Approach for Generation of Control Signatures

2002 ◽  
Vol 124 (4) ◽  
pp. 923-926 ◽  
Author(s):  
Andrew Kusiak
Keyword(s):  
Data Mining ◽  
Metal Forming ◽  
Rough Set Theory ◽  
Decision Rules ◽  
Forming Process ◽  
Data Mining Algorithms ◽  
Data Mining Approach ◽  
Metal Forming Process ◽  
Material Forming ◽  
Mining Algorithms

Data mining offers methodologies and tools for data analysis, discovery of new knowledge, and autonomous process control. This paper introduces basic data mining algorithms. An approach based on rough set theory is used to derive associations among control parameters and the product quality in the form of decision rules. The model presented in the paper produces control signatures leading to good quality products of a metal forming process. The computational results reported in the paper indicate that data mining opens a new avenue for decision-making in material forming industry.

Sign in / Sign up

Export Citation Format

Share Document