# Instance Transfer Learning with Multisource Dynamic TrAdaBoost

Authors: Qian Zhang; Haigang Li; Yong Zhang; Ming Li
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Since the transfer learning can employ knowledge in relative domains to help the learning tasks in current target domain, compared with the traditional learning it shows the advantages of reducing the learning cost and improving the learning efficiency. Focused on the situation that sample data from the transfer source domain and the target domain have similar distribution, an instance transfer learning method based on multisource dynamic TrAdaBoost is proposed in this paper. In this method, knowledge from multiple source domains is used well to avoid negative transfer; furthermore, the information that is conducive to target task learning is obtained to train candidate classifiers. The theoretical analysis suggests that the proposed algorithm improves the capability that weight entropy drifts from source to target instances by means of adding the dynamic factor, and the classification effectiveness is better than single source transfer. Finally, experimental results show that the proposed algorithm has higher classification accuracy.


---

## Body

## 1. Introduction

In data mining, a general assumption for the traditional machine learning is that training data and test data have the same distribution. However, in the practical application, this assumption cannot be often met [1]. By transferring and sharing different field knowledge for target task learning, transfer learning makes the traditional learning from scratch an addable one. This must improve the learning efficiency and reduce the learning cost [2, 3]. In 2005, Information Processing Techniques Office (IPTO) gave a new mission of transfer learning: the ability of a system to recognize and apply knowledge and skills learned in previous tasks to novel tasks. In this definition, transfer learning aims to extract the knowledge from one or more source tasks and apply the knowledge to a target task [2]. Since the transfer learning needs to use information from similar domains and tasks, its effectiveness is related to the correlation between the source and target domains.However, transfer learning is more complex than traditional machine learning because of the introduction of transfer. There are many kinds of knowledge representation in related domains, such as sample instances, feature mapping, model parameters, and association rules. Due to the simpleness of implement, the paper selects sample instances as knowledge representation to design the effective transfer algorithm. In detail, instance transfer learning is used to improve the classification accuracy by finding training samples in other source domains which have strong correlation with the target domain and reusing them in the learning of target task [4]. Obviously, how to decide weight of this training data should influence the effectiveness of candidate classifiers [5].Up to now, researchers have proposed several approaches to solve transfer learning problems. Ben and Schuller provided a theoretical justification for multitask learning [6]. Daumé and Marcu studied the domain-transfer problem in statistical natural language processing by using a specific Gaussian model [7]. Wu and Dietterich proposed an image classification algorithm by using both inadequate training data and plenty of low quality auxiliary data [8]. This algorithm demonstrates some improvement by using the auxiliary data, but it does not give a quantitative study using different auxiliary examples. Liao et al. proposed a new active learning method to select the unlabeled data in a target domain to be labeled with the help of the source domain data [9]. Rosenstein et al. proposed a hierarchical Naive Bayes approach for transfer learning by using auxiliary data and discussed the applying time problem of transfer learning [10].Transfer AdaBoost algorithm, also called TrAdaBoost, is a classic transfer learning algorithm which is proposed by Dai et al. [11]. TrAdaBoost assumes that the source and target domain data use exactly the same set of features and labels, but the distributions of the data in the two domains are different. In addition, TrAdaBoost assumes that, due to the difference in distributions between the source and the target domains, some of the source domain data may be useful in learning for the target domain but some of them may not and could even be harmful. Since TrAdaBoost relies only on one source, its learning effects will become poor when there is a weak correlation between the source and target domains. Moreover, as the literatures [12–14] said, TrAdaBoost has the weaknesses of weight mismatch, introducing imbalance and rapid convergence of source weights. The purpose of this paper is to remove the weight drift phenomenon efficiently, improve learning efficiency, and inhibit the negative transfer.


## 2. Multisource Dynamic TrAdaBoost Algorithm

