Rough set theory for data mining for fault diagnosis on distribution feeder

2004 ◽  
Vol 151 (6) ◽  
pp. 689 ◽  
Author(s):  
J.-T. Peng ◽  
C.F. Chien ◽  
T.L.B. Tseng
Keyword(s):  
Data Mining ◽  
Fault Diagnosis ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Distribution Feeder

Research of Data Mining of Vibratory Signal Based on Rough Set Theory

2013 ◽  
Vol 347-350 ◽  
pp. 228-232
Author(s):  
Qin Zeng Xue ◽  
Gang Xue ◽  
Guo Ku Liu
Keyword(s):  
Data Mining ◽  
Fault Diagnosis ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Signal Energy ◽  
Experimental Platform ◽  
Vibratory Signal ◽  
Feature Parameter ◽  
Vibratory Signals

This paper sets three fault modes of rotor misalignment, pedestal looseness and rub between rotor and stator by rotor experimental platform and collected corresponding vibratory signals. Part of vibratory signal energy feature was extracted in the time field. As feature parameter of energy, the signal collected was mined using rough set theory, fault diagnosis was established on this basis. Validity of rule was verified by remaining vibratory signal, the result indicates diagnosis are accurate, fault diagnosis rule is meaningful.

Information Veins and Resampling with Rough Set Theory

2011 ◽  
pp. 1034-1040
Author(s):  
Benjamin Griffiths
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Decision Rules ◽  
International Conference ◽  
Fuzzy Environment ◽  
Leave One Out ◽  
Variable Precision Rough Sets

Rough Set Theory (RST), since its introduction in Pawlak (1982), continues to develop as an effective tool in data mining. Within a set theoretical structure, its remit is closely concerned with the classification of objects to decision attribute values, based on their description by a number of condition attributes. With regards to RST, this classification is through the construction of ‘if .. then ..’ decision rules. The development of RST has been in many directions, amongst the earliest was with the allowance for miss-classification in the constructed decision rules, namely the Variable Precision Rough Sets model (VPRS) (Ziarko, 1993), the recent references for this include; Beynon (2001), Mi et al. (2004), and Slezak and Ziarko (2005). Further developments of RST have included; its operation within a fuzzy environment (Greco et al., 2006), and using a dominance relation based approach (Greco et al., 2004). The regular major international conferences of ‘International Conference on Rough Sets and Current Trends in Computing’ (RSCTC, 2004) and ‘International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing’ (RSFDGrC, 2005) continue to include RST research covering the varying directions of its development. This is true also for the associated book series entitled ‘Transactions on Rough Sets’ (Peters and Skowron, 2005), which further includes doctoral theses on this subject. What is true, is that RST is still evolving, with the eclectic attitude to its development meaning that the definitive concomitant RST data mining techniques are still to be realised. Grzymala-Busse and Ziarko (2000), in a defence of RST, discussed a number of points relevant to data mining, and also made comparisons between RST and other techniques. Within the area of data mining and the desire to identify relationships between condition attributes, the effectiveness of RST is particularly pertinent due to the inherent intent within RST type methodologies for data reduction and feature selection (Jensen and Shen, 2005). That is, subsets of condition attributes identified that perform the same role as all the condition attributes in a considered data set (termed ß-reducts in VPRS, see later). Chen (2001) addresses this, when discussing the original RST, they state it follows a reductionist approach and is lenient to inconsistent data (contradicting condition attributes - one aspect of underlying uncertainty). This encyclopaedia article describes and demonstrates the practical application of a RST type methodology in data mining, namely VPRS, using nascent software initially described in Griffiths and Beynon (2005). The use of VPRS, through its relative simplistic structure, outlines many of the rudiments of RST based methodologies. The software utilised is oriented towards ‘hands on’ data mining, with graphs presented that clearly elucidate ‘veins’ of possible information identified from ß-reducts, over different allowed levels of missclassification associated with the constructed decision rules (Beynon and Griffiths, 2004). Further findings are briefly reported when undertaking VPRS in a resampling environment, with leave-one-out and bootstrapping approaches adopted (Wisnowski et al., 2003). The importance of these results is in the identification of the more influential condition attributes, pertinent to accruing the most effective data mining results.

Intrusion Detection Using Modern Techniques

2011 ◽  
pp. 259-273
Author(s):  
Tarum Bhaskar ◽  
Narasimha Kamath B.
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Artificial Neural Network ◽  
Intrusion Detection ◽  
Set Theory ◽  
Rough Set ◽  
Intrusion Detection System ◽  
Rough Set Theory ◽  
Detection System ◽  
Mining Tools

Intrusion detection system (IDS) is now becoming an integral part of the network security infrastructure. Data mining tools are widely used for developing an IDS. However, this requires an ability to find the mapping from the input space to the output space with the help of available data. Rough sets and neural networks are the best known data mining tools to analyze data and help solve this problem. This chapter proposes a novel hybrid method to integrate rough set theory, genetic algorithm (GA), and artificial neural network. Our method consists of two stages: First, rough set theory is applied to find the reduced dataset. Second, the results are used as inputs for the neural network, where a GA-based learning approach is used to train the intrusion detection system. The method is characterized not only by using attribute reduction as a pre-processing technique of an artificial neural network but also by an improved learning algorithm. The effectiveness of the proposed method is demonstrated on the KDD cup data.

Fuzzy Miner

2011 ◽  
pp. 299-321 ◽  
Author(s):  
Nikos Pelekis ◽  
Babis Theodoulidis ◽  
Ioannis Kopanakis ◽  
Yannis Theodoridis
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Internet Routing ◽  
Data Mining Approach ◽  
New Information

QOSP Quality of Service Open Shortest Path First based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper focuses on routing algorithms and their appli-cations for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute-selection prob-lem in internet routing.

Sign in / Sign up

Export Citation Format

Share Document