2015
DOI: 10.1016/j.enbuild.2014.10.069
|View full text |Cite
|
Sign up to set email alerts
|

Robust model-based fault diagnosis for air handling units

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
51
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 112 publications
(54 citation statements)
references
References 41 publications
0
51
0
Order By: Relevance
“…Principal Component Analysis (PCA) [16,17,18], Statistical Process Control (SPC) [19,20,21], Multivariate Regression Models [22], Bayes Classifier [23,24,25], Neural Networks (NN) [26,27,28], Fisher Discriminant Analysis 40 (FDA) [29], Gaussion Mixture Model [30], Support Vector Data Description (SVDD) [31,32], and Support Vector Machines (SVM) [33, 34,35,36,37]. A c c e p t e d M a n u s c r i p t [13,38,39].…”
Section: Introductionmentioning
confidence: 99%
“…Principal Component Analysis (PCA) [16,17,18], Statistical Process Control (SPC) [19,20,21], Multivariate Regression Models [22], Bayes Classifier [23,24,25], Neural Networks (NN) [26,27,28], Fisher Discriminant Analysis 40 (FDA) [29], Gaussion Mixture Model [30], Support Vector Data Description (SVDD) [31,32], and Support Vector Machines (SVM) [33, 34,35,36,37]. A c c e p t e d M a n u s c r i p t [13,38,39].…”
Section: Introductionmentioning
confidence: 99%
“…The resulting performance was considered excellent due to the fact that the training was conducted using fault data. For instance, the average fault diagnosis rate was 93.5% for eleven faults reported in Mulumba et al [31] and around 99.8% for nine faults reported in Yuwono et al [32]. The proposed method is appropriate in situations that fault data are unavailable.…”
Section: Discussionmentioning
confidence: 91%
“…In contrast, the meaningful clusters with the number of the data points 189 fewer than MinPts are likely to be neglected if MinPts is too large. The results from Ankerst 190 et al [28] showed that MinPts in the range of [10][11][12][13][14][15][16][17][18][19][20] The OPTICS algorithm starts with a random point and expands the visiting to its directly 211 density-connected neighbours, followed by sorting the points with the reachability-distance 212 visited so far in an ascending order and then expanding again from the first unexpanded point 213 in the order list. This process virtually walks through the Minimum Spanning Tree [35].…”
Section: Optics Cluster Analysis 179mentioning
confidence: 99%