Considering the correlation between multiple source domains and the target domain, recently Yao and Doretto proposed multisource TrAdaBoost (MSTrA) transfer learning algorithms [15]. As an instance-based transfer learning method, MSTrA selects its training samples from different source domains. At each iteration, MSTrA always selects the most related source domain to train the weak classifier. Although this can ensure that the knowledge transferred is relevant to the target task, MSTrA ignores effects of other source domains. Samir and Chandan proposed an algorithm (DTrAdaBoost) with an integrated dynamic cost to resolve a major issue in the boosting-based transfer algorithm, TrAdaBoost [16]. This issue causes source instances to converge before they can be used for transfer learning. But DTrAdaBoost has low efficiency of learning.In order to overcome the above disadvantage, a multisource dynamic TrAdaBoost algorithm (MSDTrA) is proposed. By using this algorithm, the rate of convergence of source sample weight will be reduced based on weak correlation to target domain [17]. Supposing there are N source domains, D
S
1
,
…
,
D
S
N; N source tasks, T
a
1
,
…
,
T
a
N; and N source training data, D
a
1
,
…
,
D
a
N, the purpose of transfer learning is to make good use of them to improve the learning effectiveness of the target classifier function f
^
b
:
X
→
Y. In detail, the algorithm steps of MSDTrA are described as follows.Step 1.
Initialize the weight vector(
ω
a
1
,
…
,
ω
a
N
,
ω
b
), where ω
a
k
=
(
ω
a
k
1
,
…
,
ω
a
k
n
a
k
) are the weight vectors of training samples with kth source domain and ω
b
=
(
ω
b
1
,
…
,
ω
b
n
b
) are the weight vectors of training samples in target domain.Step 2.
Set the value ofβ
a as follows:
(1)
β
a
=
1
1
+
2
*
ln
⁡
(
n
a
)
/
M
,
where n
a
=
∑
k
n
a
k is the number of all source domains training samples and n
a
kis the sample number of training sets with kth source domain.Step 3.
Empty the set of candidate weak classifiers and normalize the weight vectors(
ω
a
1
,
…
,
ω
a
N
,
ω
b
) to 1.Step 4.
Select a base learner to obtain the candidate weak classifiers(
f
b
t
)
k based on training set D
a
k
∪
D
b; calculate the error of (
f
b
t
)
k on D
b according to the following equation:
(2)
(
ε
b
t
)
k
=
∑
j
=
1
n
b
ω
b
j
∑
k
=
1
N
[
y
b
j
≠
(
f
b
t
)
k
·
x
b
j
]
∑
i
=
1
n
b
ω
b
i
;
update the weight of (
f
b
t
)
k by using the vectors update strategy:
(3)
(
ω
b
t
)
k
=
e
1
-
(
ε
b
t
)
k
e
(
ε
b
t
)
k
.
Repeat the above method until all source domains are traversed, where(
ε
b
t
)
k is the error rate of candidate weak classifiers with kth source domains in target domain. y
b
j
≠
(
f
b
t
)
k
·
x
b
j stands for error classified with the candidate weak classifiers. According to the vectors update strategy above, the error of each weak classifier in the target training set is computed and a weight is assigned to each weak classifier according to the error. The larger the error is, the smaller the weight becomes. In other words, source domains which correspond to those classifiers with high classification accuracy contain much valuable information for the learning of target task.Step 5.
Integrate all weighted weak classifiers to obtain a candidate classifier at thetth iteration:
(4)
f
b
t
=
∑
k
(
ω
b
t
)
k
∑
k
(
ω
b
t
)
k
(
f
b
t
)
k
,
where the classification error of f
b
t on D
b at iteration t is
(5)
ε
b
t
=
∑
j
=
1
n
b
ω
b
j
∑
t
=
1
M
[
y
b
j
≠
f
b
t
·
x
b
j
]
∑
i
=
1
n
b
ω
b
i
,
where ε
b
t must be less than 0.5. Then, calculate the errors of the candidate classifier on the source and target training sets, based on which update the weights of training samples on the source and target domains. For the correct classified source training samples, their corresponding weights keep unchanged.Step 6.
Set(6)
β
b
t
=
ε
b
t
1
-
ε
b
t
,
C
t
=
2
(
1
-
ε
b
t
)
,
0
≤
ε
b
t
≤
1
2
,
where C
t
=
2
(
1
-
ε
b
t
) is the expression of dynamic factor C
t. And Theorem 1 will provide the deduce process.Step 7.
Update the weight vector of source samples according to the following rule:(7)
ω
a
k
(
t
+
1
)
·
i
=
C
t
·
ω
a
k
t
·
i
·
(
β
a
)
∑
t
=
1
M
[
y
b
j
≠
f
b
t
·
x
b
j
]
,
i
∈
D
a
k
.
Update the weight of target samples according to the rule:(8)
ω
b
(
t
+
1
)
·
i
=
ω
b
t
·
i
·
(
β
b
t
)
∑
t
=
1
M
[
y
b
j
≠
f
b
t
·
x
b
j
]
,
i
∈
D
b
,
where the weight update of the source instances uses the weighted majority algorithm (WMA) mechanism. This updated mechanism is computed by β
a and C
t. The target instance weights are updated by using ε
b
t, which is calculated on Step 6.Step 8.
Retrain all weak classifiers using the training samples with updated weights. If the maximum number of iterations is reached,t
<
M, return to Step 3; otherwise, turn to Step 9.Step 9.
Decide the final strong classifier(9)
f
^
b
=
sign
⁡
{
∏
t
=
1
M
[
(
β
b
t
)
-
f
b
t
]
-
∏
t
=
1
M
[
(
β
b
t
)
-
1
/
2
]
}
.In the MSDTrA algorithm, TrAdaBoost’s ensemble learning is selected to train classifiers based on the combination set of source and target instances in every step. WMA is used to adjust weights of the source set by decreasing the weight of misclassified source instances and preserving current weights of correctly classified source instances.It can be seen from the above algorithm that the MSDTrA allows all source training samples to participate in learning process at each iteration, and different source training samples are assigned different weights. If a source training sample can improve the learning of target task, it will be assigned a large weight. Overall, the MSDTrA takes full advantage of all useful knowledge from all source domains, and this can obviously enhance the learning effectiveness of target task.


