Data Mining Algorithms for Decentralized Fault Detection and Diagnostic in Industrial Systems
dc.contributor.advisor | Vucetic, Slobodan | |
dc.creator | Grbovic, Mihajlo | |
dc.date.accessioned | 2020-10-26T19:19:07Z | |
dc.date.available | 2020-10-26T19:19:07Z | |
dc.date.issued | 2012 | |
dc.identifier.other | 864885556 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12613/1338 | |
dc.description.abstract | Timely Fault Detection and Diagnosis in complex manufacturing systems is critical to ensure safe and effective operation of plant equipment. Process fault is defined as a deviation from normal process behavior, defined within the limits of safe production. The quantifiable objectives of Fault Detection include achieving low detection delay time, low false positive rate, and high detection rate. Once a fault has been detected pinpointing the type of fault is needed for purposes of fault mitigation and returning to normal process operation. This is known as Fault Diagnosis. Data-driven Fault Detection and Diagnosis methods emerged as an attractive alternative to traditional mathematical model-based methods, especially for complex systems due to difficulty in describing the underlying process. A distinct feature of data-driven methods is that no a priori information about the process is necessary. Instead, it is assumed that historical data, containing process features measured in regular time intervals (e.g., power plant sensor measurements), are available for development of fault detection/diagnosis model through generalization of data. The goal of my research was to address the shortcomings of the existing data-driven methods and contribute to solving open problems, such as: 1) decentralized fault detection and diagnosis; 2) fault detection in the cold start setting; 3) optimizing the detection delay and dealing with noisy data annotations. 4) developing models that can adapt to concept changes in power plant dynamics. For small-scale sensor networks, it is reasonable to assume that all measurements are available at a central location (sink) where fault predictions are made. This is known as a centralized fault detection approach. For large-scale networks, decentralized approach is often used, where network is decomposed into potentially overlapping blocks and each block provides local decisions that are fused at the sink. The appealing properties of the decentralized approach include fault tolerance, scalability, and reusability. When one or more blocks go offline due to maintenance of their sensors, the predictions can still be made using the remaining blocks. In addition, when the physical facility is reconfigured, either by changing its components or sensors, it can be easier to modify part of the decentralized system impacted by the changes than to overhaul the whole centralized system. The scalability comes from reduced costs of system setup, update, communication, and decision making. Main challenges in decentralized monitoring include process decomposition and decision fusion. We proposed a decentralized model where the sensors are partitioned into small, potentially overlapping, blocks based on the Sparse Principal Component Analysis (PCA) algorithm, which preserves strong correlations among sensors, followed by training local models at each block, and fusion of decisions based on the proposed Maximum Entropy algorithm. Moreover, we introduced a novel framework for adding constraints to the Sparse PCA problem. The constraints limit the set of possible solutions by imposing additional goals to be reached trough optimization along with the existing Sparse PCA goals. The experimental results on benchmark fault detection data show that Sparse PCA can utilize prior knowledge, which is not directly available in data, in order to produce desirable network partitions, with a pre-defined limit on communication cost and/or robustness. | |
dc.format.extent | 157 pages | |
dc.language.iso | eng | |
dc.publisher | Temple University. Libraries | |
dc.relation.ispartof | Theses and Dissertations | |
dc.rights | IN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available. | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Computer Science | |
dc.subject | Data Mining | |
dc.subject | Decentralized Learning | |
dc.subject | Fault Detection | |
dc.subject | Fault Diagnosis | |
dc.subject | Machine Learning | |
dc.subject | Sparse Principal Component Analysis | |
dc.title | Data Mining Algorithms for Decentralized Fault Detection and Diagnostic in Industrial Systems | |
dc.type | Text | |
dc.type.genre | Thesis/Dissertation | |
dc.contributor.committeemember | Obradovic, Zoran | |
dc.contributor.committeemember | Latecki, Longin | |
dc.contributor.committeemember | Seibold, Benjamin | |
dc.description.department | Computer and Information Science | |
dc.relation.doi | http://dx.doi.org/10.34944/dspace/1320 | |
dc.ada.note | For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu | |
dc.description.degree | Ph.D. | |
refterms.dateFOA | 2020-10-26T19:19:07Z |