Research Article
Sign Prediction on Unlabeled Social Networks Using Branch and Bound Optimized Transfer Learning
Algorithm 1
Branch and Bound optimized Domain Reconstruction.
| Input: and | | Output: Global optimal value of , reconstruction error e | | Parameters: Constraint parameter α, | | Cut-off error , | | : lower bound function; | | : upper bound function; | | : a n-dimensional vectors set. | | 1. Initialize in (4) | | 2. Calculate the lower bound L and upper bound U on : | | 3. while do | | 4. | | 5. end while | | 6. Split into 2 number sets and , where | | 7. Compute and , | | 8. Update lower and upper bounds of . | | 9. while do | | 10. | | 11. | | 12. end while | | 13. Refine partition via splitting or . | | 14. if or then | | 15. repeat step 6 and 7 | | 16. else | | 17. return , e | | 18. end if | | 19. Update the value of | | |
|