## 3. Theoretical Analysis

The previous section introduced in detail the proposed new algorithm, that is, the instance transfer learning algorithm. In this section, related theory analyses will be given according to single source TrAdaBoost algorithm [13]. First, Theorems 1 and 2 will proof the influence of source and target sample weight vectors with dynamic factor in source weight, respectively.Theorem 1.
A dynamic factor ofC
t
=
2
(
1
-
ε
b
t
) that is applied to the source weights can prevent their weight drift and get the weight vector to update mechanism of source sample.Proof.
SetA is sum of correctly classified target weights at boosting iteration t
+
1 and B is sum of misclassified target weights at boosting iteration t
+
1. Consider
(10)
A
=
n
b
·
ω
b
t
(
1
-
ε
b
t
)
·
(
ε
b
t
1
-
ε
b
t
)
∑
t
=
1
M
[
y
b
j
=
f
b
t
·
x
b
j
]
=
n
b
·
ω
b
t
(
1
-
ε
b
t
)
00000000000000000000000000000
if
∑
t
=
1
M
[
y
b
j
=
f
b
t
·
x
b
j
]
=
0
,
B
=
n
b
·
ω
b
t
·
ε
b
t
·
(
ε
b
t
1
-
ε
b
t
)
∑
t
=
1
M
[
y
b
j
=
f
b
t
·
x
b
j
]
=
n
a
·
ω
a
k
t
(
1
-
ε
b
t
)
000000000000000000000000000
if
∑
t
=
1
M
[
y
b
j
≠
f
b
t
·
x
b
j
]
=
1
.
Substituting forA and B to simplify the source update of TrAdaBoost, we have
(11)
ω
a
k
t
+
1
=
ω
a
k
t
n
a
·
ω
a
k
t
+
A
+
B
=
ω
a
k
t
n
a
·
ω
a
k
t
+
2
·
n
b
·
ω
b
t
(
1
-
ε
b
t
)
.
Introducing the correction factor into the WMA, because ofω
a
k
t
+
1
=
ω
a
k
t, we have
(12)
ω
a
k
t
=
C
t
·
ω
a
k
t
C
t
·
n
a
·
ω
a
k
t
+
2
·
n
b
·
ω
b
t
(
1
-
ε
b
t
)
,
C
t
=
2
·
n
b
·
ω
b
t
(
1
-
ε
b
t
)
1
-
n
a
·
ω
a
k
t
=
2
·
n
b
·
ω
b
t
(
1
-
ε
b
t
)
n
b
·
ω
b
t
=
2
(
1
-
ε
b
t
)
.Theorem 2.
The dynamic factor ofC
t
=
2
(
1
-
ε
b
t
) that is applied to the source weights makes the target weights converge as outlined by TrAdaBoost.Proof.
In TrAdaBoost, without any source instances (n
a
=
0), target weights for correctly classified instances will be updated as
(13)
ω
b
t
+
1
=
ω
b
t
∑
j
=
1
n
b
ω
b
t
·
(
ε
b
t
/
(
1
-
ε
b
t
)
)
∑
t
=
1
M
[
y
b
j
≠
f
b
t
·
x
b
j
]
=
ω
b
t
A
+
B
=
ω
b
t
2
·
n
b
·
ω
b
t
(
1
-
ε
b
t
)
=
ω
b
t
2
(
1
)
(
1
-
ε
b
t
)
.
Applying the dynamic factor to update the source instance weight, we can get the update mechanism of the target instance weight based on MSDTrA. Consider(14)
ω
b
t
+
1
=
ω
b
t
n
a
·
ω
a
k
t
+
2
n
b
·
ω
b
t
(
1
-
ε
b
t
)
=
ω
b
t
C
t
·
n
a
·
ω
a
k
t
+
2
n
b
·
ω
b
t
(
1
-
ε
b
t
)
=
ω
b
t
2
(
1
-
ε
b
t
)
·
n
a
·
ω
a
k
t
+
2
n
b
·
ω
b
t
(
1
-
ε
b
t
)
=
ω
b
t
2
(
1
-
ε
b
t
)
(
n
a
·
ω
a
k
t
+
n
b
·
ω
b
t
)
=
ω
b
t
2
(
1
-
ε
b
t
)
(
1
)
.Next, we analysis the performance of MSDTrA on the target training set.Theorem 3.
The final error on the target training set is(15)
ε
≤
2
M
·
∏
t
=
1
M
ε
b
t
(
1
-
ε
b
t
)
.Proof.
Supposing that the final sample set which contains all misclassified samples on the target domain isT, the final error is ε
=
|
T
|
/
n
b.
At each iteration, the error on the target training set is(16)
ε
b
t
=
∑
k
(
w
b
t
)
k
∑
k
(
w
b
t
)
k
(
ε
b
t
)
k
=
∑
k
e
1
-
2
(
ε
b
t
)
k
(
ε
b
t
)
k
∑
k
e
1
-
2
(
ε
b
t
)
k
,
where 0
≤
(
ε
b
t
)
k
≤
1
/
2.
If the error on the target training set is 0,ε
b
t
=
0, training sample weights are not updated, w
b
(
t
+
1
)
i
=
w
b
t
i. If ε
b
t
≠
0 and β
b
t
=
ε
b
t
/
(
1
-
ε
b
t
)
≠
0, the updating rule for the weights of target training samples is as follows:
(17)
∑
i
=
1
n
b
w
b
(
t
+
1
)
i
=
∑
i
=
1
n
b
w
b
t
·
i
(
β
b
t
)
1
-
ε
b
t
≤
∑
i
=
1
n
b
w
b
t
·
i
(
1
-
(
1
-
ε
b
t
)
β
b
t
)
.
Then,(18)
∑
i
=
1
n
b
w
b
(
M
+
1
)
i
=
∑
i
=
1
n
b
w
b
t
·
i
(
β
b
t
)
1
-
ε
b
t
≤
∑
i
=
1
n
b
w
b
i
∏
t
=
1
M
(
1
-
(
1
-
ε
b
t
)
β
b
t
)
≔
∏
t
=
1
M
(
1
-
(
1
-
ε
b
t
)
β
b
t
)
.
In addition, we have the following criterion:(19)
∑
i
=
1
n
b
w
b
(
M
+
1
)
i
≥
∑
i
∈
S
w
b
i
(
∏
t
=
1
M
β
b
t
)
1
/
2
=
ε
(
∏
t
=
1
M
β
b
t
)
1
/
2
.
Combining (18) and (19), we have
(20)
ε
(
∏
t
=
1
M
β
b
t
)
1
/
2
≤
∏
t
=
1
M
(
1
-
(
1
-
ε
b
t
)
β
b
t
)
.
Substitutingβ
b
t
=
ε
b
t
/
(
1
-
ε
b
t
) into (20), we can obtain
(21)
ε
≤
2
M
·
∏
t
=
1
M
ε
b
t
(
1
-
ε
b
t
)
.According to Theorem3, because the condition of ε
b
t
<
0.5 is satisfied in the algorithm, the error in final target training data will decrease with the increase of iterations. And the upper bound of the associated generalization error can be calculated by ε
+
O
(
M
d
VC
/
n
b
), where d
VC is the VC-dimension of the weak classifier model.


