Optimization We determine the vector µ by minimizing the parametric distance (4) between all target labeled documents and their corresponding source labeled document identified in the previous step.
the solution µ to this linear programming problem can be regarded as the cross-domain knowledge between source domain s u and the target domain t. Repeating for every source domain s u , u = 1, .