{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:42:18Z","timestamp":1777704138690,"version":"3.51.4"},"reference-count":40,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:00:00Z","timestamp":1594684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,10,7]]},"abstract":"<jats:p>\n                    In some real applications, only limited labeled positive examples and many unlabeled examples are available, but there are no negative examples. Such learning is termed as positive and unlabeled (PU) learning. PU learning algorithm has been studied extensively in recent years. However, the classical ones based on the Support Vector Machines (SVMs) are assumed that labeled positive data is independent and identically distributed (i.i.d) and the sample size is large enough. It leads to two obvious shortcomings. On the one hand, the performance is not satisfactory, especially when the number of the labeled positive examples is small. On the other hand, classification results are not optimistic when datasets are Non-i.i.d. For this reason, this paper proposes a novel SVM classifier using Chebyshev distance to measure the empirical risk and designs an efficient iterative algorithm, named\n                    <jats:italic>L<\/jats:italic>\n                    <jats:sub>\u221e<\/jats:sub>\n                    \u00a0-\u00a0\n                    <jats:italic>BSVM<\/jats:italic>\n                    in short.\n                    <jats:italic>L<\/jats:italic>\n                    <jats:sub>\u221e<\/jats:sub>\n                    \u00a0-\u00a0\n                    <jats:italic>BSVM<\/jats:italic>\n                    includes the following merits: (1) it allows all sample points to participate in learning to prompt classification performance, especially in the case where the size of labeled data is small; (2) it minimizes the distance of the sample points that are (outliers in Non-i.i.d) farthest from the hyper-plane, where outliers are sufficiently taken into consideration (3) our iterative algorithm can solve large scale optimization problem with low time complexity and ensure the convergence of the optimum solution. Finally, extensive experiments on three types of datasets: artificial Non-i.i.d datasets, fault diagnosis of railway turnout with few labeled data (abnormal turnout) and six benchmark real-world datasets verify above opinions again and demonstrate that our classifier is much better than state-of-the-art competitors, such as\n                    <jats:italic>B-SVM<\/jats:italic>\n                    ,\n                    <jats:italic>LUHC<\/jats:italic>\n                    ,\n                    <jats:italic>Pulce<\/jats:italic>\n                    ,\n                    <jats:italic>B-LSSVM<\/jats:italic>\n                    ,\n                    <jats:italic>NB<\/jats:italic>\n                    and so on.\n                  <\/jats:p>","DOI":"10.3233\/jifs-192064","type":"journal-article","created":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T10:44:22Z","timestamp":1594896262000},"page":"3749-3767","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Construct a biased SVM classifier based on Chebyshev distance for PU learning"],"prefix":"10.1177","volume":"39","author":[{"given":"Ting","family":"Ke","sequence":"first","affiliation":[{"name":"Department of Mathematics, College of Science, Tianjin University of Science &amp; Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics, College of Science, Tianjin University of Science &amp; Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, College of Science, Tianjin University of Science &amp; Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Lv","sequence":"additional","affiliation":[{"name":"Department of Mathematics, College of Science, Tianjin University of Science &amp; Technology, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuechun","family":"Ge","sequence":"additional","affiliation":[{"name":"China Academy of Railway Sciences Signal and Communication Research Institute (Beijing Huatie Information Technology Corporation), Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,7,14]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"RolfI. Fault diagnosis systems: an introduction from fault detection to fault tolerance Fault-Diagnosis Systems (2006)."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.03.021"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","unstructured":"HanB. TomoyaS. and IsseiS. Convex Formulation of Multiple Instance Learning from Positive and Unlabeled Bags 105 (2018) 132\u2013141.","DOI":"10.1016\/j.neunet.2018.05.001"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-019-2700-1"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13721-012-0012-8"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"WangS. ChenZ.Y. and LiuB. Mining Aspect-Specific Opinion using a Holistic Lifelong Topic Model In Proceedings of the International World Wide Web Conference (2016).","DOI":"10.1145\/2872427.2883086"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"ChenZ.Y. MaN.Z. and LiuB. Lifelong Learning for Sentiment Classification In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics (2015) 26\u201331.","DOI":"10.3115\/v1\/P15-2123"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49730-7_9"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63494-0_65"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"LiuB. DaiY. LiX.L. LeeW.S. and YuP.S. Building Text Classifiers Using Positive and Unlabeled Examples In Proceedings of the 3rd IEEE International Conference on Data Mining Melbourne Florida United States IEEE (2003) 179\u2013188.","DOI":"10.1109\/ICDM.2003.1250918"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1264823"},{"key":"e_1_3_2_13_2","unstructured":"ZhangH. and DiL. Na\u00efve Bayes Text Classifier. (2007)."},{"key":"e_1_3_2_14_2","unstructured":"VapnikV.N. The nature of statistical learning theory. Berlin: Springer Verlag. (1995)."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.16"},{"key":"e_1_3_2_16_2","first-page":"587","article-title":"Learning to Classify Text Using Positive and Unlabeled Data. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico","volume":"18","author":"Li X.L.","year":"2003","unstructured":"LiX.L. and LiuB., Learning to Classify Text Using Positive and Unlabeled Data. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, Springer 18 (2003), 587\u2013594.","journal-title":"Springer"},{"key":"e_1_3_2_17_2","unstructured":"LiuB. LeeW.S. YuP.S. et al. Partially Supervised Classification of Text Documents In Proceedings of the 19th International Conference on Machine Learning (2002) 387\u2013394."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2013.11.010"},{"key":"e_1_3_2_19_2","unstructured":"NguyenM.N. LiX.L. and NgS.K. Positive Unlabeled Learning for Time Series Classification In Proceedings of International Joint Conference on Artificial Intelligence IJCAI (2011) 1421\u20131426."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.01.089"},{"key":"e_1_3_2_21_2","unstructured":"ZhangD. and LeeW.S. A Simple Probabilistic Approach to Learning from Positive and Unlabeled Examples. In Proceedings of the 5th Annual UKWorkshop on Computational Intelligence (UKCI) (2005) 83\u201387."},{"issue":"1","key":"e_1_3_2_22_2","first-page":"213","article-title":"Learning Classifiers from Only Positive and Unlabeled Data","volume":"58","author":"Elkan C.","year":"2008","unstructured":"ElkanC. and NotoK., Learning Classifiers from Only Positive and Unlabeled Data, In Proceedings of the 14th International Conference on Knowledge Discovery and Data Mining, LasVegas, Nevada, USA.ACM. 58(1) (2008), 213\u2013220.","journal-title":"Proceedings of the 14th International Conference on Knowledge Discovery and Data Mining"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.08.001"},{"issue":"1","key":"e_1_3_2_24_2","first-page":"228","article-title":"Learning Gene Regulatory Networks from Only Positive and Unlabeled Data","volume":"11","author":"Luigi C.","year":"2010","unstructured":"LuigiC., CharlesE. and MicheleC., Learning Gene Regulatory Networks from Only Positive and Unlabeled Data, Bioinformatics 11(1) (2010), 228\u2013240.","journal-title":"Bioinformatics"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1162\/089976601750264965"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.07.002"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.56"},{"key":"e_1_3_2_28_2","first-page":"448","article-title":"Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression","volume":"20","author":"Lee W.S.","year":"2003","unstructured":"LeeW.S. and LiuB., Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression, In Proceedings of the 20th International Conference on Machine Learning, Washington DC, United States. AAAI. 20 (2003), 448\u2013455.","journal-title":"Proceedings of the 20th International Conference on Machine Learning"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31362-2_21"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.03.066"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1076-z"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.9.6.1494-1502"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.05.128"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1974-0340523-6"},{"key":"e_1_3_2_35_2","unstructured":"HanH. MuJ.J. and HeY.C. Coset Partitioning Construction of Systematic Permutation Codes Under the Chebyshev Metric IEEE Transactions on Communications (99) (2019) 1-1"},{"key":"e_1_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Dodge Yadolah (EDT) Statistical data analysis based on the L1-norm and related methods 6(4) (2002) R3\u2013R3.","DOI":"10.1007\/978-3-0348-8201-9"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-015-0677-y"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","unstructured":"SellamanickamS. GargP. and SelvarajS.K. A pairwise Ranking Based Approach to Learning with Positive and Unlabeled Examples. In Proceedings of the 20th ACM International Conference on Information and Knowledge Management Glasgow United Kingdom. ACM NewYork USA. (2011) 663\u2013672.","DOI":"10.1145\/2063576.2063675"},{"key":"e_1_3_2_39_2","unstructured":"JohnC. Platt Sequential Minimal Optimization: A Fast Algorithm forTraining SupportVector Machines [D] (1998)"},{"key":"e_1_3_2_40_2","unstructured":"LinZ.R. (2016). LIBSVM. http:\/\/www.csie.ntu.edu.tw\/cjlin\/libsvm."},{"key":"e_1_3_2_41_2","unstructured":"BlakeC.L. and MerzC.J. (1998) UCI Repository for Machine Learning Databases: http:\/\/archive.ics.uci.edu\/ml\/datasets.php."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-192064","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-192064","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-192064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:32Z","timestamp":1777455632000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-192064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,14]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,10,7]]}},"alternative-id":["10.3233\/JIFS-192064"],"URL":"https:\/\/doi.org\/10.3233\/jifs-192064","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,14]]}}}