Abstract
Various research efforts have been invested in machine learning and data mining for finding out patterns from data. However, even when some knowledge may be learned in one domain, it is often difficult to re-use it for another domain with different characteristics. Toward effective knowledge transfer between domains, we proposed a transfer learning method based on our transfer hypothesis that two domains have similar feature spaces. A graph structure called a topic graph is constructed by using the learned features in one domain, and the graph is used as a regularization term. In this paper we present a theoretical analysis of our approach and prove the convergence of the learning algorithm. Furthermore, the performance evaluation of the method is reported over document clustering problems. Extensive experiments are conducted to compare with other transfer learning algorithms. The results are encouraging, and show that our method can improve the performance by transferring the learned knowledge effectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cai, D., He, X., Wu, X., Han, J.: Non-negative matrix factorization on manifold. In: Proc. ICDM 2008, pp. 63–72 (2008)
Cover, T., Thomas, J.: Elements of Information Theory. Wiley (2006)
Dai, W., Xue, G.-R., Yang, Q., Yu, Y.: Co-clustering based classification for out-of-domain documents. In: Proc. KDD 2007, pp. 210–219 (2007)
Dhillon, J., Modha, D.: Concept decompositions for lage sparse text data using clustering. Machine Learning 42, 143–175 (2001)
Ding, C., Li, T., Peng, W., Park, H.: Orthogonal nonnegative matrix tri-factorizations for clustering. In: Proc. KDD 2006, pp. 126–135 (2006)
Gao, J., Fan, W., Jiang, J., Han, J.: Knowledge transfer via multiple model local structure mapping. In: Proc. KDD 2008, pp. 283–291 (2008)
Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Proc. NIPS 2001, pp. 556–562 (2001)
Ling, X., Dai, W., Xue, G., Yang, Q., Yu, Y.: Spectral domain-transfer learning. In: Proc. KDD 2008, pp. 488–496 (2008)
Ogino, H., Yoshida, T.: Topic graph based non-negative matrix factorization for transfer learning. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds.) ISMIS 2011. LNCS, vol. 6804, pp. 260–269. Springer, Heidelberg (2011)
Pan, S.J., Yang, Q.: A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering 22(10), 1345–1359 (2010)
Strehl, A., Ghosh, J.: Cluster ensembles — a knowledge reuse framework for combining multiple partitions. J. Machine Learning Research 3(3), 583–617 (2002)
von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing 17(4), 395–416 (2007)
Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proc. SIGIR 2003, pp. 267–273 (2003)
Zhuang, F., Luo, P., Xiaong, H., He, Q., Xiong, Y., Shi, Z.: Exploiting associations between word clusters and document classes for cross-domain text categorization. In: Proc. SDM 2010, pp. 13–24 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Yoshida, T., Ogino, H. (2013). Theoretical Analysis and Evaluation of Topic Graph Based Transfer Learning. In: Yoshida, T., Kou, G., Skowron, A., Cao, J., Hacid, H., Zhong, N. (eds) Active Media Technology. AMT 2013. Lecture Notes in Computer Science, vol 8210. Springer, Cham. https://doi.org/10.1007/978-3-319-02750-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-02750-0_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02749-4
Online ISBN: 978-3-319-02750-0
eBook Packages: Computer ScienceComputer Science (R0)