{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:56Z","timestamp":1750220756799,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"1s","license":[{"start":{"date-parts":[[2021,1,31]],"date-time":"2021-01-31T00:00:00Z","timestamp":1612051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China Youth Fund","award":["6190070373"],"award-info":[{"award-number":["6190070373"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61976109, 61772252"],"award-info":[{"award-number":["61976109, 61772252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Liaoning Ministry of Education Youth Fund","award":["LQ2019029"],"award-info":[{"award-number":["LQ2019029"]}]},{"DOI":"10.13039\/501100005047","name":"Liaoning Natural Science Foundation","doi-asserted-by":"crossref","award":["20180550542"],"award-info":[{"award-number":["20180550542"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100017683","name":"Dalian Science and Technology Innovation Fund","doi-asserted-by":"crossref","award":["2018J12GX047"],"award-info":[{"award-number":["2018J12GX047"]}],"id":[{"id":"10.13039\/501100017683","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Dalian Key Laboratory Special Fund"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2021,1,31]]},"abstract":"<jats:p>\n            With the development of social media sites, user credit grading, which served as an important and fashionable problem, has attracted substantial attention from a slew of developers and operators of mobile applications. In particular, multi-grades of user credit aimed to achieve (1) anomaly detection and risk early warning and (2) personalized information and service recommendation for privileged users. The above two goals still remained as up-to-date challenges. To these ends, in this article, we propose a novel regression-based method. Technically speaking, we define three natural ordered categories including\n            <jats:italic>BlockList<\/jats:italic>\n            ,\n            <jats:italic>GeneralList<\/jats:italic>\n            , and\n            <jats:italic>AllowList<\/jats:italic>\n            according to users\u2019 registration and behavior information, which preserve both the global hierarchical relationship of user credit and the local coincident features of users, and hence formulate user credit grading as the ordinal regression problem. Our method is inspired by KDLOR (\n            <jats:italic>kernel discriminant learning for ordinal regression<\/jats:italic>\n            ), which is an effective and efficient model to solve ordinal regression by mapping high-dimension samples to the discriminant region with supervised conditions. However, the performance of KDLOR is fragile to the extreme imbalanced distribution of users. To address this problem, we propose a robust sampling model to balance distribution and avoid overfit or underfit learning, which induces the triplet metric constraint to obtain hard negative samples that well represent the latent ordered class information. A step further, another salient problem lies in ambiguous samples that are noises or located in the classification boundary to impede optimized mapping and embedding. To this problem, we improve sampling by identifying and evading noises in triplets to obtain hard negative samples to enhance robustness and effectiveness for ordinal regression. We organized training and testing datasets for user credit grading by selecting limited items from real-life huge tables of users in the mobile application, which are used in similar problems; moreover, we theoretically and empirically demonstrate the advantages of the proposed model over established datasets.\n          <\/jats:p>","DOI":"10.1145\/3408303","type":"journal-article","created":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T01:53:55Z","timestamp":1617242035000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Ordinal Regression: User Credit Grading with Triplet Loss-Based Sampling"],"prefix":"10.1145","volume":"17","author":[{"given":"Jing","family":"Zhang","sequence":"first","affiliation":[{"name":"Liaoning Normal University, Dalian, China"}]},{"given":"Jiaqi","family":"Guo","sequence":"additional","affiliation":[{"name":"Liaoning Normal University, Dalian, China"}]},{"given":"Yonggong","family":"Ren","sequence":"additional","affiliation":[{"name":"Liaoning Normal University, Dalian, China"}]}],"member":"320","published-online":{"date-parts":[[2021,3,31]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"R. Mori. 1992. System for storing history of use of programs including user credit data and having access by the proprietor: U.S. Patent 5 103 392[P]. 1992-4-7.  R. Mori. 1992. System for storing history of use of programs including user credit data and having access by the proprietor: U.S. Patent 5 103 392[P]. 1992-4-7."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331196"},{"key":"e_1_2_1_3_1","volume-title":"2018 International Conference on Information Management and Processing (ICIMP\u201918)","author":"T. Yuan","year":"2018","unstructured":"T. Yuan et al. 2018 . MS-UCF: A reliable recommendation method based on mood-sensitivity identification and user credit . In 2018 International Conference on Information Management and Processing (ICIMP\u201918) . IEEE, 16\u201320. T. Yuan et al. 2018. MS-UCF: A reliable recommendation method based on mood-sensitivity identification and user credit. In 2018 International Conference on Information Management and Processing (ICIMP\u201918). IEEE, 16\u201320."},{"key":"e_1_2_1_4_1","unstructured":"S. Kasower. 2017. Indirect monitoring and reporting of a user\u2019s credit data: U.S. Patent Application 15\/482 318[P]. 2017-9-28.  S. Kasower. 2017. Indirect monitoring and reporting of a user\u2019s credit data: U.S. Patent Application 15\/482 318[P]. 2017-9-28."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfs.2019.05.005"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2878970"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2806233"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2655449"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00214"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.532"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2017.1316280"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2005.07.007"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44795-4_13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.170"},{"volume-title":"Workshop on Learning from Imbalanced Datasets II. Washington, DC: Citeseer, 11: 1\u20138.","author":"Drummond C.","key":"e_1_2_1_15_1","unstructured":"C. Drummond and R. C. Holte . C4. 5, class imbalance, and cost sensitivity: Why under-sampling beats over-sampling . In Workshop on Learning from Imbalanced Datasets II. Washington, DC: Citeseer, 11: 1\u20138. C. Drummond and R. C. Holte. C4. 5, class imbalance, and cost sensitivity: Why under-sampling beats over-sampling. In Workshop on Learning from Imbalanced Datasets II. Washington, DC: Citeseer, 11: 1\u20138."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.12.021"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2365780"},{"volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 815\u2013823","author":"Schroff F.","key":"e_1_2_1_18_1","unstructured":"F. Schroff , D. Kalenichenko , and J. Philbin . 2015. Facenet: A unified embedding for face recognition and clustering . In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 815\u2013823 . F. Schroff, D. Kalenichenko, and J. Philbin. 2015. Facenet: A unified embedding for face recognition and clustering. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 815\u2013823."},{"key":"e_1_2_1_19_1","first-page":"118","article-title":"Predicting user ratings with XGBoost algorithm","volume":"3","author":"Yang G.","year":"2019","unstructured":"G. Yang , X. Xu , and F. Zhao . 2019 . Predicting user ratings with XGBoost algorithm . Data Analysis and Knowledge Discovery 3 , 1 (2019), 118 \u2013 126 . G. Yang, X. Xu, and F. Zhao. 2019. Predicting user ratings with XGBoost algorithm. Data Analysis and Knowledge Discovery 3, 1 (2019), 118\u2013126.","journal-title":"Data Analysis and Knowledge Discovery"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.04.013"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.12.002"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.09.034"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.07.017"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.050"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2971354"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.050"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2016.10.001"},{"volume-title":"2019 IEEE Winter Conference on Applications of Computer Vision (WACV\u201919)","author":"Polania L.","key":"e_1_2_1_28_1","unstructured":"L. Polania , G. Fung , and D. Wang . 2019. Ordinal regression using noisy pairwise comparisons for body mass index range estimation . In 2019 IEEE Winter Conference on Applications of Computer Vision (WACV\u201919) . IEEE, 782\u2013790. L. Polania, G. Fung, and D. Wang. 2019. Ordinal regression using noisy pairwise comparisons for body mass index range estimation. In 2019 IEEE Winter Conference on Applications of Computer Vision (WACV\u201919). IEEE, 782\u2013790."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2457911"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44795-4_13"},{"key":"e_1_2_1_31_1","first-page":"47","article-title":"An ensemble of weighted support vector machines for ordinal regression","volume":"3","author":"Waegeman W.","year":"2009","unstructured":"W. Waegeman and L. Boullart . 2009 . An ensemble of weighted support vector machines for ordinal regression . International Journal of Computer Systems Science and Engineering 3 , 1 (2009), 47 \u2013 51 . W. Waegeman and L. Boullart. 2009. An ensemble of weighted support vector machines for ordinal regression. International Journal of Computer Systems Science and Engineering 3, 1 (2009), 47\u201351.","journal-title":"International Journal of Computer Systems Science and Engineering"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.08.022"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.06.023"},{"volume-title":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence). IEEE, 1279\u20131284","author":"Cheng J.","key":"e_1_2_1_34_1","unstructured":"J. Cheng , Z. Wang , and G. Pollastri . 2008. A neural network approach to ordinal regression . In 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence). IEEE, 1279\u20131284 . J. Cheng, Z. Wang, and G. Pollastri. 2008. A neural network approach to ordinal regression. In 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence). IEEE, 1279\u20131284."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1174(199703)6:1<23::AID-ISAF113>3.0.CO;2-4"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3060832.3060922"},{"key":"e_1_2_1_37_1","unstructured":"Yang Wang. 2020. Survey on deep multi-modal data analytics: Collaboration rivalry and fusion. ACM Trans. Multimedia Computing arXiv preprint arXiv:2006.08159.  Yang Wang. 2020. Survey on deep multi-modal data analytics: Collaboration rivalry and fusion. ACM Trans. Multimedia Computing arXiv preprint arXiv:2006.08159."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382336.2382370"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1980.tb01109.x"},{"volume-title":"Categorical Data Analysis","author":"Agresti A.","key":"e_1_2_1_40_1","unstructured":"A. Agresti . 2003. Categorical Data Analysis . John Wiley & Sons . A. Agresti. 2003. Categorical Data Analysis. John Wiley & Sons."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2998981.2999059"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87987-9_6"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2009.2017533"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1058114"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2342533"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2339100"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294825"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900486"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3408303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:39:02Z","timestamp":1750199942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,31]]},"references-count":48,"journal-issue":{"issue":"1s","published-print":{"date-parts":[[2021,1,31]]}},"alternative-id":["10.1145\/3408303"],"URL":"https:\/\/doi.org\/10.1145\/3408303","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2021,1,31]]},"assertion":[{"value":"2020-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}