# Use of Active Learning to Design Wind Tunnel Runs for Unsteady Cavity Pressure Measurements

Authors: Ankur Srivastava; Andrew J. Meade
Journal: International Journal of Aerospace Engineering
 (2014)

---

## Abstract

Wind tunnel tests to measure unsteady cavity flow pressure measurements can be expensive, lengthy, and tedious. In this work, the feasibility of an active machine learning technique to design wind tunnel runs using proxy data is tested. The proposed active learning scheme used scattered data approximation in conjunction with uncertainty sampling (US). We applied the proposed intelligent sampling strategy in characterizing cavity flow classes at subsonic and transonic speeds and demonstrated that the scheme has better classification accuracies, using fewer training points, than a passive Latin Hypercube Sampling (LHS) strategy.


---

## Body

## 1. Introduction

Internal carriage of stores in aircraft has many aerodynamic advantages especially in military applications. These include enhanced maneuverability, reduced drag, and increased stealth of the aircraft. However, flow over the cavities might generate steady and unsteady disturbances that can affect safe discharge of stores [1]. Figure 1(a) shows the open bomb bay of the F-22 Raptor which can generate self-sustaining oscillations that might lead to cavity resonance risking the structural integrity of the vehicle [2]. Figure 1(b) shows the open missile bay of the F-35 Lightning II that can provide a large nose-up pitching moment to the stores on discharge [3]. These flow disturbances demand extensive computational and experimental studies to be conducted at all operational speeds.(a) Open bomb bay of a F-22 Raptor [2] and (b) open missile bay of a F-35 Lightning II [3].
(a)
(b)It is widely acknowledged that wind tunnel testing is essential in characterizing flow across a cavity. A number of parameters can influence the flow including freestream Mach number, geometric dimensions of the cavity, and location of stores within the cavity [1, 4, 5]. The number of parameter combinations and requisite data reduction can render wind tunnel testing tedious, expensive, and time consuming. Any innovative mathematical technique that can reduce the time and expense of wind tunnel experiments is welcome.In a related work, the authors demonstrated how machine learning tools could be used with Design of Experiments (DOEs) to steer the experiment by investigating input parameter sensitivities to the classification of the cavity flow type [6]. The authors used a Galerkin-derived adaptive implementation of artificial neural networks called sequential function approximation (SFA) [6–10] to predict the cavity flow type with or without acoustic resonance as a function of length-to-depth ratio (l
/
h), width-to-depth ratio (w
/
h), and the freestream Mach number (M
∞). The authors treated this problem as a multiclass classification problem and justified the selection of SFA by comparison against state-of-the-art classification tools.However, the work presented in [6] could only steer the cavity experiment by input parameter selection with respect to cavity flow type classification. It could not take part in the data collection procedure given a set of input parameters. In the machine learning literature, such use of a learning algorithm is referred to as passive learning. In this work, we present a learning strategy that actively takes part in the data collection procedure. In other words, we will focus on developing an intelligent sampling strategy that will inform the experimentalist of the most important regions in the test parameter space. Such a strategy that takes part in the data sampling procedure is known as active learning [11] in the machine learning community.


### 1.1. Unsteady Cavity Flow Experiments

Tracy and Plentovich [1] investigated flow characteristics of variable rectangular (Figure 2) cavities in the NASA Langley 8-foot Transonic Pressure Tunnel at subsonic and transonic speeds. They varied the length-to-depth ratio (l
/
h) from 1 to 17.5, the width-to-depth ratio (w
/
h) between 1, 4, 8, and 16, and the freestream Mach number (M
∞) from 0.2 to 0.95 at a unit Reynolds number per foot of approximately 3
×
1
0
6.Variable cavity wind tunnel model [1]. (a) Downstream view of installation. (b) Sketch of model. Linear dimensions are in inches.
(a)
(b)The cavity flow types were classified into 3 types, namely, open, transitional, and closed. Open flow is associated with deep cavities. TheC
p distribution for supersonic cavity flow, shown in Figure 3(a), remains nearly uniform with a sharp increase due to the shock at the trailing edge of the cavity wall. This type of cavity flow is usually associated with self-sustaining oscillations that generates acoustic tones radiating from the cavity. Closed cavity flow usually occurs in shallow cavities where the flow separates both at the forward face and at the rear face of the cavity resulting in a C
p distribution shown in Figure 3(b). The developed adverse static pressure gradient in closed cavities can cause the discharged stores to pitch up [1]. Transitional cavity flow exhibits features of both open and closed flows (Figure 4). In subsonic and transonic flows, a single transitional flow type is defined rather than transitional-open and transitional-closed as in supersonic flows.(a) Open cavity flow [1] and (b) closed cavity flow [1].
(a)
(b)Transitional cavity flows [1].
(a)
Transitional-open cavity flow
(b)
Transitional-closed cavity flowFigure5 summarizes the parameter combinations that support cavity resonance in this experiment. Circles correspond to open flow. Squares correspond to transitional flow. Diamonds correspond to closed flow. Any filled symbol indicates the presence of acoustic resonance. The solid lines illustrate the boundaries between open, transitional, and closed flows.Occurrence of resonance superimposed with observed cavity flow conditions [1].
(a)
w
=
2.4 in; h
=
2.4 in
(b)
w
=
9.6 in; h
=
2.4 in
(c)
w
=
9.6 in; h
=
1.2 in
(d)
w
=
9.6 in; h
=
0.6 inTracy and Plentovich [1] conducted wind tunnel runs at 267 different configurations of M
∞, w
/
h, and l
/
h with the primary conclusion that cavities change from resonant to nonresonant conditions as l
/
h increases. They concluded that the cavity flow type was most sensitive to l
/
h, while the resonance amplitude and flow transition boundaries varied with w
/
h. For each parameter combination, labor intensive data reduction was applied to obtain the mean static pressure distribution and frequency of the pressure oscillations to determine the flow type and the presence of resonance [1].The primary objective of this work is to explore the use of active machine learning techniques in steering through the wind tunnel test matrix of the Tracy and Plentovich cavity flow pressure measurement problem. We will use uncertainty sampling (US) [12] with SFA as the active learning technique. In this technique, US uses, in a sequential manner, the approximation of the discriminant function constructed by SFA to determine the input configuration that should be chosen to conduct the next wind tunnel run. We will compare generalization ability of SFA when input data is sampled via active learning or by traditional LHS design techniques [13].In Section2, we provide a brief introduction to active learning for classification problems. It also presents the details of SFA and its implementation with US, the chosen active learning scheme. Section 3 presents a comparison of prediction accuracies of uncertainty sampling with LHS technique. Section 4 presents conclusions and future work.


