{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:26:23Z","timestamp":1754155583140,"version":"3.41.2"},"reference-count":22,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T00:00:00Z","timestamp":1514937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2018,2,23]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>As a foundational issue of social mining, sentiment classification suffered from a lack of unlabeled data. To enhance accuracy of classification with few labeled data, many semi-supervised algorithms had been proposed. These algorithms improved the classification performance when the labeled data are insufficient. However, precision and efficiency are difficult to be ensured at the same time in many semi-supervised methods. This paper aims to present a novel method for using unlabeled data in a more accurate and more efficient way.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>First, the authors designed a boosting-based method for unlabeled data selection. The improved boosting-based method can choose unlabeled data which have the same distribution with the labeled data. The authors then proposed a novel strategy which can combine weak classifiers into strong classifiers that are more rational. Finally, a semi-supervised sentiment classification algorithm is given.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>Experimental results demonstrate that the novel algorithm can achieve really high accuracy with low time consumption. It is helpful for achieving high-performance social network-related applications.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Research limitations\/implications<\/jats:title>\n<jats:p>The novel method needs a small labeled data set for semi-supervised learning. Maybe someday the authors can improve it to an unsupervised method.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>The mentioned method can be used in text mining, image classification, audio processing and so on, and also in an unstructured data mining-related field. Overcome the problem of insufficient labeled data and achieve high precision using fewer computational time.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Social implications<\/jats:title>\n<jats:p>Sentiment mining has wide applications in public opinion management, public security, market analysis, social network and related fields. Sentiment classification is the basis of sentiment mining.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>According to what the authors have been informed, it is the first time transfer learning be introduced to AdaBoost for semi-supervised learning. Moreover, the improved AdaBoost uses a totally new mechanism for weighting.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/k-08-2016-0196","type":"journal-article","created":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T03:03:55Z","timestamp":1514948635000},"page":"474-486","source":"Crossref","is-referenced-by-count":1,"title":["Take full advantage of unlabeled data for sentiment classification"],"prefix":"10.1108","volume":"47","author":[{"given":"Lei","family":"La","sequence":"first","affiliation":[]},{"given":"Shuyan","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Liangjuan","family":"Qin","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"issue":"3","key":"key2021041509363205600_ref015","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1007\/s10957-013-0458-6","article-title":"Support vector machine polyhedral separability in semisupervised learning","volume":"164","year":"2015","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"key2021041509363205600_ref001","first-page":"76","article-title":"Active graph based semi-supervised learning using image matching: application to handwritten digit recognition","volume":"73","year":"2016","journal-title":"Pattern Recognition Letters"},{"issue":"4","key":"key2021041509363205600_ref002","first-page":"953","article-title":"Fast and space-efficient Shapelets-based time-series classification","volume":"19","year":"2015","journal-title":"Intelligent Data Analysis"},{"issue":"4","key":"key2021041509363205600_ref003","first-page":"245","article-title":"Self-labeled techniques for semi-supervised learning: taxonomy, software and empirical study","volume":"42","year":"2015","journal-title":"Knowledge and Information Systems"},{"key":"key2021041509363205600_ref102","first-page":"3581","article-title":"Semi-supervised learning with deep generative models","volume-title":"Advances in Neural Information Processing Systems","year":"2014"},{"issue":"1","key":"key2021041509363205600_ref004","first-page":"247","article-title":"Shedding light on the asymmetric learning capability of AdaBoost","volume":"33","year":"2012","journal-title":"Pattern Recognition Letters"},{"issue":"8","key":"key2021041509363205600_ref005","first-page":"121","article-title":"Combining active learning and semi-supervised learning to construct SVM classifier","volume":"44","year":"2013","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"key2021041509363205600_ref006","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TPAMI.2014.2299812","article-title":"Towards making unlabeled data never hurt","volume":"37","year":"2015","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"key2021041509363205600_ref007","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1109\/TKDE.2013.111","article-title":"Adaptation regularization: a general framework for transfer learning","volume":"26","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"key2021041509363205600_ref008","first-page":"14","article-title":"Transfer learning using computational intelligence: a survey","volume":"80","year":"2015","journal-title":"Knowledge-Based Systems"},{"key":"key2021041509363205600_ref009","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.neucom.2014.10.065","article-title":"Generalized radial basis function neural network based on an improved dynamic particle swarm optimization and AdaBoost algorithm","volume":"152","year":"2015","journal-title":"Neurocomputing"},{"issue":"2","key":"key2021041509363205600_ref010","first-page":"1","article-title":"Aspect term extraction for sentiment analysis in large movie reviews using Gini Index feature selection method and SVM classifier","volume":"20","year":"2016","journal-title":"World Wide Web"},{"issue":"5","key":"key2021041509363205600_ref011","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1016\/j.patcog.2011.11.005","article-title":"Multiplicative update rules for incremental training of multiclass support vector machines","volume":"45","year":"2012","journal-title":"Pattern Recognition"},{"first-page":"106","article-title":"A hybrid weighted nearest neighbor approach to mine imbalanced data","year":"2016","key":"key2021041509363205600_ref012"},{"issue":"1","key":"key2021041509363205600_ref013","first-page":"103","article-title":"Machine learning for targeted display advertising: transfer learning in action","volume":"95","year":"2015","journal-title":"Machine Learning"},{"issue":"3","key":"key2021041509363205600_ref014","first-page":"135","article-title":"BoosTexter: a boosting-based system for text categorization","volume":"39","year":"2000","journal-title":"Machine Learning"},{"issue":"1\/2","key":"key2021041509363205600_ref101","first-page":"3311","article-title":"Semi-supervised learning with measure propagation","volume":"12","year":"2011","journal-title":"Journal of Machine Learning Research"},{"first-page":"3038","article-title":"Online boosting algorithms for anytime transfer and multitask learning","year":"2016","key":"key2021041509363205600_ref017"},{"issue":"3","key":"key2021041509363205600_ref016","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1162\/COLI_a_00061","article-title":"Bilingual co-training for sentiment classification of Chinese product reviews","volume":"37","year":"2011","journal-title":"Computational Linguistics"},{"first-page":"73","article-title":"Addressing cold start in recommender systems: a semi-supervised co-training algorithm","year":"2014","key":"key2021041509363205600_ref018"},{"issue":"9","key":"key2021041509363205600_ref019","doi-asserted-by":"crossref","first-page":"2362","DOI":"10.1109\/TKDE.2013.182","article-title":"Graph based constrained semi-supervised learning framework via label propagation over adaptive neighborhood","volume":"27","year":"2015","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2021041509363205600_ref021","first-page":"2315","article-title":"The rate of convergence of AdaBoost","volume":"14","year":"2015","journal-title":"The Journal of Machine Learning Research"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-08-2016-0196\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-08-2016-0196\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:49:39Z","timestamp":1753393779000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/47\/3\/474-486\/273134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,3]]},"references-count":22,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,1,3]]},"published-print":{"date-parts":[[2018,2,23]]}},"alternative-id":["10.1108\/K-08-2016-0196"],"URL":"https:\/\/doi.org\/10.1108\/k-08-2016-0196","relation":{},"ISSN":["0368-492X"],"issn-type":[{"type":"print","value":"0368-492X"}],"subject":[],"published":{"date-parts":[[2018,1,3]]}}}