{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T09:46:38Z","timestamp":1723801598758},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science and ICT","award":["No. 2020-0-01373","Artificial Intelligence Graduate School Program (Hanyang University)"],"award-info":[{"award-number":["No. 2020-0-01373","Artificial Intelligence Graduate School Program (Hanyang University)"]}]},{"name":"Ministry of Science and ICT","award":["NRF-2020R1A2B5B03001960"],"award-info":[{"award-number":["NRF-2020R1A2B5B03001960"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11227-020-03573-8","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T11:03:20Z","timestamp":1609758200000},"page":"6832-6851","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting uninteresting items for effective graph-based one-class collaborative filtering"],"prefix":"10.1007","volume":"77","author":[{"given":"Yeon-Chang","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwon","family":"Son","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taeho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daeyoung","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"3573_CR1","doi-asserted-by":"crossref","unstructured":"Appel A, Chakrabarti D, Faloutsos C, Kumar R, Leskovec J, Tomkins A (2009) ShatterPlots: Fast tools for mining large graphs. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp 802\u2013813","DOI":"10.1137\/1.9781611972795.69"},{"key":"3573_CR2","unstructured":"Breese JS, Heckerman D, Kadie C (1998) Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of the International Conference on Uncertainty in Artificial Intelligence (UAI), pp 43\u201352"},{"key":"3573_CR3","doi-asserted-by":"publisher","first-page":"10390","DOI":"10.1109\/ACCESS.2020.2965544","volume":"8","author":"X Cai","year":"2020","unstructured":"Cai X, Shang J, Jin Z, Liu F, Qiang B, Xie W, Zhao L (2020) DBGE: employee turnover prediction based on dynamic bipartite graph embedding. IEEE Access 8:10390\u201310402","journal-title":"IEEE Access"},{"issue":"5","key":"3573_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright D, Harary F (1956) Structural balance: a generalization of heider\u2019s theory. Psycholo Rev 63(5):277","journal-title":"Psycholo Rev"},{"key":"3573_CR5","doi-asserted-by":"crossref","unstructured":"Chae D, Kang J, Kim S, Lee J (2018) CFGAN: A generic collaborative filtering framework based on generative adversarial networks. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp 137\u2013146","DOI":"10.1145\/3269206.3271743"},{"key":"3573_CR6","doi-asserted-by":"crossref","unstructured":"Chen L, Wu L, Hong R, Zhang K, Wang M (2020) Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp 27\u201334","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"3573_CR7","doi-asserted-by":"crossref","unstructured":"Cho K, Lee Y, Han K, Choi J, Kim S (2019) No, that\u2019s not my feedback: TV show recommendation using watchable interval. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp 316\u2013327","DOI":"10.1109\/ICDE.2019.00036"},{"key":"3573_CR8","doi-asserted-by":"crossref","unstructured":"Derr T, Johnson C, Chang Y, Tang J (2019) Balance in signed bipartite networks. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp 1221\u20131230","DOI":"10.1145\/3357384.3358009"},{"issue":"3","key":"3573_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Renders JM, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Know Data Eng 19(3):355\u2013369","journal-title":"IEEE Trans Know Data Eng"},{"key":"3573_CR10","unstructured":"Hamilton WL, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Annual Conference on Neural Information Processing Systems (NIPS), pp 1024\u20131034"},{"key":"3573_CR11","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: Simplifying and powering graph convolution network for recommendation. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"3573_CR12","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua T (2017) Neural collaborative filtering. In: Proceedings of The Web Conference (WWW), pp 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"key":"3573_CR13","doi-asserted-by":"crossref","unstructured":"He X, Zhang H, Kan M, Chua T (2016) Fast matrix factorization for online recommendation with implicit feedback. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp 549\u2013558","DOI":"10.1145\/2911451.2911489"},{"issue":"1","key":"3573_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","volume":"21","author":"F Heider","year":"1946","unstructured":"Heider F (1946) Attitudes and cognitive organization. J Ppsychol 21(1):107\u2013112","journal-title":"J Ppsychol"},{"key":"3573_CR15","doi-asserted-by":"crossref","unstructured":"Hwang WS, Parc J, Kim SW, Lee J, Lee D (2016) \u201cTold You I Didn\u2019t Like It\u201d: Exploiting uninteresting items for effective collaborative filtering. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE), pp 349\u2013360","DOI":"10.1109\/ICDE.2016.7498253"},{"key":"3573_CR16","doi-asserted-by":"crossref","unstructured":"Jang MH, Faloutsos C, Kim SW, Kang U, Ha J (2016) PIN-TRUST: Fast trust propagation exploiting positive, implicit, and negative information. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp 629\u2013638","DOI":"10.1145\/2983323.2983753"},{"key":"3573_CR17","doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2000) IR evaluation methods for retrieving highly relevant documents. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp 41\u201348","DOI":"10.1145\/345508.345545"},{"key":"3573_CR18","doi-asserted-by":"crossref","unstructured":"Jo Y, Jang M, Kim S, Park S (2019) Realgraph: A graph engine leveraging the power-law distribution of real-world graphs. In: Proceedings of The Web Conference (WWW), pp 807\u2013817","DOI":"10.1145\/3308558.3313434"},{"key":"3573_CR19","doi-asserted-by":"crossref","unstructured":"Jung J, Jin W, Lee S, Kang U (2016) Personalized ranking in signed networks using signed random walk with restart. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp 973\u2013978","DOI":"10.1109\/ICDM.2016.0122"},{"key":"3573_CR20","unstructured":"Jung J, Park H, Kang U (2020) BalanSiNG: Fast and scalable generation of realistic signed networks. In: Proceedings of the International Conference on Extending Database Technology (EDBT), pp 193\u2013204"},{"issue":"1","key":"3573_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TKDE.2017.2698461","volume":"31","author":"J Lee","year":"2019","unstructured":"Lee J, Hwang W, Parc J, Lee Y, Kim S, Lee D (2019) l-injection: toward effective collaborative filtering using uninteresting items. IEEE Trans Knowl Data Eng 31(1):3\u201316","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3573_CR22","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ins.2016.02.005","volume":"348","author":"J Lee","year":"2016","unstructured":"Lee J, Lee D, Lee Y, Hwang W, Kim S (2016) Improving the accuracy of top-n recommendation using a preference model. Inf Sci 348:290\u2013304","journal-title":"Inf Sci"},{"key":"3573_CR23","doi-asserted-by":"crossref","unstructured":"Lee Y, Kim S, Lee D (2018) gOCCF: Graph-theoretic one-class collaborative filtering based on uninteresting items. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp 3448\u20133456","DOI":"10.1609\/aaai.v32i1.11707"},{"key":"3573_CR24","doi-asserted-by":"crossref","unstructured":"Lee Y, Kim S, Park S, Xie X (2018) How to impute missing ratings?: Claims, solution, and its application to collaborative filtering. In: Proceedings of The Web Conference (WWW), pp 783\u2013792","DOI":"10.1145\/3178876.3186159"},{"key":"3573_CR25","doi-asserted-by":"crossref","unstructured":"Lee Y, Park D, Son J, Kim T, Kim S (2020) Graph-theoretic one-class collaborative filtering using signed random walk with restart. In: Proceedings of the IEEE International Conference on Big Data and Smart Computing (BigComp), pp 98\u2013101","DOI":"10.1109\/BigComp48618.2020.00-93"},{"key":"3573_CR26","doi-asserted-by":"crossref","unstructured":"Lee Y, Seo N, Han K, Kim S (2020) Asine: Adversarial signed network embedding. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp 609\u2013618","DOI":"10.1145\/3397271.3401079"},{"key":"3573_CR27","doi-asserted-by":"crossref","unstructured":"Ning X, Karypis G (2011) SLIM: sparse linear methods for top-n recommender systems. In: Cook DJ, Pei J, Wang W, Za\u00efane OR, Wu X (eds) Proceedings of the IEEE International Conference on Data Mining (ICDM), pp 497\u2013506","DOI":"10.1109\/ICDM.2011.134"},{"key":"3573_CR28","doi-asserted-by":"crossref","unstructured":"Niu W, Caverlee J, Lu H (2018) Neural personalized ranking for image recommendation. In: Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM), pp 423\u2013431","DOI":"10.1145\/3159652.3159728"},{"key":"3573_CR29","volume-title":"The PageRank citation ranking: bringing order to the web","author":"L Page","year":"1999","unstructured":"Page L, Brin S (1999) The PageRank citation ranking: bringing order to the web. Stanford InfoLab, California"},{"key":"3573_CR30","doi-asserted-by":"crossref","unstructured":"Pan R, Zhou Y, Cao B, Liu N, Lukose R, Scholz M, Yang Q (2008) One-class collaborative filtering. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp 502\u2013511","DOI":"10.1109\/ICDM.2008.16"},{"key":"3573_CR31","unstructured":"Pan W, Chen L (2013) GBPR: group preference based bayesian personalized ranking for one-class collaborative filtering. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp 2691\u20132697"},{"key":"3573_CR32","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) BPR: Bayesian personalized ranking from implicit feedback. In: Proceedings of the International Conference on Uncertainty in Artificial Intelligence (UAI), pp 452\u2013461"},{"key":"3573_CR33","volume-title":"Recommender systems handbook","year":"2015","unstructured":"Ricci F, Rokach L, Shapira B (eds) (2015) Recommender systems handbook. Springer, NY"},{"key":"3573_CR34","unstructured":"Srebro N, Jaakkola T (2003) Weighted low-rank approximations. In: Proceedings of the International Conference on Machine Learning (ICML), pp 720\u2013727"},{"key":"3573_CR35","first-page":"421425:1","volume":"2009","author":"X Su","year":"2009","unstructured":"Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:421425:1\u2013421425:19","journal-title":"Adv Artif Intell"},{"key":"3573_CR36","doi-asserted-by":"crossref","unstructured":"Sun J, Guo W, Zhang D, Zhang Y, Regol F, Hu Y, Guo H, Tang R, Yuan H, He X, Coates M (2020) A framework for recommending accurate and diverse items using bayesian graph convolutional neural networks. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), pp 2030\u20132039","DOI":"10.1145\/3394486.3403254"},{"key":"3573_CR37","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Wang M, Feng F, Chua T (2019) Neural graph collaborative filtering. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp 165\u2013174","DOI":"10.1145\/3331184.3331267"},{"key":"3573_CR38","doi-asserted-by":"crossref","unstructured":"Wang X, Rosenblum DS, Wang Y (2012) Context-aware mobile music recommendation for daily activities. In: Proceedings of the ACM International Conference on Multimedia Conference (MM), pp 99\u2013108","DOI":"10.1145\/2393347.2393368"},{"key":"3573_CR39","doi-asserted-by":"crossref","unstructured":"Wang X, Wang Y (2014) Improving content-based and hybrid music recommendation using deep learning. In: Proceedings of the ACM International Conference on Multimedia (MM), pp 627\u2013636","DOI":"10.1145\/2647868.2654940"},{"key":"3573_CR40","doi-asserted-by":"crossref","unstructured":"Wu G, Volkovs M, Soon CL, Sanner S, Rai H (2019) Noise contrastive estimation for one-class collaborative filtering. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp 135\u2013144","DOI":"10.1145\/3331184.3331201"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03573-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03573-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03573-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T10:42:57Z","timestamp":1670668977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03573-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":40,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["3573"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03573-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"14 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}