## 1.1. Unsteady Cavity Flow Experiments

Tracy and Plentovich [1] investigated flow characteristics of variable rectangular (Figure 2) cavities in the NASA Langley 8-foot Transonic Pressure Tunnel at subsonic and transonic speeds. They varied the length-to-depth ratio (l
/
h) from 1 to 17.5, the width-to-depth ratio (w
/
h) between 1, 4, 8, and 16, and the freestream Mach number (M
∞) from 0.2 to 0.95 at a unit Reynolds number per foot of approximately 3
×
1
0
6.Variable cavity wind tunnel model [1]. (a) Downstream view of installation. (b) Sketch of model. Linear dimensions are in inches.
(a)
(b)The cavity flow types were classified into 3 types, namely, open, transitional, and closed. Open flow is associated with deep cavities. TheC
p distribution for supersonic cavity flow, shown in Figure 3(a), remains nearly uniform with a sharp increase due to the shock at the trailing edge of the cavity wall. This type of cavity flow is usually associated with self-sustaining oscillations that generates acoustic tones radiating from the cavity. Closed cavity flow usually occurs in shallow cavities where the flow separates both at the forward face and at the rear face of the cavity resulting in a C
p distribution shown in Figure 3(b). The developed adverse static pressure gradient in closed cavities can cause the discharged stores to pitch up [1]. Transitional cavity flow exhibits features of both open and closed flows (Figure 4). In subsonic and transonic flows, a single transitional flow type is defined rather than transitional-open and transitional-closed as in supersonic flows.(a) Open cavity flow [1] and (b) closed cavity flow [1].
(a)
(b)Transitional cavity flows [1].
(a)
Transitional-open cavity flow
(b)
Transitional-closed cavity flowFigure5 summarizes the parameter combinations that support cavity resonance in this experiment. Circles correspond to open flow. Squares correspond to transitional flow. Diamonds correspond to closed flow. Any filled symbol indicates the presence of acoustic resonance. The solid lines illustrate the boundaries between open, transitional, and closed flows.Occurrence of resonance superimposed with observed cavity flow conditions [1].
(a)
w
=
2.4 in; h
=
2.4 in
(b)
w
=
9.6 in; h
=
2.4 in
(c)
w
=
9.6 in; h
=
1.2 in
(d)
w
=
9.6 in; h
=
0.6 inTracy and Plentovich [1] conducted wind tunnel runs at 267 different configurations of M
∞, w
/
h, and l
/
h with the primary conclusion that cavities change from resonant to nonresonant conditions as l
/
h increases. They concluded that the cavity flow type was most sensitive to l
/
h, while the resonance amplitude and flow transition boundaries varied with w
/
h. For each parameter combination, labor intensive data reduction was applied to obtain the mean static pressure distribution and frequency of the pressure oscillations to determine the flow type and the presence of resonance [1].The primary objective of this work is to explore the use of active machine learning techniques in steering through the wind tunnel test matrix of the Tracy and Plentovich cavity flow pressure measurement problem. We will use uncertainty sampling (US) [12] with SFA as the active learning technique. In this technique, US uses, in a sequential manner, the approximation of the discriminant function constructed by SFA to determine the input configuration that should be chosen to conduct the next wind tunnel run. We will compare generalization ability of SFA when input data is sampled via active learning or by traditional LHS design techniques [13].In Section2, we provide a brief introduction to active learning for classification problems. It also presents the details of SFA and its implementation with US, the chosen active learning scheme. Section 3 presents a comparison of prediction accuracies of uncertainty sampling with LHS technique. Section 4 presents conclusions and future work.


## 2. Approach

### 2.1. Classification

In statistics, classification of a data set involves the construction of a discriminant functionF, which then predicts the labels of the unlabeled data set as accurately as possible. In constructing the discriminant function, one makes the assumption that all of the samples are independent and identically distributed under the same probability distribution function. Unfortunately, this problem is not trivial for a real world data set since the probability distribution from which the samples are drawn is unknown. A number of classification tools, in statistics and function approximation theory, exist in the literature for real world problems and are discussed and compared in detail in [14]. Scattered data function approximation techniques in machine learning are also used to model either the discriminant function directly or the multidimensional manifold that separates the classes (e.g., separating hyper planes from the classic form of Support Vector Machines (SVMs)).In using scattered data approximation, we assume the discriminant itself is continuous but can only be measured in discrete values (the proxy function). The SFA tool used in this paper attempts to model the underlying functionu directly. Given a set of d-dimensional input data points ξ
∈
R
d and noting that a function can be arbitrarily well-approximated by a linear combination of basis functions ϕ, we only require that the approximation fit the scattered data within accepted tolerance; that is,
(1)
∑
i
=
1
s
∥
F
[
u
(
ξ
i
)
]
-
u
n
a
(
ξ
i
)
∥
2
≤
s
2
τ
2
,
where F
[
u
(
ξ
i
)
] is the user defined label of the output, u
(
ξ
i
) is the true underlying function, and u
n
a
(
ξ
i
) in (2) is the approximated solution, where
(2)
u
n
a
(
ξ
)
=
∑
j
=
1
n
c
j
(
ϕ
j
(
ξ
,
β
j
)
+
b
j
)
.
The values of the coefficients c
j and b
j and the kernel parameters β
j are determined by an optimization routine on the training set. This makes the performance of a classifier dependent on the number and quality of data points available.Traditionally, Design of Experiment (DOE) methods like the LHS technique are used to obtain input parameter combinations at which experiments are conducted to obtain outputs which are classified by an oracle to obtain their labels. LHS design methods sample data points such that they are uniformly distributed throughout the input space. They do not take into account the functional relationship between the inputs and the output. However, in many real world problems, the output variance is significant in only a limited region of the input domain. In classification problems, output variance is present only at the class discrimination boundaries. LHS designs in these cases might result in sampling data points from regions which are uninformative. This becomes a significant limitation, especially in problems where either the experiment is costly or the labeling process is tedious or both. To avoid the inefficient use of resources, we focus on sampling the data set utilizing active learning techniques which take into account the input-output functional relationship.


### 2.2. Active Learning for Classification Problems

