Edification Training for Participating in Various Activities Through Online
DOI:
https://doi.org/10.53555/nncse.v2i3.479Keywords:
on-line learning, Artificial intelligence, multitask learning, classificationAbstract
This paper analyze the specification of online multitask learning for recovering various classification process that is in parallel related , focusing at every part of data received by each accurately and efficiently . Statistical machine translation systems are usually trained on large amounts of micro-blog sentiment detection on a faction of users, which classifies micro-blog posts which are generated by each user into expressive or non-expressive categories. This particular online learning task is challenging for a number of reasons. To achieve the major requirement of online applications, a highly efficient and scalable problem that can give sudden assumption with low learning cost. This requirement leaves conventional batch learning algorithms out of consideration. Then, novel organization methods, be it group or online, often encounter a dilemma when applied to a group of process, i.e., on one hand, a single classification model trained on the entire collection of data from all tasks may fail to capture characteristics of individual task; on the other hand, a model trained separately on individual tasks may suffer from insufficient training data. To rectify this problem in this paper, we propose a Edification training for participating in various activities through online, from this we can geographical model over the entire data of all process. Another part individual model for various related process are combined inferred by to make cost effective in the global model through a Edification training via online approach. We defined the effectiveness of the proposed system on a synthetic dataset. Here the evaluation had done three real-life problems bioinformatics data classification, spam email filtering, and micro-blog sentiment detection.
References
Guangxia Li,Steven C.H.Hoi,Kuiyu Chang,Wenting Liu,and Ramesh Jain vol.26,no.8,August 2014
Dan Klein. Joseph Smarr. Huy Nguyen. Christopher D. Manning “Named Entity Recognition with Character-Level Models”. In Proceedings of CONLL-2003.
Chang CC, Lin CJ “LIBSVM: A library for support vector machines” ACM ... Communications and Control (ICECC), 2011 International Conference.
Nicola Ueffing,” Transductive learning for statistical machine translation” In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pp. 25-32.‘
G. Li, K. Chang, S. C. H. Hoi, W. Liu, and R. Jain, “Collaborative online learning of user generated content,” in Proc. 20th ACM Int. CIKM, 2011, pp. 285–290.
L.J.P. van der Maaten and G.E. Hinton. “Visualizing High-Dimensional Data Using t-SNE”. Journal of Machine Learning Research 9(Nov) PP: 2579-2605, 2008.
C. Widmer, Y. Altun, N. C. Toussaint, and G. Rätsch, “Inferring latent task structure for multi-task learning via multiple kernel learning,” BMC Bioinformatics, vol. 11, Suppl. 8, p. S5, Oct. 2010.
G. Li, S. C. H. Hoi, K. Chang, and R. Jain, “Micro-blogging sentiment detection by collaborative online learning,” in IEEE 10th ICDM, Sydney, NSW, Australia, 2010, pp. 893–898.
L. Yang, R. Jin, and J. Ye, “Online learning by ellipsoid method,” in Proc. 26th Annu. ICML, Montreal, QC, Canada, 2009, p. 145.
P. Zhao, S. C. H. Hoi, and R. Jin, “DUOL: A double updating approach for online learning,” in NIPS, 2009, pp. 2259–2267.
R. Collobert and J. Weston, “A unified architecture for natural language processing: Deep neural networks with multitask learning,” in Proc. 25th ICML, Helsinki, Finland, 2008, pp. 160–167.
K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer, “Online passive-aggressive algorithms,” J. Mach. Learn. Res., vol. 7, pp. 551–585, Mar. 2006.
N. Cesa-Bianchi, A. Conconi, and C. Gentile, “A secondorder perceptron algorithm,” SIAM J. Comput., vol. 34, no. 3, pp. 640–668, Jul. 2005.
N. Cesa-Bianchi, A. Conconi, and C. Gentile, “On the generalization ability of on-line learning algorithms,” IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 2050–2057, Sept. 2004.
K. Crammer and Y. Singer, “Ultraconservative online algorithms for multiclass problems,” J. Mach.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
