Journal of Applied Information Science

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Multi-Task Clustering of Human Actions by Sharing Information


Affiliations
1 Department of Computer Science, GATE College, Tirupati, Andhra Pradesh, India
     

   Subscribe/Renew Journal


Multi-mission grouping improves the bunching execution of every undertaking through swapping searching for throughout over linked commitments. Most present multi-strategic frameworks depend upon the perfect presumption that the obligations are totally associated. Notwithstanding this, in real highlights, the responsibilities are maximum intense generally incompletely associated [1, 2]. In the one’s occasions, brute propels alternate might also intent unsafe have an effect on that spoils the bunching execution. On this paper, we will be slanted to demonstrate an multi-project bunching techniques for halfway associated duties: oneself balanced multi-adventure grouping (SAMTC) approach and moreover the thoughts-boggling normal cryptography multi-challenge grouping (MRCMTC) way, that is in a scenario to consequently understand thoughts-boggling alternate associated sporting events some of the obligations, as a final product keeping off from risky alternate. Each SAMTC and MRCMTC accumulate the equality network for each factor assignment via abusing fundamental statistics from the supply errands via related models exchange and acquire apparition grouping to incite the rest of the bunching outcomes. Be that when you consider that it’s going to, they maintain the related occasions from the accessibility responsibilities in a very stack of techniques. Preliminary effects on proper enlightening statistics display the superiorities of the projected calculations over customary single-essential frameworks and present multi-undertaking grouping processes on each absolutely and restriction of the time-related commitments [3, 4].

Keywords

Instance Transfer, Multi-Mission Clustering, Negative Transfer, Partially Related Tasks.
Subscription Login to verify subscription
User
Notifications
Font Size


  • S. J. Pan, and Q. Yang, “A survey on transfer learning,” IEEE Trans. Knowl. Data Eng., vol. 22, no. 10, pp. 1345-1359, 2010.

  • J. Zhang, and C. Zhang, “Multitask Bregman clustering,” In Proc. 24th AAAI Conf. Artif. Intell., 2010, pp. 655-660.

  • X. Zhang, and X. Zhang, “Smart multi-task Bregman clustering and multi-task Kernel clustering,” In Proc. 27th AAAI Conf. Artif. Intell., 2013, pp. 1034-1040.

  • X. Zhang, “Convex discriminative multitask clustering,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 37, no. 1, pp. 28-40, 2015.

  • J. Lin, “Divergence measures based on the Shannon entropy,” IEEE Trans. Inform. Theory, vol. 37, no. 1, pp. 145-151, 1991.

  • J. Huang, A. J. Smola, A. Gretton, K. M. Borgwardt, and B. Scholkopf, “Correcting sample selection bias by unlabeled data,” In Proc. 20th Adv. Neural Inform. Process. Syst., 2006, pp. 601-608.

  • X. Zhang, X. Zhang, and H. Liu, “Self-adapted multi-task clustering,” In Proc. 25th Int. Joint Conf. Artif. Intell., 2016, pp. 2357-2363.

  • R. Caruana, “Multitask learning,” Mach. Learn., vol. 28, no. 1, pp. 41-75, 1997.

  • R. K. Ando, and T. Zhang, “A framework for learning predictive structures from multiple tasks and unlabeled data,” J. Mach. Learn. Res., vol. 6, pp. 1817-1853, 2005.

  • A. Argyriou, T. Evgeniou, and M. Pontil, “Multi-task feature learning,” In Proc. 20th Adv. Neural Inform. Process. Syst., 2006, pp. 41-48.

  • J. Chen, L. Tang, J. Liu, and J. Ye, “A convex formulation for learning shared structures from multiple tasks,” In Proc. 26th Int. Conf. Mach. Learn., 2009, pp. 137-144.

  • T. Evgeniou, and M. Pontil, “Regularized multi-task learning,” In Proc. 10th ACM SIGKDD Int. Conf. Knowl. Disc. Data Min., 2004, pp. 109-117.

  • C. A. Micchelli, and M. Pontil, “Kernels for multi-task learning,” In Proc. 18th Adv. Neural Inform. Process. Syst., 2004.

  • T. Evgeniou, C. A. Micchelli, and M. Pontil, “Learning multiple tasks with kernel methods,” J. Mach. Learn. Res., vol. 6, pp. 615-637, 2005.

  • A. Barzilai, and K. Crammer, “Convex multi-task learning by clustering,” In Proc. 18th Int. Conf. Artif. Intell. and Stat., 2015, pp. 65-73.


Abstract Views: 529

PDF Views: 0




  • Multi-Task Clustering of Human Actions by Sharing Information

Abstract Views: 529  |  PDF Views: 0

Authors

Jyoshnasri Mandyam
Department of Computer Science, GATE College, Tirupati, Andhra Pradesh, India

Abstract


Multi-mission grouping improves the bunching execution of every undertaking through swapping searching for throughout over linked commitments. Most present multi-strategic frameworks depend upon the perfect presumption that the obligations are totally associated. Notwithstanding this, in real highlights, the responsibilities are maximum intense generally incompletely associated [1, 2]. In the one’s occasions, brute propels alternate might also intent unsafe have an effect on that spoils the bunching execution. On this paper, we will be slanted to demonstrate an multi-project bunching techniques for halfway associated duties: oneself balanced multi-adventure grouping (SAMTC) approach and moreover the thoughts-boggling normal cryptography multi-challenge grouping (MRCMTC) way, that is in a scenario to consequently understand thoughts-boggling alternate associated sporting events some of the obligations, as a final product keeping off from risky alternate. Each SAMTC and MRCMTC accumulate the equality network for each factor assignment via abusing fundamental statistics from the supply errands via related models exchange and acquire apparition grouping to incite the rest of the bunching outcomes. Be that when you consider that it’s going to, they maintain the related occasions from the accessibility responsibilities in a very stack of techniques. Preliminary effects on proper enlightening statistics display the superiorities of the projected calculations over customary single-essential frameworks and present multi-undertaking grouping processes on each absolutely and restriction of the time-related commitments [3, 4].

Keywords


Instance Transfer, Multi-Mission Clustering, Negative Transfer, Partially Related Tasks.

References