Journal of Systems Engineering and Electronics Vol. 21, No. 5, October 2010, pp.
827–834
Available online at www.jseepub.com
Air-combat behavior data mining based on
truncation method
Yunfei Yin1,2,∗ , Guanghong Gong2 , and Liang Han2
1. College of Computer Science, Chongqing University, Chongqing 400044, P. R. China;
2. School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, P. R. China
Abstract: This paper considers the problem of applying data min-
ing techniques to aeronautical field. The truncation method, which
is one of the techniques in the aeronautical data mining, can be
used to efficiently handle the air-combat behavior data. The tech-
nique of air-combat behavior data mining based on the truncation
method is proposed to discover the air-combat rules or patterns.
The simulation platform of the air-combat behavior data mining that
supports two fighters is implemented. The simulation experimental
results show that the proposed air-combat behavior data mining
technique based on the truncation method is feasible whether in
efficiency or in effectiveness.
Keywords: air-combat, truncation method, behavior mining, basic
fighter maneuvers (BFMs), data mining.
DOI: 10.3969/j.issn.1004-4132.2010.05.017
1. Introduction
1.1 Motivation
When the technique of data mining runs to a certain stage
(a certain degree), it will then develop to an infiltration
stage that uses the multi-disciplines. Air-combat behav-
ior data mining is then the infiltration from the data mining
technique to the military simulation field.
However, unfortunately, since the features of air-combat
behavior data itself make the conventional data mining
techniques unable to be applied to the process of the air-
combat behavior data mining, directly. More than that, the
mined results of the conventional association rule mining
are also not suitable for the air-combat behavior tactical
decision.
This then requires us to design a new mining method
according to the features of air-combat behavior data and
the basic principle of data mining, so that the data min-
ing techniques can be effectively applied to the air-combat
behavior simulation.
Therefore, our motivation is to investigate the air-
combat behavior data mining, and further propose an air-
Manuscript received February 18, 2009.
*Corresponding author.
combat behavior data mining based on truncation method.
Finally, we implement the experiment platform and vali-
date this method by experiments.
1.2 Related work
The pertinent literature of this study mainly focus on: (a)
the fighter’s behavior analysis; (b) complex data process-
ing; (c) association rule mining.
For the fighter’s behavior analysis, Ju et al. proposed an
intelligent strategy combing fuzzy logic control and pursuit
guidance used in the automatic flight maneuvers, and con-
ducted the simulation experiments to show the automatic
flying of the aircraft by following an optical payload [1].
Bergmann et al. developed a combined motion (maneuver)
test capability, and tested the different modes of oscillatory
motions [2]. Morelli et al. presented a statistically-based
method to analyze the flight data in flight simulators and
used some prediction cases to show the effectiveness of the
proposed method [3]. Groen et al. presented a pilot per-
ception model based on a series of decrab maneuvers, and
used the subjective data to validate this model [4]. Sachs
et al. described an improvement for the predictor used in
a tunnel display presenting guidance information in a 3-
dimensional format, and conducted some simulation ex-
periments to validate the improvement [5].
With regard to the complex data processing, Burda et
al. proposed a hierarchical specification that allowed to
break down a complex data structure into a set of submod-
els with the desired features that were naturally assembled
in the original system, and applied the model to the super-
market choices [6]. Gagné et al. presented a robust esti-
mation and prediction in multivariate autoregressive mod-
els with exogenous variables, and tested several scenarios
based on the finite sample properties of the robust predic-
tion intervals in simulation [7]. Zhang proposed an ap-
proach to learn from rich user specific information and to
satisfy complex user criteria under the graphical modeling
framework, and the experimental results that demonstrated
828 Journal of Systems Engineering and Electronics Vol. 21, No. 5, October 2010
this approach was helpful to better understand the com-
plex domain [8]. Gancarski et al. proposed two new fea-
ture weighting methods based on coevolutive algorithms
to process the complex data, and the experimental results
showed that the methods were better than the hill-climbing
based algorithms [9]. Wang et al. proposed an interval
finite element model to analyze the structural parameters,
and conducted the comparison between this model and the
stochastic finite element model [10].
As for the association rule mining, we mainly concern
the work related to the air-combat behavior mining. Ding
et al. proposed an approach to derive association rules
from spatial data using the Peano Count Tree structure,
and the experimental results showed that this approach
was superior for association rule mining [11]. Bilenko et
al. proposed to identify relevant information sources from
the history of combined searching and browsing behav-
ior of many web users, and the experimental evaluation
showed that this approach could yield accuracy improve-
ments [12]. Matake et al. applied multiobjective cluster-
ing with automatic k-determination to develop a scalable
data-clustering algorithm for web mining [13]. Agichtein
et al. proposed an approach of leveraging millions of past
user interactions with a web search engine to automatically
detect “best bet” top results preferred by the majority of
users, and conducted the experiments over millions of user
interactions for thousands of queries to validate this ap-
proach [14]. Tseng et al. proposed a data mining method
that could efficiently discover the mobile users’ sequen-
tial movement patterns associated with requested services,
and showed the excellent delivering performance of this
method in terms of accuracy, execution efficiency and scal-
ability through the empirical evaluation [15].
1.3 Contributions
In this paper, we investigate the air-combat behavior data
mining, and propose the technique of air-combat behavior
data mining based on the truncation method. The major
contributions are listed as follows.
(a) We propose the idea of air-combat behavior data
mining (including the problem description, definition, re-
search objects, mining methods, and so forth).
(b) We propose the truncation method to process the air-
combat behavior data.
(c) We implement the experiment platform of air-
combat behavior data mining, and discover the interesting
air-combat behavior rules or patterns.
2. Basic concepts and connotations
In this section, we will introduce some basic concepts and
connotations related to the air-combat behavior and data
mining.
(a) Basic fighter maneuvers (BFMs) BFMs are defined
as a group of valid serial maneuvering movements that
commonly are obtained in the long-term practice.
Common BFM has many types [16,17]. In this paper,
we select 13 types among all the types, which are “pur-
suit”, “quick pull”, ‘ ‘right pull”, “left pull”, “break de-
scend”, “fighting turn”, “high-speed Yo-Yo”, “low-speed
Yo-Yo”, “half-loop roll”, “flick half roll”, “quick hover”,
“speed-up turn”, and “level fly”. Correspondingly, we en-
code the 13 types of BFMs as 1, 2, . . . , 13, respectively.
One complex BFM can also be further decomposed into
several more basic sub-movements.
(b) Air-combat behavior data Air-combat behavior
data are an action stream composed by a serial of BFMs.
Example 1 Given two fighters have conducted two
groups of maneuvers, respectively, that is, A = {“quick
pull”, “quick pull”, “half-loop roll”, “quick pull”, “pur-
suit”, “level fly”}, and B = {“level fly”, “fighting turn”,
“right pull”, “break descend”, “break descend”}. Suppose
their emerging probabilities are identical, and then the cor-
responding air-combat behavior data can be expressed as
[2, 13, 2, 6, 9, 3, 2, 5, 1, 5, 13].
(c) Data mining Also called knowledge discovery in
database (KDD). It is a process extracting knowledge and
information that are latent and yet potentially useful from
the large, incomplete, with noise, fuzzy, random actual
data [18,19].
In the early 1990s, Usama M. Fayyad proposed the idea
of data mining. Later, Agrawal et al. proposed the associ-
ation rule mining algorithm [20], and Han et al. proposed
the FP-tree mining algorithm [21,22]. And these activi-
ties made the data mining developed rapidly and greatly
concerned by many different scholars. At present, data
mining has been found broad and deep applications in re-
tail trade, finance, manufacturing industry, communication
industry, physical culture, astronomy, irrigation works,
aviation and aerospace industry, network, medical service
and health, and so forth.
(d) Truncation method The truncation method is a way
transforming the air-combat behavior data into the conven-
tional transaction data and further to handle them.
Reference [23] also tentatively explored the issue using
the data mining techniques to handle the data in a military
intelligence database.
In this paper, we propose the truncation method to han-
dle the data in the air-combat simulation.
3. Air-combat behavior mining and trunca-
tion method
3.1 Problem description
The research objectives of the conventional data mining
are to discover the associated relationships between differ-
ent commodities. For example, A → B (Support, Confi-
Yunfei Yin et al.: Air-combat behavior data mining based on truncation method
dence) denotes the commodity A implicates the commod-
ity B, where the support of the implication is “Support”,
and the confidence of the implication is “Confidence”. If
we consider the matter from different angles, we can easily
find that the conventional data mining also reflects the as-
sociated relationships between the shopping behaviors of
the customers. For example, in the above-mentioned ex-
ample, the associated relationship denotes that if the cus-
tomer buys commodity A, then he will buy the commodity
B, where the support and the confidence are “Support” and
“Confidence”, respectively.
We make the idea mining the associated relationships
between behaviors applied to the knowledge discovery of
air-combat behaviors, which purposes to discover the air-
combat associated behaviors, the air-combat tactical con-
frontation patterns, etc.
However, the data processed by the conventional data
mining are different with the air-combat behavior data, as
brings about new problems to the air-combat behavior data
mining.
Firstly, the conventional data processed by the conven-
tional data mining are transaction data, whose length is
relatively shorter. Whereas the air-combat behavior data
processed by the air-combat behavior data mining are the
maneuver sequences of the fighters during the course of the
tangling fighting each other, whose length often very long,
and whose lengths are often not equal for the different bel-
ligerent records.
Secondly, for the data processed by the conventional
data mining, the items in one record (one row) are usually
unrepeatable; whereas, for the air-combat behavior data,
the items (BFMs) in one record appear rather more repeat-
able. As shown in Fig. 1.
Thirdly, the data scale processed by the conventional
data mining is often very large; whereas the data scale pro-
cessed by the air-combat behavior data mining is relatively
less (since each record is correspondence with a long air-
combat process).
Example 2 shows the differences between the data pro-
cessed by the conventional data mining and the data pro-
cessed by the air-combat behavior data mining.
Example 2 The dataset D1 and the dataset D2
are used in the conventional data mining and the air-
combat behavior data mining, respectively, as shown
in Fig. 1.
Fig. 1 The conventional dataset and air-combat behavior dataset
829
In Fig. 1, “TID” represents transaction identification;
“Items bought” represents the commodities bought. “CID”
represents combat identification; “BFMs performed” rep-
resents the basic fighter maneuvers performed. Obviously,
from the figure we can see that there are more differences
between the air-combat behavior dataset and the conven-
tional dataset. So, the conventional data mining methods
can not be used to handle the air-combat behavior data, di-
rectly.
3.2 Air-combat behavior data mining
How to mine the experienced patterns we need from the
special air-combat behavior data, and apply them to the
air-combat simulation, as is our focal point to be discussed
in this section.
We propose the truncation method to process the air-
combat behavior data, and it is one of the methods to han-
dle this sort of data.
3.2.1 What’s air-combat behavior data mining
Air-combat behavior data mining is to mine the valuable
decision patterns from the air-combat behaviors.
Air-combat behavior data mining is the product com-
bining association rule mining techniques with air-combat
simulation techniques. Its purpose lies in: find the associ-
ation relationships between the fighters’ behaviors in air-
combat simulation, with the aid of data mining techniques;
and further conduct predictions for the behavior trends of
fighters. When one part finds that the other part is con-
ducting certain maneuver at certain moment, he can predict
and decide a follow-up maneuvers according to the mined
association rules. Thus, he can easily take the favorable
countermeasures (maneuvers).
Since the mined rules are ripe experienced patterns, un-
der normal conditions, they are the best confrontation tac-
tics (plan). And this case is like the ponderation and pre-
diction in playing a game of chess. For example, in order to
defense the maneuver A, there are three maneuvers could
be chosen, viz., B1 , B2 , B3 , and the produced possible ef-
fects of the three maneuvers are poor, common and good,
respectively; then the rule we want to discover is A → B3
instead of A → B1 and A → B2 .
So, when we use the rules to conduct prediction and
control, generally speaking, their produced beneficial re-
sults are better. In other words, when the antecedent of
the rule is predicted, the consequent of the rule should be
chosen to execute. Otherwise, if other maneuvers are used,
the effects they produced will be worse than the effects the
consequent of the rule produced. This is the theoretical
basis of the air-combat behavior data mining.
Example 3 Given that the Fighter 1 and the Fighter 2
are in certain situation, and the future maneuvers of the
830 Journal of Systems Engineering and Electronics Vol. 21, No. 5, October 2010
Fighter 1 have been mined (as rules): R = {A → B,
B → C, C → D}. And there are three enforceable plans
for the Fighter 1, where the first one is to conduct accord-
ing to the rules, whereas the second and the third ones are
to conduct randomly and not in accordance with the rules,
as shown in Fig. 2.
Fig. 2 Different maneuvers produce different effects
In Fig. 2, the Fighter 1 altogether conducts three maneu-
vers (scenarios): I, II, III, where the first one is to conduct
according to the mined rules, the second one is to conduct
partially according to the mined rules and partially not ac-
cording to the mined rules, and the third one is to conduct
complete not according to the mined rules. Obviously, the
effect produced by the first plan is the best, and it guar-
antees the continuation of the air-combat, and the effects
produced by the second and the third plans are worse—it
leads to the Fighter 1 is hit by the Fighter 2 (imagination).
Therefore, so long as the rules are guaranteed to be the
best pair, they can be then used to predict and control the
air-combat. Since, in the air-combat, if the other side does
not adopt the maneuvers in the consequences of the rules,
actually, it will be in a harmful situation (the case is like the
predictions between the opponents in a chess tournament).
3.2.2 Research object of air-combat behavior data mining
There are two types for the air-combat behavior data min-
ing: one is the case that the dataset is made up from the
air-combat behavior streams of one fighter (named by type-
I air-combat behavior data mining); the other is the case
that the dataset is made up from the air-combat behavior
streams of more than one fighters (named by type-II air-
combat behavior data mining).
With regard to the former, we make the fighters con-
duct the air-combat simulation, and collect the behavior
data (the conducted maneuvers) of single fighter during the
course of air-combat. Correspondingly, we call the col-
lected behavioral dataset as type-I dataset.
Example 4 Given two Fighters A, B conduct air-
combat simulation, and the maneuvers they conducted
are: MA = “quick pull”, “quick hover”, “speed-up turn”,
“break descend”, “break descend”, “flick half roll”, “break
descend”, “low-speed Yo-Yo”, “right pull”, “high-speed
Yo-Yo”, “left pull”, “break descend”,. . . ; MB = “speed-
up turn”, “pursuit”, “quick pull”, “half-loop roll”, “break
descend”, “flick half roll”, “speed-up turn”, “speed-up
turn”, “level fly”, “high-speed Yo-Yo”, “fighting turn”,
“left pull”, “half-loop roll”, respectively, then the first kind
of dataset (type-I dataset) collected is (we take Fighter A
as the research object)
DI = {2, 11, 12, 5, 5, 11, 10, 5, 8, 3, 7, 4, 5, . . . }
With regard to the latter, we also make all the Fighters
conduct air-combat simulation, and collect the behaviors
of all the fighters in the course of air-combat. Where any
behavior all meets the following structure definition:
Struct FB { //Fighter behavior
FighterID;//Fighter 1, Fighter 2, . . .
ManeuverNo; //Viz., 1, 2, . . . , 13
}
So, in this case, the research object (dataset) is the data
stream made up from the Struct FB. Correspondingly, and
call the collected behavioral dataset as type-II dataset.
Example 5 For the data in Example 4, we may also
work out the second kind of dataset (type-II dataset) as fol-
lows.
DII = {{Fighter 1, 2}, {Fighter 2, 12},
{Fighter 1, 11}, {Fighter 2, 1}, {Fighter 2, 12},
{Fighter 1, 2}, {Fighter 2, 5}, {Fighter 1, 9},
{Fighter 2, 5}, {Fighter 1, 5}, {Fighter 2, 11},
{Fighter 1, 10}, {Fighter 2, 10}, {Fighter 1, 12},
{Fighter 2, 5}, {Fighter 1, 12}, {Fighter 2, 8},
{Fighter 1, 13}, {Fighter 2, 3}, {Fighter 1, 7},
{Fighter 2, 7}, {Fighter 1, 6}, {Fighter 2, 4},
{Fighter 1, 4}, {Fighter 2, 5}, {Fighter 1, 9}, . . . }
3.2.3 How to conduct air-combat behavior data mining
To conduct the air-combat behavior data mining, we will
accomplish three phases of work.
The first phase is to produce the two kinds of air-combat
behavior datasets, viz., type-I dataset and type-II dataset.
The second phase is to transform the two kinds of air-
combat behavior datasets by the truncation method.
The third phase is to conduct behavior mining.
In the first phase, we firstly operate the two-fighter dog-
fight program in the simulation platform that has been de-
veloped. During the course of the two-fighter air-combat,
we collect the behaviors (the maneuvers conducted) of
Yunfei Yin et al.: Air-combat behavior data mining based on truncation method
the two fighters themselves and store them into the type-
I dataset and the type-II dataset, respectively.
In the second phase, we utilize the truncation method
(see Section 3.3 for details) to transform the two kinds of
air-combat behavior datasets into pre-mining datasets.
In the third phase, we design a mining algorithm to han-
dle the pre-mining dataset that integrates the methods ap-
peared in [18,20−22] and also consider the characteristics
of the air-combat simulation.
In the following, we will discuss the truncation method
in details.
3.3 Truncation method
The truncation method is a way to process the air-combat
behavior data, and it is used to transform the original air-
combat behavior data into the common data format (pre-
mining data format) in the data mining field.
Just as discussed in Section 3.1, the data processed
by the conventional data mining are different with the
air-combat behavior data. Firstly, what the conventional
data mining processes is transaction data, whose lengths
are relatively shorter. Whereas the air-combat behavior
data are the maneuver sequences that are produced by the
fighters during the course of tangling fighting each other,
whose length often very long, and for different belliger-
ent records, their lengths are often not equal. Secondly,
for the data processed by the conventional data mining,
the items in one record (one row) are usually unrepeatable,
whereas, for the air-combat behavior data, the items in one
record are usually very repeatable. Thirdly, the data size
processed by the conventional data mining is often larger;
whereas the data size processed by the air-combat behavior
data mining is relatively less.
However, it is scope to exercise the truncation method.
Fig. 3 shows the handling procedure of the truncation
method (architecture).
Fig. 3 Handling procedure of the truncation method
In Fig. 3, the truncation method is in the central posi-
tion, which is used to transform the air-combat behavior
streams into the common data format; and then, by the be-
havior data mining, the final rules and patterns can then
be obtained. “Expected format” (shown in Fig. 3) denotes
the data format suitable for mining, assigned by experts or
users.
Algorithm 1 Data mining based on the truncation
method (DMTM)
831
Input: D, air-combat behavior dataset; gInterval, the in-
terval for truncating.
Output: FP, frequent patterns.
Method:
1) function Truncation (dataset D, int interval) {
2) RetD ← φ; //RetD is the return value of this function
3) for each record pStream∈ D {
4) while (pStream != NULL) {
5) for (int i = pStream− >curPos; i < interval; i++) {
6) item = ∪*(pStream +i);
7) }
8) if (item ∈ / RetD && ifRedundant (item)) // Judge
whether there is duplicated items
9) RetD ← item;
10) pStream− >curPos += interval;
11) }
12) }}
13) return RetD;
14) }
// Behavior data mining
15) C1 ← {Candidate 1-itemsets and their supports};
16) F1 ← {Frequent 1-itemsets and their supports};
17) for (i = 2; Fi−1 = φ; i++) {
18) gInterval++;
19) Ci ← Truncation(D, gInterval);
20) for each c in Ci
21) c.support ++;
22) Fi = {c ∈ Ck | c.support  minSupp * |D|}; //min-
Supp is the threshold for minimum supports
23) }
24) FP = ∪i Fi ;
In Algorithm 1, function Truncation is firstly designed
to truncate the given air-combat dataset. Function ifRe-
dundant (item) is used to judge whether there is duplicated
items in “item”, e.g., ifRedundant (2, 1, 1) = true, ifRe-
dundant (2, 2, 1) = true, ifRedundant (1, 3) = false. In
the behavior data mining, for generating any size frequent
itemsets, the function Truncation is needed to be called for
all.
Example 6 Given one air-combat data stream is {1, 2,
2, 1, 3, 3}, compare the conventional handling method and
the truncation method as shown in Fig. 4.
In Fig. 4, for the behavior data stream {1, 2, 2, 1, 3, 3},
the conventional data mining commonly ignores the du-
plicated items, and then processes them according to {1,
2, 3}. Whereas the truncation method makes the origi-
nal dataset truncated according to the principle of the air-
combat behavior data mining, and discovers the required
rules and patterns by it.
832 Journal of Systems Engineering and Electronics Vol. 21, No. 5, October 2010