In passive learning, as the number of training points of a learning algorithm is increased, the information gained per training sample gradually decreases [11]. To avoid this problem, one can estimate the uncertainty of the learning algorithm on different regions of the input domain and sample data points from the most uncertain regions of the domain. For nonlinear discriminant functions (F
[
v
]), data sampling by active learning is essentially sequential in nature. The active learning sampling scheme is as good as the model of F
[
v
] itself. If the model has biases, the chosen data will not be optimal. In real world problems, it is often difficult to determine the true nature of the input-output model (i.e., linear, exponential, and quadratic). However, we can use universal approximators like radial basis functions (RBFs) that automatically address the bias problem because of their smoothness and differentiability. The active learning scheme scans through the input domain to look for regions in which the learning algorithm is least confident. This can be computationally expensive if the number of input dimensions is excessively large. However, this can be addressed through optimum experiment design [15] approaches.An active learning scheme requires a learning algorithm to construct approximations of the input-output mapping. The desired learning algorithm should be able to construct a rough approximation of the hypersurface using only a few scattered data points. More importantly, the chosen learning algorithm should be computationally efficient since training and testing will need to be repeated every time a new set of unlabeled samples is added to the training set. This makes the use of grid search and cross-validation approaches for control and kernel parameter optimization computationally infeasible for active learning problems. This is the motivation of the authors in using the self-adaptive and greedy SFA algorithm, with uncertainty sampling, in this work. SFA was developed from mesh-free finite element research but shares similarities with the boosting [16] and matching pursuit [17] algorithms. It was later used to provide kernel based solutions to regression [9] and classification problems [6, 7, 10]. We start our approximation of u utilizing the RBF (ϕ):
(3)
ϕ
(
ξ
,
β
i
)
=
exp
⁡
[
-
(
ξ
-
ξ
i
*
)
·
(
ξ
-
ξ
i
*
)
σ
i
2
]
=
exp
⁡
[
ln
⁡
[
α
i
]
(
ξ
-
ξ
i
*
)
·
(
ξ
-
ξ
i
*
)
]
for
0
<
α
i
<
1
,
where β
i
=
{
α
i
,
ξ
i
*
}
∈
R
d
+
1 represents the ith basis function parameters, the width α
i, and the center ξ
i
*
∈
R
d. We write the RBF as (3) in order to set up the optimization problem for α
i as a bounded nonlinear line search instead of an unconstrained minimization problem. The basic principles of our greedy algorithm are motivated by the similarities between the iterative optimization procedures of Jones [18, 19] and Barron [20] and the method of weighted residuals (MWR), specifically the Galerkin method [21]. We can write the function residual r at the nth stage of approximation as in
(4)
r
n
=
F
[
u
(
ξ
)
]

-

u
n
a
(
ξ
)
=
F
[
u
(
ξ
)
]
-
u
n
-
1
a
(
ξ
)

-