## 4. Experimental Results and Analysis

The performance of the proposed method is investigated based on object category recognition in this section. Without loss of generality, we consider the following case: a small number of training samples of a target object category and a large number of training samples of other source object categories. For any test sample, we verify whether it belongs to the target object category or not.


### 4.1. Experimental Setting

For object category recognition, the Caltech 256 datasets that contain 256 object categories are considered. Practically, among 256 object categories, the 80 categories that contain more than 50 samples are used in our experiment. We designate the target category and randomly draw the samples that form the target data. The number of samples for trainingn
b is limited between 1 and 50, while the number of samples for testing is 50. Furthermore, in order to illustrate the proposed method does not depend on the data set, we have also used the background dataset, collected via the Google image search engine, along with the remaining categories as our augmented background data set, to verify the effectiveness and robustness of this method.The remaining categories are treated as the repository from which to draw positive samples for the source data. The numbers of source categories or domains are varied from 1 to 10 in order to investigate the performance of the classifiers with respect to the variability of domains. The number of samples for one source of data is 100. For each target object category, the performance of the classifier is evaluated over 20 random combinations ofN source object categories. Given the target and source categories, the performance of the classifier is obtained by averaging over 20 trials of experiments. The overall performance of the classifier is averaged over 20 target categories. SVM is selected as base classifiers and the iteration is 50.


