28.10.2014 Views

Fault Detection and Diagnostics for Rooftop Air Conditioners

Fault Detection and Diagnostics for Rooftop Air Conditioners

Fault Detection and Diagnostics for Rooftop Air Conditioners

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Discharge line temperature (F)<br />

200<br />

160<br />

120<br />

80<br />

40<br />

0<br />

Transient data<br />

Output of steady-state detector (steady-state=1, transient-state=0)<br />

8/21/2001 6:40 8/22/2001 11:50 8/23/2001 11:02 8/24/2001 7:52<br />

Time<br />

3<br />

2.5<br />

2<br />

1.5<br />

1<br />

0.5<br />

0<br />

Steady-state indicator<br />

Figure 4.9 Steady-state detection<br />

4.2.3 Clustering of steady-state data<br />

For some problems, the number of data points may be small enough that all of the data<br />

available can be used directly in learning a model. In other problems, the number of data<br />

obtained can become sufficiently large that it is no longer practical to assign a separate<br />

node to each data. Clustering techniques can be used to group data so that the group can<br />

be represented by only one data point. Clustering of steady-state data is necessary <strong>for</strong> the<br />

following two reasons:<br />

Firstly, there are measurement noise <strong>and</strong> system disturbances, so clustering will act<br />

as a filter.<br />

Secondly, clustering will reduce the large number of steady state data to much a<br />

smaller set of steady state data. This will greatly reduce the nodes of the GRNN<br />

<strong>and</strong> memory to realize the GRNN algorithm.<br />

First, establish a single radius of influence, r . Starting with the first point ( X ,Y ) ,<br />

establish a cluster center,<br />

i<br />

X , at X . All future data <strong>for</strong> which the distance<br />

than the distance to any other cluster center <strong>and</strong> is also<br />

i . A data point <strong>for</strong> which the distance to the nearest cluster is larger than<br />

i<br />

X − X is less<br />

≤ r would be grouped into cluster<br />

r would become<br />

the center <strong>for</strong> a new cluster. After clustering, the expectation (average) of each group data<br />

43

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!