c
n
(
ϕ
(
ξ
,
β
n
)

+

b
n
)
=
r
n
-
1
-
c
n
(
ϕ
(
ξ
,
β
n
)
+
b
n
)
=
r
n
-
1
-
c
n
(
ϕ
n
+
b
n
)
.
Using the Petrov-Galerkin approach, we select a coefficient c
n that will force the function residual to be orthogonal to the basis function and b
n using the discrete inner product given by
(5)
∑
j
=
1
s
r
n
(
ξ
j
)
(
ϕ
n
(
ξ
i
)
+
b
n
)
=
〈
r
n
,
(
ϕ
n
+
b
n
)
〉
D
=
-
〈
r
n
,
∂
r
n
∂
c
n
〉
D
=
-
1
2
∂
〈
r
n
,
r
n
〉
D
∂
c
n
=
0
which is equivalent to selecting a value of c
n that will minimize 〈
r
n
,
r
n
〉
D or
(6)
c
n
=
(
s
〈
ϕ
n
,
r
n
-
1
〉
D
-
〈
r
n
-
1
〉
D
〈
ϕ
n
〉
D
)
(
s
〈
ϕ
n
,
ϕ
n
〉
D
-
〈
ϕ
n
〉
D
〈
ϕ
n
〉
D
)
with
(7)
b
n
=
(
〈
r
n
-
1
〉
D
〈
ϕ
n
,
ϕ
n
〉
D
-
〈
ϕ
n
〉
D
〈
ϕ
n
,
r
n
-
1
〉
D
)
(
s
〈
ϕ
n
,
r
n
-
1
〉
D
-
〈
r
n
-
1
〉
D
〈
ϕ
n
〉
D
)
.
The discrete inner product 〈
r
n
,
r
n
〉
D, which is equivalent to the square of the discrete L
2 norm, can be rewritten, with the substitution of (6) and (7), as
(8)
∑
j
=
1
s
r
n
(
ξ
j
)
r
n
(
ξ
j
)
=
∥
r
n
∥
2
,
D
2
=
〈
r
n
,
r
n
〉
D
=
〈
r
n
-
1
-
〈
r
n
-
1
〉
D
s
,
r
n
-
1
-
〈
r
n
-
1
〉
D
s
〉
D
×
(
1
-
(
〈
r
n
-
1
-
〈
r
n
-
1
〉
D
s
,
ϕ
n
-
〈
ϕ
n
〉
D
s
〉
D
2
v
v
v
v
v
v
v
v
v
v
v
v
v
v
×
(
-
〈
r
n
-
1
〉
D
s
〉
D
)
-
1
)
〈
ϕ
n
-
〈
ϕ
n
〉
D
s
,
ϕ
n
-
〈
ϕ
n
〉
D
s
〉
D
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
×
〈
r
n
-
1
-
〈
r
n
-
1
〉
D
s
,
r
n
-
1
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
-
〈
r
n
-
1
〉
D
s
〉
D
-
〈
r
n
-
1
〉
D
s
〉
D
)
-
1
)
〈
ϕ
n
-
〈
ϕ
n
〉
D
s
,
ϕ
n
-
〈
ϕ
n
〉
D
s
〉
D
)
-
1
)
)
.
The dimensionality of the nonlinear optimization problem is kept low since we are solving only one basis at a time. Also, Meade Jr. and Zeldin [22] showed that for bell-shaped basis functions
(9)
∥
r
n
∥
2
2
≅
〈
r
n
,
r
n
〉
D
=
exp
⁡
[
κ
1
-
κ
2
n
]
,
where
n
≥
2
for positive constants κ
1 and κ
2. Equation (9) shows, for optimal convergence, the logarithm of the inner product of the residual as a linear function of the number of bases (n), which establishes an exponential convergence rate that is independent from the number of input dimensions. Though the SFA scheme allows the basis center (ξ
n
*) to be located anywhere in R
d, the practical application to problems with multiple inputs constrains the centers to the set of sample points {
ξ
1
,
…
,
ξ
s
}. At each stage, we determine ξ
n
* such that |
r
n
-
1
(
ξ
n
*
)
|
=
max
⁡
|
r
n
-
1
|. The remaining optimization variable α
n is continuous and constrained to 0
<
α
n
<
1.The algorithm terminates whenmax
⁡
|
r
n
|
≤
τ, where τ is the tolerance desired by the user. For binary classification, where F
[
u
]
=
+
1 or -
1, we set τ
=
1.0 and the approximation output is computed as sign
⁡
[
u
n
a
(
ξ
)
]. In this work, our multiclass classification problem is tackled by applying three binary classifiers in parallel. Approaches to combining binary classifiers include theone versus one combination, theone versus all pairing, and the error correcting output coding. There is no best approach to combining binary classifiers. Even thoughone versus all has its own shortcomings, this approach was selected by the authors because of its simplicity and acceptable accuracy. Rifkin and Klautau [23] compared theone versus all approach to other existing methods and concluded thatone versus all classification will produce results as good as any other approach if the underlying classifiers are well tuned. In a standardone versus all formulation applied to a multiclass classification task, M binary classifiers are constructed where M is the number of classes in the data set. Each classifier predicts the presence of a test point in a particular class in the form of a deterministic real number and the class corresponding to the maximum positive number is assigned to the test point. Say, Y
∈
[
1,2
,
…
.
,
M
] and, using our case as an example, M
=
3, then the class of ξ
Test, given by Y
ξ
test, would be given by
(10)
Y
ξ
test
=
1
if
π
=
u
n
a
1
(
ξ
Test
)
,
Y
ξ
test
=
2
if
π
=
u
n
a
2
(
ξ
Test
)
,
Y
ξ
test
=
3
if
π
=
u
n
a
3
(
ξ
Test
)
,
where π
=
max
⁡
(
u
n
a
1
(
ξ
Test
)
,
u
n
a
2
(
ξ
Test
)
,
u
n
a
3
(
ξ
Test
)
).Ties among the classifiers are broken randomly. To implement uncertainty sampling with SFA, the user takes the following steps.(1)
Choose a class. Label all the members of this class as 1 and the members of all the other classes as −1.
(2)
Initiate the algorithm with the labels of the training data:r
0
=
{
F
[
u
(
ξ
1
)
]
,
…
,
F
[
u
(
ξ
s
)
]
}.
(3)
Search the components ofr
n
-
1 for the maximum magnitude. Record the component index j
*.
(4)
Considerξ
n
*
=
ξ
j
*.
(5)
Withϕ
n centered at ξ
n
*, minimize (8) to solve for the optimization parameter with α
n.
(6)
Calculate the coefficientsc
n and b
n from (6) and (7), respectively.
(7)
Update the residual vectorr
n
=
r
n
-
1
-
c
n
(
ϕ
n
+
b
n
). Repeat steps 3 to 6 until the termination criterion max
⁡
|
r
n
|
≤
1.0 has been met.
(8)
Use the constructed binary classifier to predict the test set.
(9)
Repeat steps 1 to 7 for the remaining classes.
(10)
Useone versus all scheme to obtain the final prediction on the test set.Our binary method is linear in storage with respect to s since it needs to store only s
+
s
d vectors to compute the residuals: one vector of length s
(
r
n
) and s vectors of length d
(
ξ
1
,
…
,
ξ
s
) where s is the number of samples and d is the number of dimensions. Completing the SFA model requires two vectors of length n
(
{
c
1
,
…
,
c
n
} and {
b
1
,
…
,
b
n
}
) and n vectors of length n
+
1
{
α
1
,
…
,
α
n
}.


### 2.3. Uncertainty Sampling with SFA