### 4.2. Error Analysis

Since transfer learning is not needed to get good classification results when the target data set is large, standard cross-validation method is not used here. Small portion data of the target set are used for training, and most of the remaining samples are used for testing. Figure1 compares AdaBoost, TrAdaBoost, MSTrA, and MSDTrA based on the area under the receiver operating characteristic curve (ROC) with different number of target training samples (n
b
=
{
1,10,20,30,40,50
}) and different number of sources in the field (N
=
{
1,4
,
6,8
,
10
}). Moreover, for the area bounded by the ROC curve and the X-axis, A
ROC is used to evaluate the performance of different algorithms.Performance comparison.
(a)
The number of source domainsN
=
4
(b)
The number of training instancesn
b
=
10Practically, fixing the number of source domainsN
=
4, Figure 1(a) shows the ROC curves of the four algorithms with the increase of the number of training instances. Since AdaBoost does not transfer any knowledge from the source, its performance depends mainly on the number of n
b. For a very small value of n
b, it performs slightly improvement as the ROC curves show. However, due to the transfer learning mechanism, TrAdaBoost has good improvement by combining the three sources. By incorporating the ability to transfer knowledge from multiple individual domains, MSTrA and MSDTrA demonstrate a significant improvement in recognition accuracy, even for a very small n
b. In addition, the performance of AdaBoost and TrAdaBoost strongly depends on the selection of source domains and target positive samples, as the standard deviation of A
ROC shows.Fixing the number of training instancesn
b
=
10, Figure 1(b) shows the ROC curves of the four algorithms with increase of the number of source domains. We can see that as the number of source domains increase, the A
ROC of MSTrA and MSDTrA increases and the corresponding standard deviations also decrease. This indicates an improved performance in both accuracy and consistency. Since TrAdaBoost is incapable of exploring the decision boundaries separating multiple source domains, its performance keeps unchanged regardless of the number of source domains.Figure2 compares the classification performance of different methods in the target domain. We can see that AdaBoost algorithm does not transfer source domain knowledge and gets lower classification accuracy. DTrAdaBoost has relatively poor test results, because it only uses one source domain training sample set and gains the least useful knowledge from source domain. CDASVM based on structural risk minimization model fully considers the source domain sample information, and thus it has good classification accuracy. MSTrA and MSDTrA use four different sources domain training sets which contain more useful information, so they get higher testing accuracy than other algorithms. In each set of experiments, MSTrA only selects classification with the highest accuracy at each iteration and ignores the impact of other source domains to target tasks. But by adding the dynamic factors and weighting mechanism, MSDTrA makes better use of all sources domains useful knowledge and eliminates the influences of unrelated samples in sources domains training set to target tasks, so it has better performance than MSTrA algorithm.Figure 2
The classification performance on the target domain.In order to have objective and scientific comparison results, hypothesis testing is used on the experimental results. Let the variablesX
1, X
2, X
3, X
4, X
5 denote the classification error rate of MSDTrA, MSTrA, CDASVM, DTrAdaBoost, and AdaBoost algorithms, respectively. Since the value of X
1, X
2, X
3, X
4, X
5 is subject to many random factors, we assume that they submit to normal distribution, X
i
~
N
(
μ
i
,
σ
i
2
), i
=
1,2
,
3,4
,
5. Now, we compare the random variable means of these algorithms, μ
i (i
=
1,2
,
3,4
,
5). The smaller the μ
i is, the lower the expected classification error rate is and the higher the efficiency is. Because the sample variance is the unbiased estimation of the overall variance, the sample variance value is used as an estimate of the generality variance. In this experiment the significance level α is set as 0.01.Table1 shows the comparison process on μ
i and other parameters. We can see from Table 1 that the expectations of classification error rate in MSDTrA is far below than other algorithms.Table 1
Hypothesis testing for experimental results.
Hypothesis
H
0
:
μ
1
≥
μ
2
H
1
:
μ
1
<
μ
2
H
0
:
μ
1
≥
μ
3
H
1
:
μ
1
<
μ
3
H
0
:
μ
1
≥
μ
4
H
1
:
μ
1
<
μ
4
H
0
:
μ
1
≥
μ
5
H
1
:
μ
1
<
μ
5
Statistics
U
1
=
X
-
1
-
X
-
2
σ
1
2
/
n
1
+
σ
2
2
/
n
2
U
2
=
X
-
1
-
X
-
3
σ
1
2
/
n
1
+
σ
3
2
/
n
3
U
3
=
X
-
1
-
X
-
4
σ
1
2
/
n
1
+
σ
4
2
/
n
4
U
4
=
X
-
1
-
X
-
5
σ
1
2
/
n
1
+
σ
5
2
/
n
5
Rejection region
U
1
≤
-
Z
α
=
-
2.325
U
2
≤
-
Z
α
=
-
2.325
U
3
≤
-
Z
α
=
-
2.325
U
4
≤
-
Z
α
=
-
2.325
Value of the statistic
U
1
=
-
58.67
U
2
=
-
114.56
U
3
=
-
136.59
U
4
=
-
158.23
Conclusion
H
1
:
μ
1
<
μ
2
H
1
:
μ
1
<
μ
3
H
1
:
μ
1
<
μ
4
H
1
:
μ
1
<
μ
5


