A Monte Carlo-rough based mixed-integer probablistic non-linear programming model for predicting and minimizing unavailability of power system components
01 Feb 2014-pp 1-6
TL;DR: Rough Set based knowledge discovery for predicting faults and probability of failure in high voltage equipment present in a real electrical systems is proposed.
Abstract: Data mining processes were initially invented and developed for finding out meaningful information and deriving rules from more recent data sets. With growth in the size of power systems due to the increased requirements of industries and cities for uninterrupted power supply, data mining in electrical systems has emerged as a very efficient tool for continuous assessment of power systems. In this paper we propose Rough Set based knowledge discovery for predicting faults and probability of failure in high voltage equipment present in a real electrical systems. The approach has several different steps viz. analysis of real time data, creation and population of databases, pre-processing of data and use of rough sets based data mining algorithm to finally determine the set of rules for knowledge discovery. The methodology has been validated by presenting a case study and application of the algorithm on real time data.
References
More filters
Book•
08 Sep 2000TL;DR: This book presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects, and provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data.
Abstract: The increasing volume of data in modern business and science calls for more complex and sophisticated tools. Although advances in data mining technology have made extensive data collection much easier, it's still always evolving and there is a constant need for new techniques and tools that can help us transform this data into useful information and knowledge. Since the previous edition's publication, great advances have been made in the field of data mining. Not only does the third of edition of Data Mining: Concepts and Techniques continue the tradition of equipping you with an understanding and application of the theory and practice of discovering patterns hidden in large data sets, it also focuses on new, important topics in the field: data warehouses and data cube technology, mining stream, mining social networks, and mining spatial, multimedia and other complex data. Each chapter is a stand-alone guide to a critical topic, presenting proven algorithms and sound implementations ready to be used directly or with strategic modification against live data. This is the resource you need if you want to apply today's most powerful data mining techniques to meet real business challenges. * Presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects. * Addresses advanced topics such as mining object-relational databases, spatial databases, multimedia databases, time-series databases, text databases, the World Wide Web, and applications in several fields. *Provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data
23,600 citations
Book•
31 Oct 1991
TL;DR: Theoretical Foundations.
Abstract: I. Theoretical Foundations.- 1. Knowledge.- 1.1. Introduction.- 1.2. Knowledge and Classification.- 1.3. Knowledge Base.- 1.4. Equivalence, Generalization and Specialization of Knowledge.- Summary.- Exercises.- References.- 2. Imprecise Categories, Approximations and Rough Sets.- 2.1. Introduction.- 2.2. Rough Sets.- 2.3. Approximations of Set.- 2.4. Properties of Approximations.- 2.5. Approximations and Membership Relation.- 2.6. Numerical Characterization of Imprecision.- 2.7. Topological Characterization of Imprecision.- 2.8. Approximation of Classifications.- 2.9. Rough Equality of Sets.- 2.10. Rough Inclusion of Sets.- Summary.- Exercises.- References.- 3. Reduction of Knowledge.- 3.1. Introduction.- 3.2. Reduct and Core of Knowledge.- 3.3. Relative Reduct and Relative Core of Knowledge.- 3.4. Reduction of Categories.- 3.5. Relative Reduct and Core of Categories.- Summary.- Exercises.- References.- 4. Dependencies in Knowledge Base.- 4.1. Introduction.- 4.2. Dependency of Knowledge.- 4.3. Partial Dependency of Knowledge.- Summary.- Exercises.- References.- 5. Knowledge Representation.- 5.1. Introduction.- 5.2. Examples.- 5.3. Formal Definition.- 5.4. Significance of Attributes.- 5.5. Discernibility Matrix.- Summary.- Exercises.- References.- 6. Decision Tables.- 6.1. Introduction.- 6.2. Formal Definition and Some Properties.- 6.3. Simplification of Decision Tables.- Summary.- Exercises.- References.- 7. Reasoning about Knowledge.- 7.1. Introduction.- 7.2. Language of Decision Logic.- 7.3. Semantics of Decision Logic Language.- 7.4. Deduction in Decision Logic.- 7.5. Normal Forms.- 7.6. Decision Rules and Decision Algorithms.- 7.7. Truth and Indiscernibility.- 7.8. Dependency of Attributes.- 7.9. Reduction of Consistent Algorithms.- 7.10. Reduction of Inconsistent Algorithms.- 7.11. Reduction of Decision Rules.- 7.12. Minimization of Decision Algorithms.- Summary.- Exercises.- References.- II. Applications.- 8. Decision Making.- 8.1. Introduction.- 8.2. Optician's Decisions Table.- 8.3. Simplification of Decision Table.- 8.4. Decision Algorithm.- 8.5. The Case of Incomplete Information.- Summary.- Exercises.- References.- 9. Data Analysis.- 9.1. Introduction.- 9.2. Decision Table as Protocol of Observations.- 9.3. Derivation of Control Algorithms from Observation.- 9.4. Another Approach.- 9.5. The Case of Inconsistent Data.- Summary.- Exercises.- References.- 10. Dissimilarity Analysis.- 10.1. Introduction.- 10.2. The Middle East Situation.- 10.3. Beauty Contest.- 10.4. Pattern Recognition.- 10.5. Buying a Car.- Summary.- Exercises.- References.- 11. Switching Circuits.- 11.1. Introduction.- 11.2. Minimization of Partially Defined Switching Functions.- 11.3. Multiple-Output Switching Functions.- Summary.- Exercises.- References.- 12. Machine Learning.- 12.1. Introduction.- 12.2. Learning From Examples.- 12.3. The Case of an Imperfect Teacher.- 12.4. Inductive Learning.- Summary.- Exercises.- References.
7,826 citations
TL;DR: This paper explores the use of a new technique, the probabilistic collocation method (PCM), to enable the evaluation of uncertainty in power system simulations.
Abstract: This paper explores the use of a new technique, the probabilistic collocation method (PCM), to enable the evaluation of uncertainty in power system simulations. The PCM allows the uncertainty in transient behavior of power systems to be studied using only a handful of simulations. The relevant theory is outlined here and simple examples are used to illustrate the application of PCM in a power systems setting. In addition, an index for identification of key uncertain parameters, as well as an example with a more realistic power system, are presented.
180 citations
64 citations
Journal Article•
TL;DR: In this article, a stochastic programming framework is proposed for congestion management considering the power system uncertainties, where the uncertainty sources consist of contingencies of generating units and branches as well as load forecast errors.
Abstract: Congestion management in electricity markets is traditionally done using deterministic values of power system parameters considering a fixed network configuration. In this paper, a stochastic programming framework is proposed for congestion management considering the power system uncertainties. The uncertainty sources that are modeled in the proposed stochastic framework consist of contingencies of generating units and branches as well as load forecast errors. The Forced Outage Rate of equipment and the normal distribution function to model load forecast errors are employed in the stochastic programming. Using the roulette wheel mechanism and Monte-Carlo analysis, possible scenarios of power system operating states are generated and a probability is assigned to each scenario. Scenario reduction is adopted as a tradeoff between computation time and solution accuracy. After scenario reduction, stochastic congestion management solution is extracted by aggregation of solutions obtained from feasible scenarios. Congestion management using the proposed stochastic framework provides a more realistic solution compared with the deterministic solution by a reasonable uncertainty cost. Results of testing the proposed stochastic congestion management on the 24-bus reliability test system indicate the efficiency of the proposed framework.
7 citations