Say we are given a set ofd
-dimensional input data points ξ and outputs Y
∈
[
1,2
,
…
.
,
M
], where M is the number of classes. In binary classification tasks, the output can only take two possible values (−1 or +1). A straightforward way to compute the expected error from the addition of a point ξ to the training set is to calculate
(11)
E
ξ
=
P
(
Y
=
1
∣
ξ
)
·
E
(
ξ
,
Y
=
1
)
+
P
(
Y
=
-
1
∣
ξ
)
·
E
(
ξ
,
Y
=
-
1
)
.
Equation (11) calculates the overall expected error on a test set when a data point ξ is added to the training set with output +1 or −1. P
(
Y
=
1
∣
ξ
) and P
(
Y
=
-
1
∣
ξ
) are the posterior probabilities that the label of the training point ξ is +1 and −1, respectively. Even though this approach is straightforward, it is computationally expensive. In binary classification, this computation can be avoided by selecting a data point that lies in the vicinity of the classification boundary. A point lying close to the class discrimination boundary is guaranteed to have an effect on the approximation of the discriminant function. Selecting unlabeled samples that lie in the vicinity of the discriminant boundary falls under the category of uncertainty sampling. Even though US does not optimize an information gain criterion, it has been proven to be effective in many practical applications [24, 25]. Uncertainty sampling bears similarities with the query by committee [26] approach where disagreement between the members of a committee of classifiers is evaluated to choose an unlabeled sample for labeling. The active learning scheme applied to the cavity problem can be schematically represented in Figure 6. Once a final training set has been constructed, the final form of the discriminant function can be constructed to predict labels in real time.Figure 6
Schematic representation of active learning.For algorithms like SFA that construct their approximations in the form of (2), points that lie in the vicinity of the classification boundary can be found by looking at the minimum absolute value of the argument of the proxy function. To implement uncertainty sampling with SFA, the following steps need to be followed.(1)
Use a Design of Experiment method like LHS technique to pick a small number of initial training points to begin the active data collection procedure.
(2)
Conduct training and evaluate the classifier on a pool of unlabeled samples.
(3)
Usingu
n
a, determine the test point that bears the minimum absolute value of the argument of the proxy function. Multiple points can also be selected in a similar manner.
(4)
Add the chosen unlabeled samples to the training set and remove them from the pool of the unlabeled samples.
(5)
Repeat steps 2 through 4 until the pool of labeled samples is exhausted.The application of this heuristic with SFA is demonstrated on the following simulated classification problem given in
(12)
u
(
ξ
)
=
sign
⁡
[
y
-
x
2
]
where
0
≤
x
,
y
≤
1
.
The classifier was trained on one-half of the available points and tested on the remainder. Percentage accuracy was calculated by (13) shown below:
(13)
Percentage
accuracy
=
(
N
test
-
m
test
N
test
)
×
100
%
,
where N
test = number of points in the test set and m
test
= number of misclassifications. Results shown in Figure 7 were obtained by using SFA in conjunction with uncertainty sampling to select new samples for labeling. The red and the blue curves in Figure 7(a) show the increasing percentage prediction accuracy on a fixed test set (100 points) as training points were incremented sequentially using active learning and random sampling, respectively. Initial approximations for both sampling strategies were constructed using ten points chosen by LHS design and two points were chosen at a time for labeling from a pool of 400 regularly spaced grid points. This process was repeated 50 times to eliminate any bias due to the choice of the initial set of training points. Figure 7(a) shows mean percentage prediction accuracy computed over 50 permutations. Error bars show the standard error. Figure 7(b) shows the location of the data points chosen by the active learning scheme in one of the permutations. The active learning scheme clearly performs better than random sampling. Since we have an unlimited supply of unlabeled data points, the learning curves for active and passive learning do not converge.(a) Mean percentage classification accuracy versus number of training points. Error bars show standard error. (b) Crosses represent the training points chosen by the active learning scheme, and solid line is the class discrimination boundaryy
=
x
2
.
(a)
(b)As previously mentioned, multiclass classification problems are commonly attempted by combining several binary classifiers with aone versus all orone versus one approach. Selecting data points lying close to the classification boundaries in these problems would not be an optimal approach because one point could be informative for two classes but uninformative for the rest. A simple way to avoid this problem is to use the posterior probability estimates of the binary classifiers to pick a sample for labeling. According to uncertainty sampling, an informative sample would be one that has the lowest classification uncertainty. Several authors have suggested picking a sample for labeling that bears the minimum difference between the highest and the second highest posterior probability estimates [27, 28]. In this work, this method is used to select the next sample for labeling.SFA is a deterministic classifier that attempts to directly estimate the discriminant function of a binary classifier. Like Support Vector Machines (SVMs), SFA does not output posterior probabilities of a test point belonging to a particular class. Platt [29] introduced a method to directly train the parameters of a sigmoid function to map the deterministic SVM outputs into posterior probabilities. Several authors extended this notion to a softmax function for multiclass classification problems [30] given by
(14)
P
(
Y
=
k
ξ
i
)
=
P
k
i
=
exp
⁡
⁡
[
a
k
u
n
a
k
(
ξ
i
)
+
b
0
,
k
]
∑
j
=
1
M
exp
⁡
⁡
[
a
j
u
n
a
j
(
ξ
i
)
+
b
0
,
j
]
.
Here, u
n
a
k is the real valued output of the k
th binary classifier at ξ
i, and a
k and b
0
,
k are parameters of the softmax function. The parameters of the softmax function are determined by maximizing the following log-likelihood function given in
(15)
max
⁡
a
k
,
b
0
,
k
∑
i
=
1
s
log
⁡
[
P
k
i
]
.


## 2.1. Classification

In statistics, classification of a data set involves the construction of a discriminant functionF, which then predicts the labels of the unlabeled data set as accurately as possible. In constructing the discriminant function, one makes the assumption that all of the samples are independent and identically distributed under the same probability distribution function. Unfortunately, this problem is not trivial for a real world data set since the probability distribution from which the samples are drawn is unknown. A number of classification tools, in statistics and function approximation theory, exist in the literature for real world problems and are discussed and compared in detail in [14]. Scattered data function approximation techniques in machine learning are also used to model either the discriminant function directly or the multidimensional manifold that separates the classes (e.g., separating hyper planes from the classic form of Support Vector Machines (SVMs)).In using scattered data approximation, we assume the discriminant itself is continuous but can only be measured in discrete values (the proxy function). The SFA tool used in this paper attempts to model the underlying functionu directly. Given a set of d-dimensional input data points ξ
∈
R
d and noting that a function can be arbitrarily well-approximated by a linear combination of basis functions ϕ, we only require that the approximation fit the scattered data within accepted tolerance; that is,
(1)
∑
i
=
1
s
∥
F
[
u
(
ξ
i
)
]
-
u
n
a
(
ξ
i
)
∥
2
≤
s
2
τ
2
,
where F
[
u
(
ξ
i
)
] is the user defined label of the output, u
(
ξ
i
) is the true underlying function, and u
n
a
(
ξ
i
) in (2) is the approximated solution, where
(2)
u
n
a
(
ξ
)
=
∑
j
=
1
n
c
j
(
ϕ
j
(
ξ
,
β
j
)
+
b
j
)
.
The values of the coefficients c
j and b
j and the kernel parameters β
j are determined by an optimization routine on the training set. This makes the performance of a classifier dependent on the number and quality of data points available.Traditionally, Design of Experiment (DOE) methods like the LHS technique are used to obtain input parameter combinations at which experiments are conducted to obtain outputs which are classified by an oracle to obtain their labels. LHS design methods sample data points such that they are uniformly distributed throughout the input space. They do not take into account the functional relationship between the inputs and the output. However, in many real world problems, the output variance is significant in only a limited region of the input domain. In classification problems, output variance is present only at the class discrimination boundaries. LHS designs in these cases might result in sampling data points from regions which are uninformative. This becomes a significant limitation, especially in problems where either the experiment is costly or the labeling process is tedious or both. To avoid the inefficient use of resources, we focus on sampling the data set utilizing active learning techniques which take into account the input-output functional relationship.


## 2.2. Active Learning for Classification Problems