### 4.3. Time Complexity

Since several domains are used into the learning of target task together, time complexity of multisource domains is more than single domain. Supposing that the time complexities of training a classifier and updating weight areC
h and C
w, respectively, the time complexity of AdaBoos, DTrAdaBoost, MSTrA, and MSDTrA can be approximated to C
h
O
(
M
)
+
C
w
O
(
n
b
M
)
,
C
h
O
(
M
)
+
C
w
O
(
n
a
M
)
,
C
h
O
(
N
M
)
+
C
w
O
(
n
a
N
M
) and C
h
O
(
N
M
)
+
C
w
O
(
n
a
M
). Furthermore, Figure 3 shows the average training time of the four algorithms with fixed N, n
b.Time cost comparison on different methods.
(a)
The number of source domainsN
=
4
(b)
The number of training instancesn
b
=
10


### 4.4. Dynamic Factor

This experiment will prove the effect of dynamic factor on source weights and target weights. Here a sources domain is considered,N
=
1. In Figure 4(a), the number of instances is set as constant (n
a
=
1000, n
b
=
200) and the source error rate is set to zero. According to the WMA, the weights should not change because of ε
a
k
t
=
0; that is, ω
a
k
t
+
1
=
ω
a
k
t. When target error rates ε
b
t
=
{
10
%
,
20
%
,
30
%
,
40
%
}, the ratio of the weights of MSDTrA and MSTrA is plotted at different boosting iterations.(a) Results for 20 iterations with different target error rates. (b) Results after a single iteration with different number of target instances.
(a)
(b)We can see from Figure4(a) the following. (
1
) In MSTrA, source weights converge always even the classification results are correct. (
2
) MSDTrA matches the behavior of the WMA. (
3
) If dynamic factor is not applied, the smaller the value of ε
b
t is and the faster the convergence rate of source weights is. In addition, for a weak learner with ε
b
t
=
10
%, MSTrA is still not able to get good performance by using over 1000 source instances, even though they were never misclassified.


### 4.5. Rate of Convergence

The number of source instances was set (n
b
=
1000), and the classification error is permitted to vary within the range of ε
b
t
∈
{
10
%
~
50
%
}; Figure 4(b) shows results after a single iteration with different number of target instances {
10,20,50
}. It can be observed that after a single boosting iteration, the ratio of a correctly classified source instances increases with the increases of ε
b
t.


## 4.1. Experimental Setting