Step 2 Then, record the runtime and the discovered

rules in each air-combat, and conduct the computations ac-
cording to the following evaluation formulae.
n

T = Ti (1)
i=1

where T is the runtime evaluation standard of the air-

combat program, and Ti denotes the runtime of the ith air-
combat. n

R= Ri (2)
i=1

where R is the evaluation standard of the mining results,

Fig. 4 Comparison between the conventional method and the trun- and Ri denotes the collected rule number of the ith air-
cation method combat.
Repeat Steps 1 and 2 to get multiple groups of (T, R),
The physics significance of the truncation method lies and compare and analyze the different (T, R).
in: it can discover the association relationships between We conducted the experiments of air-combat maneu-
the adjacent maneuvers of the fighters, as is suitable for ver associations of single fighter and the experiments of
the air-combat behavior predictions and judgments of the air-combat maneuver associations of two fighters, respec-
fighters. tively. Table 1 shows several groups of typical experimen-
3.4 Strongpoints of the truncation method tal results.
Table 1 The experiments of air-combat behavior data mining
The strongpoints of the truncation method to process the (minSupp = 0.22; minConf = 0.347)
air-combat behavior data are summarized as follows.
Air Dataset Fighters Rules Runtime
(a) The efficiency of the truncation method in process- Groups combats type* involved discovered /ms
ing the air-combat behavior data is higher. involved
(b) The truncation method can process the vector data, 1 27 I 1 16 47
for example, the data whose types are attributed to Struct 2 30 II 2 2 609
FB. 3 37 I 1 16 47
4 46 II 2 4 672
(c) The truncation method can discover the air-combat
5 98 I 1 8 62
behavior rules or patterns that are useful in air-combat.
6 103 II 2 2 1 703
(d) It is one of the techniques of aeronautical data min- 7 122 I 1 8 94
ing. 8 63 II 2 4 1 140
9 260 I 1 8 219
4. Experiments and assessments
10 85 II 2 2 1 422
We implemented the simulation platform of the air-combat 11 296 I 1 8 250
behavior data mining that supports two fighters. And the 12 152 II 2 2 3 203
experiments were conducted on the simulation platform
*The definitions of Dataset type (type-I and type-II) refers to Section
that was based on the one-fighter-to-one-thread (the princi-
3.2.2.
ple of multiple threads to simulate the fighters). The basic
hardware configurations of the experiments were: SUM- In Table 1, our experiments are used to validate the case
SUNG R18 laptop with Intel Pentium Dual Core CPU and of the associated behavior mining of a single fighter and
1 GB of RAM. The used software included MS Windows the case of the associated behavior mining of two fighters.
XP SP2 as the operating system; MS VStudio 2005 as the Our experimental data are collected from hundreds of air-
development tool; and a flight simulator as the testbed to combat simulations, and the data types collected involve
test the flying effects. the type-I dataset and the type-II dataset mentioned in Sec-
The evaluation standard to measure the efficiency and tion 3.2.2. The rules discovered are obtained based on the
the effectiveness of the air-combat behavior data mining process of the truncation method; runtime only denotes the
method is as follows. time consumed in finding the rules.
Step 1 Firstly, continuously conduct the program of In the experiments, some interesting rules are discov-
the air-combat behavior data mining n times; ered:
Yunfei Yin et al.: Air-combat behavior data mining based on truncation method
(a) In the air-combat behavior mining of a single fighter,
the rules involved the maneuver “left pull” are much more.
For example, in Experiment 1, four rules involved the
maneuver “left pull” are discovered, which account for
36.4% of the total rules discovered. Experiment 3 discov-
ers the ratio of the rules involved the maneuver “left pull”
is 36.4%. Experiment 5 discovers the ratio of the rules
involved the maneuver “left pull” is 50%. Experiment 7
discovers the ratio of the rules involved the maneuver “left
pull” is 50%. Experiment 9 discovers the ratio of the rules
involved the maneuver “left pull” is 50%. Experiment 11
discovers the ratio of the rules involved the maneuver “left
pull” is 50%.
(b) In the air-combat behavior mining of dual fighters,
the rules involved simple maneuvers are much more.
For example, the discovered rules involved the simple
maneuvers account for 100% of the total rules discovered
in Experiment 2. The rules discovered in Experiment 4 in-
volved the simple rules account for 100% of the total rules
discovered. The rules discovered in Experiment 6 involved
the simple rules account for 100% of the total rules dis-
covered. The rules discovered in Experiment 8 involved
the simple rules account for 75% of the total rules discov-
ered. The rules discovered in Experiment 10 involved the
simple rules account for 50% of the total rules discovered.
The rules discovered in Experiment 12 involved the simple
rules account for 100% of the total rules discovered.
(c) Whether in the air-combat behavior mining of a sin-
gle fighter or the air-combat behavior mining of dual fight-
ers, the following rule is discovered for all.
3→4
which denotes if the fighter conducts the maneuver “right
pull”, then it will conduct the maneuver “left pull” soon
after.
Fig. 5 shows the relationship between the games (times)
of the air combats involved and the time consumed.
Fig. 5 Relationship between the air combats involved and the time
consumed
In Fig. 5, the relationships between the games (times)
of the air combats involved and the time consumed (to
find rules) are compared, respectively. As can be clearly
seen from the figure, there is approximately linear relation-
ship between the time consumed to find the rules and the
833
air-combat games involved, which indicates there is better
scalability between them.
Fig. 6 shows the comparisons between the numbers of
the fighters involved and the numbers of the rules discov-
ered.
Fig. 6 Relationship between the numbers of fighters and the num-
bers of rules discovered
In Fig. 6, the rules discovered in the 12 groups of exper-
iments are shown. In all the experiments, there are always
rules to be discovered, but the rules that are related to 1
fighter are clearly more than the rules that are related to 2
fighters.
Fig. 5 and Fig. 6 indicate that this sort of air-combat
behavior data mining based on the truncation method is
acceptable in efficiency, and can discover a quantity of in-
teresting association rules.
With respect to the air-combat behavior mining of many
fighters, it is a rather complex research. Usually, we firstly
assign two fighters to be the relationship of lead plane and
wing plane, and then conduct the 2-to-2 air-combat based
on four fighters. On this basis, we expand the air-combat to
4-to-4 air-combat from the 2-to-2 air-combat, and then to
8-to-8 air-combat, and so forth. The air-combat behavior
mining of multiple fighters is the future work of this study.
5. Conclusions
We have introduced the air-combat behavior data mining
based on the truncation method. The air-combat behav-
ior data mining discovered a quantity of interesting asso-
ciation rules with high efficiency. Through designing the
truncation method, we could handle the air-combat behav-
ior data, effectively, and transform them into the approx-
imate conventional data mining format; and further, dis-
cover the behavior rules that are suitable for air-combat
strategic decisions. The conducted experiments prove that
our proposed method is feasible and significant.
The future research direction of this study is to conduct
the air-combat behavior mining of multiple fighters and
further improve the efficiency of the air-combat behavior
data mining
References
[1] H. Ju, C. Tsai, H. Fu, et al. Design of intelligent flight control
law following the optical payload. Proc. of the IEEE Interna-
834 Journal of Systems Engineering and Electronics Vol. 21, No. 5, October 2010
tional Conference on Networking, Sensing and Control, 2004:
761–766.
[2] A. Bergmann, A. Huebner, T. Loeser. Experimental and numer-
ical research on the aerodynamics of unsteady moving aircraft.
Progress in Aerospace Sciences, 2008, 44(2): 121–137.
[3] E. Morelli, D. Ward. Automated simulation updates based on
flight data. Proc. of the AIAA Atmospheric Flight Mechan-
ics Conference and Exhibit, 2007: AIAA-2007-6714-1–AIAA-
2007-6714-17.
[4] F.L. Groen, M.H. Smaili, R.J. A.W. Hosman. Perception model
analysis of flight simulator motion for a decrab maneuver. Jour-
nal of Aircraft, 2007, 44(2): 427–435.
[5] G. Sachs, I. Sturhan. Improved predictor control law for tunnel
displays. Proc. of the AIAA Guidance, Navigation, and Control
Conference and Exhibit, 2006: AIAA-2006-6220-1 – AIAA-
2006-6220-12.
[6] M. Burda, M. Harding, J. Hausman. A Bayesian mixed logit–
probit model for multinomial choice. Journal of Econometrics
2008, 147(2): 232–246.
[7] C. Gagné, G. Duchesne. On robust forecasting in dynamic vec-
tor time series models. Journal of Statistical Planning and In-
ference, 2008, 138(12): 3927–3938.
[8] Y. Zhang. Complex adaptive filtering user profile using graph-
ical models. Information Processing & Management, 2008,
44(6): 1886–1900.
[9] P. Gancarski, A. Blansche, A. Wania. Comparison between two
coevolutionary feature weighting algorithms in clustering. Pat-
tern Recognition, 2008, 41(3): 983–994.
[10] X. Wang, Z. Qiu. Interval finite element analysis of wing flutter.
Chinese Journal of Aeronautics, 2008, 21(2): 134–140.
[11] Q. Ding, Q. Ding, W. Perrizo. PARM—an efficient algorithm to
mine association rules from spatial data. IEEE Trans. on Sys-
tems, Man, and Cybernetics, Part B, 2008, 38(6): 1513–1524.
[12] M. Bilenko, R.W. White. Mining the search trails of surfing
crowds: identifying relevant websites from user activity. Proc.
of the 17th International Conference on World Wide Web, 2008:
51–60.
[13] N. Matake, T. Hiroyasu, M. Miki, et al. Multiobjective cluster-
ing with automatic k-determination for large-scale data. Proc.
of the 9th annual conference on Genetic and Evolutionary Com-
putation, 2007: 861–868.
[14] E. Agichtein, Z. Zheng. Identifying “best bet” web search re-
sults by mining past user behavior. Proc. of the 12th ACM
SIGKDD International Conference on Knowledge Discovery
and Data Mining, 2006: 902–908.
[15] V.S. Tseng, K.W. Lin. Efficient mining and prediction of user
behavior patterns in mobile web systems. Information and Soft-
ware Technology, 2006, 48(6): 357–369.
[16] R. Colgren, R. Loschke. Effective design of highly maneuver-
able tailless aircraft. Journal of Aircraft, 2008, 45(4): 1441–
1449.
[17] H. Joe, D. Shin, J. Jo, et al. Air-to-air and air-to-ground engage-
ment modeling for the KAI embedded training system. Proc.
of the AIAA Modeling and Simulation Technologies Conference
and Exhibit, 2008: AIAA-2008-6859-1–AIAA-2008-6859-10.
[18] Y. Yin. An approach to mining bundled commodities.
Knowledge-Based Systems, 2008, 21(4): 321–331.
[19] Y. Yin, G. Gong, L. Han. Control approach to rough set re-
duction. Computers and Mathematics with Applications, 2009,
57(1): 117–126.
[20] R. Agrawal, T. Imielinski, A. Swami. Mining association rules
between sets of items in large databases. Proc. of the ACM-
SIGMOD International Conference on Management of Data,
1993: 207–216.
[21] J. Han, J. Pei, Y. Yin. Mining frequent patterns without can-
didate generation. Proc. of the ACM-SIGMOD International
Conference on Management of Data, 2000: 1–12.
[22] J. Han, J. Pei, Y. Yin, et al. Mining frequent patterns without
candidate generation: a frequent-pattern tree approach. Data
Mining and Knowledge Discovery, 2004, 8(1): 53–87.
[23] J. Liu, Q. Fei. Research of intelligence data mining based on
commanding decision-making. Journal of Systems Engineering
and Electronics, 2007, 18(2): 275–280.
Biographies
Yunfei Yin was born in 1976. he received the
B.S. degree from Peking University, the M.S. de-
gree from Guangxi Normal University, and the
Ph.D. degree from Beihang University. He is a
reviewer for many international journals and in-
ternational conferences including Artificial Intel-
ligence, IEEE International Conference on Data
Mining (ICDM). His research interests are in data
mining, computer simulation, software engineer-
ing and source code analysis.
E-mail: yinyunfei@asee.buaa.edu.cn
Guanghong Gong was born in 1968. she re-
ceived the B.S., M.S. and Ph.D. degrees from
Beihang University. She is currently a professor
in Beihang University. Her research interests in-
volve various aspects of computer simulation and
computer graphics including computer generated
forces, virtual reality and human motion model-
ing.
E-mail: ggh@buaa.edu.cn
Liang Han was born in 1957. he received the
B.S. degree from Fudan University, the M.S.
degree from Harbin Institute of Technology,
and the Ph.D. degree from Beihang University.
He is currently a professor in Beihang Univer-
sity. His research interests are in computer sim-
ulation, artificial intelligence and CGF behavior
modeling.
E-mail: hanliang@buaa.edu.cn