In passive learning, as the number of training points of a learning algorithm is increased, the information gained per training sample gradually decreases [11]. To avoid this problem, one can estimate the uncertainty of the learning algorithm on different regions of the input domain and sample data points from the most uncertain regions of the domain. For nonlinear discriminant functions (F
[
v
]), data sampling by active learning is essentially sequential in nature. The active learning sampling scheme is as good as the model of F
[
v
] itself. If the model has biases, the chosen data will not be optimal. In real world problems, it is often difficult to determine the true nature of the input-output model (i.e., linear, exponential, and quadratic). However, we can use universal approximators like radial basis functions (RBFs) that automatically address the bias problem because of their smoothness and differentiability. The active learning scheme scans through the input domain to look for regions in which the learning algorithm is least confident. This can be computationally expensive if the number of input dimensions is excessively large. However, this can be addressed through optimum experiment design [15] approaches.An active learning scheme requires a learning algorithm to construct approximations of the input-output mapping. The desired learning algorithm should be able to construct a rough approximation of the hypersurface using only a few scattered data points. More importantly, the chosen learning algorithm should be computationally efficient since training and testing will need to be repeated every time a new set of unlabeled samples is added to the training set. This makes the use of grid search and cross-validation approaches for control and kernel parameter optimization computationally infeasible for active learning problems. This is the motivation of the authors in using the self-adaptive and greedy SFA algorithm, with uncertainty sampling, in this work. SFA was developed from mesh-free finite element research but shares similarities with the boosting [16] and matching pursuit [17] algorithms. It was later used to provide kernel based solutions to regression [9] and classification problems [6, 7, 10]. We start our approximation of u utilizing the RBF (ϕ):
(3)
ϕ
(
ξ
,
β
i
)
=
exp
⁡
[
-
(
ξ
-
ξ
i
*
)
·
(
ξ
-
ξ
i
*
)
σ
i
2
]
=
exp
⁡
[
ln
⁡
[
α
i
]
(
ξ
-
ξ
i
*
)
·
(
ξ
-
ξ
i
*
)
]
for
0
<
α
i
<
1
,
where β
i
=
{
α
i
,
ξ
i
*
}
∈
R
d
+
1 represents the ith basis function parameters, the width α
i, and the center ξ
i
*
∈
R
d. We write the RBF as (3) in order to set up the optimization problem for α
i as a bounded nonlinear line search instead of an unconstrained minimization problem. The basic principles of our greedy algorithm are motivated by the similarities between the iterative optimization procedures of Jones [18, 19] and Barron [20] and the method of weighted residuals (MWR), specifically the Galerkin method [21]. We can write the function residual r at the nth stage of approximation as in
(4)
r
n
=
F
[
u
(
ξ
)
]

-

u
n
a
(
ξ
)
=
F
[
u
(
ξ
)
]
-
u
n
-
1
a
(
ξ
)

-

c
n
(
ϕ
(
ξ
,
β
n
)

+

b
n
)
=
r
n
-
1
-
c
n
(
ϕ
(
ξ
,
β
n
)
+
b
n
)
=
r
n
-
1
-
c
n
(
ϕ
n
+
b
n
)
.
Using the Petrov-Galerkin approach, we select a coefficient c
n that will force the function residual to be orthogonal to the basis function and b
n using the discrete inner product given by
(5)
∑
j
=
1
s
r
n
(
ξ
j
)
(
ϕ
n
(
ξ
i
)
+
b
n
)
=
〈
r
n
,
(
ϕ
n
+
b
n
)
〉
D
=
-
〈
r
n
,
∂
r
n
∂
c
n
〉
D
=
-
1
2
∂
〈
r
n
,
r
n
〉
D
∂
c
n
=
0
which is equivalent to selecting a value of c
n that will minimize 〈
r
n
,
r
n
〉
D or
(6)
c
n
=
(
s
〈
ϕ
n
,
r
n
-
1
〉
D
-
〈
r
n
-
1
〉
D
〈
ϕ
n
〉
D
)
(
s
〈
ϕ
n
,
ϕ
n
〉
D
-
〈
ϕ
n
〉
D
〈
ϕ
n
〉
D
)
with
(7)
b
n
=
(
〈
r
n
-
1
〉
D
〈
ϕ
n
,
ϕ
n
〉
D
-
〈
ϕ
n
〉
D
〈
ϕ
n
,
r
n
-
1
〉
D
)
(
s
〈
ϕ
n
,
r
n
-
1
〉
D
-
〈
r
n
-
1
〉
D
〈
ϕ
n
〉
D
)
.
The discrete inner product 〈
r
n
,
r
n
〉
D, which is equivalent to the square of the discrete L
2 norm, can be rewritten, with the substitution of (6) and (7), as
(8)
∑
j
=
1
s
r
n
(
ξ
j
)
r
n
(
ξ
j
)
=
∥
r
n
∥
2
,
D
2
=
〈
r
n
,
r
n
〉
D
=
〈
r
n
-
1
-
〈
r
n
-
1
〉
D
s
,
r
n
-
1
-
〈
r
n
-
1
〉
D
s
〉
D
×
(
1
-
(
〈
r
n
-
1
-
〈
r
n
-
1
〉
D
s
,
ϕ
n
-
〈
ϕ
n
〉
D
s
〉
D
2
v
v
v
v
v
v
v
v
v
v
v
v
v
v
×
(
-
〈
r
n
-
1
〉
D
s
〉
D
)
-
1
)
〈
ϕ
n
-
〈
ϕ
n
〉
D
s
,
ϕ
n
-
〈
ϕ
n
〉
D
s
〉
D
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
×
〈
r
n
-
1
-
〈
r
n
-
1
〉
D
s
,
r
n
-
1
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
v
-
〈
r
n
-
1
〉
D
s
〉
D
-
〈
r
n
-
1
〉
D
s
〉
D
)
-
1
)
〈
ϕ
n
-
〈
ϕ
n
〉
D
s
,
ϕ
n
-
〈
ϕ
n
〉
D
s
〉
D
)
-
1
)
)
.
The dimensionality of the nonlinear optimization problem is kept low since we are solving only one basis at a time. Also, Meade Jr. and Zeldin [22] showed that for bell-shaped basis functions
(9)
∥
r
n
∥
2
2
≅
〈
r
n
,
r
n
〉
D
=
exp
⁡
[
κ
1
-
κ
2
n
]
,
where
n
≥
2
for positive constants κ
1 and κ
2. Equation (9) shows, for optimal convergence, the logarithm of the inner product of the residual as a linear function of the number of bases (n), which establishes an exponential convergence rate that is independent from the number of input dimensions. Though the SFA scheme allows the basis center (ξ
n
*) to be located anywhere in R
d, the practical application to problems with multiple inputs constrains the centers to the set of sample points {
ξ
1
,
…
,
ξ
s
}. At each stage, we determine ξ
n
* such that |
r
n
-
1
(
ξ
n
*
)
|
=
max
⁡
|
r
n
-
1
|. The remaining optimization variable α
n is continuous and constrained to 0
<
α
n
<
1.The algorithm terminates whenmax
⁡
|
r
n
|
≤
τ, where τ is the tolerance desired by the user. For binary classification, where F
[
u
]
=
+
1 or -
1, we set τ
=
1.0 and the approximation output is computed as sign
⁡
[
u
n
a
(
ξ
)
]. In this work, our multiclass classification problem is tackled by applying three binary classifiers in parallel. Approaches to combining binary classifiers include theone versus one combination, theone versus all pairing, and the error correcting output coding. There is no best approach to combining binary classifiers. Even thoughone versus all has its own shortcomings, this approach was selected by the authors because of its simplicity and acceptable accuracy. Rifkin and Klautau [23] compared theone versus all approach to other existing methods and concluded thatone versus all classification will produce results as good as any other approach if the underlying classifiers are well tuned. In a standardone versus all formulation applied to a multiclass classification task, M binary classifiers are constructed where M is the number of classes in the data set. Each classifier predicts the presence of a test point in a particular class in the form of a deterministic real number and the class corresponding to the maximum positive number is assigned to the test point. Say, Y
∈
[
1,2
,
…
.
,
M
] and, using our case as an example, M
=
3, then the class of ξ
Test, given by Y
ξ
test, would be given by
(10)
Y
ξ
test
=
1
if
π
=
u
n
a
1
(
ξ
Test
)
,
Y
ξ
test
=
2
if
π
=
u
n
a
2
(
ξ
Test
)
,
Y
ξ
test
=
3
if
π
=
u
n
a
3
(
ξ
Test
)
,
where π
=
max
⁡
(
u
n
a
1
(
ξ
Test
)
,
u
n
a
2
(
ξ
Test
)
,
u
n
a
3
(
ξ
Test
)
).Ties among the classifiers are broken randomly. To implement uncertainty sampling with SFA, the user takes the following steps.(1)
Choose a class. Label all the members of this class as 1 and the members of all the other classes as −1.
(2)
Initiate the algorithm with the labels of the training data:r
0
=
{
F
[
u
(
ξ
1
)
]
,
…
,
F
[
u
(
ξ
s
)
]
}.
(3)
Search the components ofr
n
-
1 for the maximum magnitude. Record the component index j
*.
(4)
Considerξ
n
*
=
ξ
j
*.
(5)
Withϕ
n centered at ξ
n
*, minimize (8) to solve for the optimization parameter with α
n.
(6)
Calculate the coefficientsc
n and b
n from (6) and (7), respectively.
(7)
Update the residual vectorr
n
=
r
n
-
1
-
c
n
(
ϕ
n
+
b
n
). Repeat steps 3 to 6 until the termination criterion max
⁡
|
r
n
|
≤
1.0 has been met.
(8)
Use the constructed binary classifier to predict the test set.
(9)
Repeat steps 1 to 7 for the remaining classes.
(10)
Useone versus all scheme to obtain the final prediction on the test set.Our binary method is linear in storage with respect to s since it needs to store only s
+
s
d vectors to compute the residuals: one vector of length s
(
r
n
) and s vectors of length d
(
ξ
1
,
…
,
ξ
s
) where s is the number of samples and d is the number of dimensions. Completing the SFA model requires two vectors of length n
(
{
c
1
,
…
,
c
n
} and {
b
1
,
…
,
b
n
}
) and n vectors of length n
+
1
{
α
1
,
…
,
α
n
}.