For object category recognition, the Caltech 256 datasets that contain 256 object categories are considered. Practically, among 256 object categories, the 80 categories that contain more than 50 samples are used in our experiment. We designate the target category and randomly draw the samples that form the target data. The number of samples for trainingn
b is limited between 1 and 50, while the number of samples for testing is 50. Furthermore, in order to illustrate the proposed method does not depend on the data set, we have also used the background dataset, collected via the Google image search engine, along with the remaining categories as our augmented background data set, to verify the effectiveness and robustness of this method.The remaining categories are treated as the repository from which to draw positive samples for the source data. The numbers of source categories or domains are varied from 1 to 10 in order to investigate the performance of the classifiers with respect to the variability of domains. The number of samples for one source of data is 100. For each target object category, the performance of the classifier is evaluated over 20 random combinations ofN source object categories. Given the target and source categories, the performance of the classifier is obtained by averaging over 20 trials of experiments. The overall performance of the classifier is averaged over 20 target categories. SVM is selected as base classifiers and the iteration is 50.


## 4.2. Error Analysis

Since transfer learning is not needed to get good classification results when the target data set is large, standard cross-validation method is not used here. Small portion data of the target set are used for training, and most of the remaining samples are used for testing. Figure1 compares AdaBoost, TrAdaBoost, MSTrA, and MSDTrA based on the area under the receiver operating characteristic curve (ROC) with different number of target training samples (n
b
=
{
1,10,20,30,40,50
}) and different number of sources in the field (N
=
{
1,4
,
6,8
,
10
}). Moreover, for the area bounded by the ROC curve and the X-axis, A
ROC is used to evaluate the performance of different algorithms.Performance comparison.
(a)
The number of source domainsN
=
4
(b)
The number of training instancesn
b
=
10Practically, fixing the number of source domainsN
=
4, Figure 1(a) shows the ROC curves of the four algorithms with the increase of the number of training instances. Since AdaBoost does not transfer any knowledge from the source, its performance depends mainly on the number of n
b. For a very small value of n
b, it performs slightly improvement as the ROC curves show. However, due to the transfer learning mechanism, TrAdaBoost has good improvement by combining the three sources. By incorporating the ability to transfer knowledge from multiple individual domains, MSTrA and MSDTrA demonstrate a significant improvement in recognition accuracy, even for a very small n
b. In addition, the performance of AdaBoost and TrAdaBoost strongly depends on the selection of source domains and target positive samples, as the standard deviation of A
ROC shows.Fixing the number of training instancesn
b
=
10, Figure 1(b) shows the ROC curves of the four algorithms with increase of the number of source domains. We can see that as the number of source domains increase, the A
ROC of MSTrA and MSDTrA increases and the corresponding standard deviations also decrease. This indicates an improved performance in both accuracy and consistency. Since TrAdaBoost is incapable of exploring the decision boundaries separating multiple source domains, its performance keeps unchanged regardless of the number of source domains.Figure2 compares the classification performance of different methods in the target domain. We can see that AdaBoost algorithm does not transfer source domain knowledge and gets lower classification accuracy. DTrAdaBoost has relatively poor test results, because it only uses one source domain training sample set and gains the least useful knowledge from source domain. CDASVM based on structural risk minimization model fully considers the source domain sample information, and thus it has good classification accuracy. MSTrA and MSDTrA use four different sources domain training sets which contain more useful information, so they get higher testing accuracy than other algorithms. In each set of experiments, MSTrA only selects classification with the highest accuracy at each iteration and ignores the impact of other source domains to target tasks. But by adding the dynamic factors and weighting mechanism, MSDTrA makes better use of all sources domains useful knowledge and eliminates the influences of unrelated samples in sources domains training set to target tasks, so it has better performance than MSTrA algorithm.Figure 2
The classification performance on the target domain.In order to have objective and scientific comparison results, hypothesis testing is used on the experimental results. Let the variablesX
1, X
2, X
3, X
4, X
5 denote the classification error rate of MSDTrA, MSTrA, CDASVM, DTrAdaBoost, and AdaBoost algorithms, respectively. Since the value of X
1, X
2, X
3, X
4, X
5 is subject to many random factors, we assume that they submit to normal distribution, X
i
~
N
(
μ
i
,
σ
i
2
), i
=
1,2
,
3,4
,
5. Now, we compare the random variable means of these algorithms, μ
i (i
=
1,2
,
3,4
,
5). The smaller the μ
i is, the lower the expected classification error rate is and the higher the efficiency is. Because the sample variance is the unbiased estimation of the overall variance, the sample variance value is used as an estimate of the generality variance. In this experiment the significance level α is set as 0.01.Table1 shows the comparison process on μ
i and other parameters. We can see from Table 1 that the expectations of classification error rate in MSDTrA is far below than other algorithms.Table 1
Hypothesis testing for experimental results.
Hypothesis
H
0
:
μ
1
≥
μ
2
H
1
:
μ
1
<
μ
2
H
0
:
μ
1
≥
μ
3
H
1
:
μ
1
<
μ
3
H
0
:
μ
1
≥
μ
4
H
1
:
μ
1
<
μ
4
H
0
:
μ
1
≥
μ
5
H
1
:
μ
1
<
μ
5
Statistics
U
1
=
X
-
1
-
X
-
2
σ
1
2
/
n
1
+
σ
2
2
/
n
2
U
2
=
X
-
1
-
X
-
3
σ
1
2
/
n
1
+
σ
3
2
/
n
3
U
3
=
X
-
1
-
X
-
4
σ
1
2
/
n
1
+
σ
4
2
/
n
4
U
4
=
X
-
1
-
X
-
5
σ
1
2
/
n
1
+
σ
5
2
/
n
5
Rejection region
U
1
≤
-
Z
α
=
-
2.325
U
2
≤
-
Z
α
=
-
2.325
U
3
≤
-
Z
α
=
-
2.325
U
4
≤
-
Z
α
=
-
2.325
Value of the statistic
U
1
=
-
58.67
U
2
=
-
114.56
U
3
=
-
136.59
U
4
=
-
158.23
Conclusion
H
1
:
μ
1
<
μ
2
H
1
:
μ
1
<
μ
3
H
1
:
μ
1
<
μ
4
H
1
:
μ
1
<
μ
5