## 2.3. Uncertainty Sampling with SFA

Say we are given a set ofd
-dimensional input data points ξ and outputs Y
∈
[
1,2
,
…
.
,
M
], where M is the number of classes. In binary classification tasks, the output can only take two possible values (−1 or +1). A straightforward way to compute the expected error from the addition of a point ξ to the training set is to calculate
(11)
E
ξ
=
P
(
Y
=
1
∣
ξ
)
·
E
(
ξ
,
Y
=
1
)
+
P
(
Y
=
-
1
∣
ξ
)
·
E
(
ξ
,
Y
=
-
1
)
.
Equation (11) calculates the overall expected error on a test set when a data point ξ is added to the training set with output +1 or −1. P
(
Y
=
1
∣
ξ
) and P
(
Y
=
-
1
∣
ξ
) are the posterior probabilities that the label of the training point ξ is +1 and −1, respectively. Even though this approach is straightforward, it is computationally expensive. In binary classification, this computation can be avoided by selecting a data point that lies in the vicinity of the classification boundary. A point lying close to the class discrimination boundary is guaranteed to have an effect on the approximation of the discriminant function. Selecting unlabeled samples that lie in the vicinity of the discriminant boundary falls under the category of uncertainty sampling. Even though US does not optimize an information gain criterion, it has been proven to be effective in many practical applications [24, 25]. Uncertainty sampling bears similarities with the query by committee [26] approach where disagreement between the members of a committee of classifiers is evaluated to choose an unlabeled sample for labeling. The active learning scheme applied to the cavity problem can be schematically represented in Figure 6. Once a final training set has been constructed, the final form of the discriminant function can be constructed to predict labels in real time.Figure 6
Schematic representation of active learning.For algorithms like SFA that construct their approximations in the form of (2), points that lie in the vicinity of the classification boundary can be found by looking at the minimum absolute value of the argument of the proxy function. To implement uncertainty sampling with SFA, the following steps need to be followed.(1)
Use a Design of Experiment method like LHS technique to pick a small number of initial training points to begin the active data collection procedure.
(2)
Conduct training and evaluate the classifier on a pool of unlabeled samples.
(3)
Usingu
n
a, determine the test point that bears the minimum absolute value of the argument of the proxy function. Multiple points can also be selected in a similar manner.
(4)
Add the chosen unlabeled samples to the training set and remove them from the pool of the unlabeled samples.
(5)
Repeat steps 2 through 4 until the pool of labeled samples is exhausted.The application of this heuristic with SFA is demonstrated on the following simulated classification problem given in
(12)
u
(
ξ
)
=
sign
⁡
[
y
-
x
2
]
where
0
≤
x
,
y
≤
1
.
The classifier was trained on one-half of the available points and tested on the remainder. Percentage accuracy was calculated by (13) shown below:
(13)
Percentage
accuracy
=
(
N
test
-
m
test
N
test
)
×
100
%
,
where N
test = number of points in the test set and m
test
= number of misclassifications. Results shown in Figure 7 were obtained by using SFA in conjunction with uncertainty sampling to select new samples for labeling. The red and the blue curves in Figure 7(a) show the increasing percentage prediction accuracy on a fixed test set (100 points) as training points were incremented sequentially using active learning and random sampling, respectively. Initial approximations for both sampling strategies were constructed using ten points chosen by LHS design and two points were chosen at a time for labeling from a pool of 400 regularly spaced grid points. This process was repeated 50 times to eliminate any bias due to the choice of the initial set of training points. Figure 7(a) shows mean percentage prediction accuracy computed over 50 permutations. Error bars show the standard error. Figure 7(b) shows the location of the data points chosen by the active learning scheme in one of the permutations. The active learning scheme clearly performs better than random sampling. Since we have an unlimited supply of unlabeled data points, the learning curves for active and passive learning do not converge.(a) Mean percentage classification accuracy versus number of training points. Error bars show standard error. (b) Crosses represent the training points chosen by the active learning scheme, and solid line is the class discrimination boundaryy
=
x
2
.
(a)
(b)As previously mentioned, multiclass classification problems are commonly attempted by combining several binary classifiers with aone versus all orone versus one approach. Selecting data points lying close to the classification boundaries in these problems would not be an optimal approach because one point could be informative for two classes but uninformative for the rest. A simple way to avoid this problem is to use the posterior probability estimates of the binary classifiers to pick a sample for labeling. According to uncertainty sampling, an informative sample would be one that has the lowest classification uncertainty. Several authors have suggested picking a sample for labeling that bears the minimum difference between the highest and the second highest posterior probability estimates [27, 28]. In this work, this method is used to select the next sample for labeling.SFA is a deterministic classifier that attempts to directly estimate the discriminant function of a binary classifier. Like Support Vector Machines (SVMs), SFA does not output posterior probabilities of a test point belonging to a particular class. Platt [29] introduced a method to directly train the parameters of a sigmoid function to map the deterministic SVM outputs into posterior probabilities. Several authors extended this notion to a softmax function for multiclass classification problems [30] given by
(14)
P
(
Y
=
k
ξ
i
)
=
P
k
i
=
exp
⁡
⁡
[
a
k
u
n
a
k
(
ξ
i
)
+
b
0
,
k
]
∑
j
=
1
M
exp
⁡
⁡
[
a
j
u
n
a
j
(
ξ
i
)
+
b
0
,
j
]
.
Here, u
n
a
k is the real valued output of the k
th binary classifier at ξ
i, and a
k and b
0
,
k are parameters of the softmax function. The parameters of the softmax function are determined by maximizing the following log-likelihood function given in
(15)
max
⁡
a
k
,
b
0
,
k
∑
i
=
1
s
log
⁡
[
P
k
i
]
.


## 3. Results

A total of 267 wind tunnel runs were conducted by Tracy and Plentovich  [1] with the resulting data plotted in Figure 5. Percentage errors were computed in the same manner as that presented in the previous section. The error convergence graphs shown in Figure 8 were obtained by increasing the number of training points and testing the constructed networks on all 267 test points. We compared the misclassification error rate of SFA with training points chosen by US against training points chosen by LHS design. The purpose of this comparison was to demonstrate that the active machine learning algorithm achieves better generalization ability, that is, better cavity flow type prediction accuracy with fewer training points. We treat the current problem as a 3-class classification problem and focus on generating optimal M
∞ and l
/
h combinations for each w
/
h. We do not focus on determining optimal w
/
h ratio because of its insufficient resolution in the available data.Mean cavity flow type prediction accuracy of active and passive learning at (a)w
/
h
=
1, (b) w
/
h
=
4, and (c) w
/
h
=
8. Error bars show the standard error.
(a)
(b)
(c)The active machine learning algorithm initially needs a few training points to construct a hypersurface to determine the most uncertain data points. There is no principled approach to determine the optimum number of initial points, so we used 20 initial points to start the active learning procedure. In addition, a heuristic approach to choose an initial number of training points is validated because by construction the active learning scheme adds points that correspond to maximum information gain which leads to low errors of the metamodel only with a few carefully selected points. In other words, the initial number of training points has no effect on the rate of convergence of the active learning scheme. These points were chosen by the LHS method on two dimensionsM
∞ and l
/
h. To eliminate any biases due to the randomness in the LHS designs, we repeated the training and testing 50 times. Two points were added to the training set each time and the active data selection process continued until all of the available points were used. This approach allows the user to choose a single point or a batch of points per iteration. We decided to add two points per iteration to save computational time spent to complete 50 random permutations used to eliminate bias in the results.Figure8 shows that active learning clearly outperforms the passive LHS technique at all three w
/
h ratios. Active learning accuracy increases sharply and then gradually converges with LHS classification accuracy as unlabeled samples are exhausted. With 40 training data points at w
/
h
=
1, active learning has a classification accuracy of 97
±
0.2%, while LHS has 93
±
0.3%. This means that if the user decides to conduct 40 wind tunnel runs at w
/
h
=
1, then actively sampling input configurations by the US technique would result in data that has more information than data sampled passively by the LHS technique. Training data sampled from critical regions of the input-output hyperspace give more generalization ability to SFA than the training data sampled just from the input space.The only disadvantage US based active learning has compared to passive LHS technique is its greater computational expense. In this problem, the active learning scheme took only a few minutes longer compared to the passive learning scheme. However, the relatively high cost of wind tunnel testing more than justifies the increased computational cost. The active learning curve forw
/
h
=
1 flattens out at about 35 training points because the US algorithm chooses almost all of the points lying close to the classification boundaries in the first 8 iterations. Table 1 shows cavity flow type classification accuracy of SFA, using half of the data points for training, sampled by the US and LHS techniques.Table 1
Comparison of classification accuracies.
w
/
h
Number of training points
LHS (%)
US (%)
1
38
94
±
0.3
97
±
0.2
4
46
88
±
0.4
95
±
0.3
8
44
90
±
0.4
95
±
0.3


## 4. Conclusions

This paper has demonstrated that active machine learning tools can be used to design wind tunnel runs to measure unsteady pressure measurements in a cavity flow classification problem. We propose that a machine learning tool be used in conjunction with wind tunnel testing to guide the data collection procedure. We believe that a mathematical tool that samples data using the input-output relationship should be more effective than a tool that just samples data from the input domain. Such a technique can save wind tunnel testing time and cost at relatively little computational expense. In particular, we demonstrated the use of SFA with the uncertainty sampling technique on a multiclass cavity flow type prediction problem. Results were compared against passively collected data using the traditional LHS technique. We believe that active machine learning tools have the potential to help engineers to accelerate through wind tunnel testing by steering through the test matrix in an incremental and optimal manner.



---

*Source: 218710-2014-06-19.xml*