## 4.3. Time Complexity

Since several domains are used into the learning of target task together, time complexity of multisource domains is more than single domain. Supposing that the time complexities of training a classifier and updating weight areC
h and C
w, respectively, the time complexity of AdaBoos, DTrAdaBoost, MSTrA, and MSDTrA can be approximated to C
h
O
(
M
)
+
C
w
O
(
n
b
M
)
,
C
h
O
(
M
)
+
C
w
O
(
n
a
M
)
,
C
h
O
(
N
M
)
+
C
w
O
(
n
a
N
M
) and C
h
O
(
N
M
)
+
C
w
O
(
n
a
M
). Furthermore, Figure 3 shows the average training time of the four algorithms with fixed N, n
b.Time cost comparison on different methods.
(a)
The number of source domainsN
=
4
(b)
The number of training instancesn
b
=
10


## 4.4. Dynamic Factor

This experiment will prove the effect of dynamic factor on source weights and target weights. Here a sources domain is considered,N
=
1. In Figure 4(a), the number of instances is set as constant (n
a
=
1000, n
b
=
200) and the source error rate is set to zero. According to the WMA, the weights should not change because of ε
a
k
t
=
0; that is, ω
a
k
t
+
1
=
ω
a
k
t. When target error rates ε
b
t
=
{
10
%
,
20
%
,
30
%
,
40
%
}, the ratio of the weights of MSDTrA and MSTrA is plotted at different boosting iterations.(a) Results for 20 iterations with different target error rates. (b) Results after a single iteration with different number of target instances.
(a)
(b)We can see from Figure4(a) the following. (
1
) In MSTrA, source weights converge always even the classification results are correct. (
2
) MSDTrA matches the behavior of the WMA. (
3
) If dynamic factor is not applied, the smaller the value of ε
b
t is and the faster the convergence rate of source weights is. In addition, for a weak learner with ε
b
t
=
10
%, MSTrA is still not able to get good performance by using over 1000 source instances, even though they were never misclassified.


## 4.5. Rate of Convergence

The number of source instances was set (n
b
=
1000), and the classification error is permitted to vary within the range of ε
b
t
∈
{
10
%
~
50
%
}; Figure 4(b) shows results after a single iteration with different number of target instances {
10,20,50
}. It can be observed that after a single boosting iteration, the ratio of a correctly classified source instances increases with the increases of ε
b
t.


## 5. Conclusions

Considering the situation that sample data from the transfer source domain and the target domain have similar distribution, an instance transfer learning method based on multisource dynamic TrAdaBoost is provided. By integrating with the knowledge in multiple source domains, this method makes good use of the information of all source domains to guide the target task learning. Whenever candidate classifiers are trained, all the samples in all source domains are involved in learning, and the information that is beneficial to target task learning can be obtained, so that negative transfer can be avoided. The theoretical analysis and experimental results suggest that the proposed algorithm has higher classification accuracy compared with several existing algorithms.



---

*Source: 282747-2014-07-24.xml*