{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T09:10:04Z","timestamp":1751793004891,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992464"},{"type":"electronic","value":"9783319992471"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99247-1_32","type":"book-chapter","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T14:26:21Z","timestamp":1533911181000},"page":"361-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Trust-Distrust Aware Recommendation by Integrating Metric Learning with Matrix Factorization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2073-1631","authenticated-orcid":false,"given":"Xianglin","family":"Zuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4863-9909","authenticated-orcid":false,"given":"Xing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1927-8419","authenticated-orcid":false,"given":"Bo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,11]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Rennie, J.D.M., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. In: Luc, D.R., Stefan, W. (eds.) Proceedings of the 22th International Conference on Machine Learning, pp. 713\u2013719. ACM, New York (2005)","DOI":"10.1145\/1102351.1102441"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2013.06.009","volume":"41","author":"X Yang","year":"2014","unstructured":"Yang, X., Liu, G.Y., Steck, H.: A survey of collaborative filtering based social recommender systems. Comput. Commun. 41, 1\u201310 (2014)","journal-title":"Comput. Commun."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Ma, H., Yang, H., Lyu, M.R., King, I.: SoRec:social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM, pp. 931\u2013940. ACM, New York (2008)","DOI":"10.1145\/1458082.1458205"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/11755593_8","volume-title":"Trust Management","author":"J Golbeck","year":"2006","unstructured":"Golbeck, J.: Generating predictive movie recommendations from trust in social networks. In: St\u00f8len, K., Winsborough, W.H., Martinelli, F., Massacci, F. (eds.) iTrust 2006. LNCS, vol. 3986, pp. 93\u2013104. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11755593_8"},{"key":"32_CR5","unstructured":"McFee, B., Barrington, L., Lanckriet, G.: Learning similarity from collaborative filters. In: The 11th International Society for Music Information Retrieval Conference, Utrecht, Netherlands, pp. 345\u2013350 (2010)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Massa, P., Avesani P.: Trust-aware recommender systems. In: Proceedings of the ACM Conference on Recommender Systems, pp. 17\u201324. ACM, New York (2007)","DOI":"10.1145\/1297231.1297235"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Jamali, M., Ester, M.: TrustWalker: a random walk model for combining trust-based and item-based recommendation. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 397\u2013406. ACM, New York (2009)","DOI":"10.1145\/1557019.1557067"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Lescovec, J., Hutteenlocher, D., Kleinberg J.: Predicting positive and negative links in online social networks. In: Proceedings of the 19th International Conference on World Wide Web, pp. 641\u2013650. ACM, New York (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the 4th ACM Conference on Recommender Systems, pp. 135\u2013142. ACM, New York (2010)","DOI":"10.1145\/1864708.1864736"},{"issue":"15","key":"32_CR11","first-page":"1","volume":"17","author":"J Lee","year":"2016","unstructured":"Lee, J., Kim, S.: LLORMA: local low-rank matrix approximation. J. Mach. Learn. Res. 17(15), 1\u201324 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Zhao, H., Yao Q., Kwok, J. T., Lee, D.: Collaborative filtering with social local models. In: Vijay, R., Srinivas, A., George, K., Lucio, M., Xindong, W. (eds.) Proceedings of the 2017 IEEE International Conference on Data Mining, Los Alamitos, CA, USA, pp. 645\u2013654. IEEE Computer Society (2017)","DOI":"10.1109\/ICDM.2017.74"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/TPAMI.2008.277","volume":"32","author":"C Ding","year":"2008","unstructured":"Ding, C., Li, T., Jordan, M.I.: Convex and semi-nonnegative matrix factorizations. IEEE Trans. Pattern Anal. Mach. Intell. 32(1), 45\u201355 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2641564","volume":"32","author":"R Forsati","year":"2014","unstructured":"Forsati, R., Mahdavi, M., Shamsfard, M., Mohamed, S.: Matrix factorization with explicit trust and distrust side information for improved social recommendation. ACM Trans. Inf. Syst. 32(4), 17:1\u201317:38 (2014)","journal-title":"ACM Trans. Inf. Syst."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Bai, T., Yang, B., Li, F.: TDRec: enhancing social recommendation using both trust and distrust information. In: Proceedings of the Second European Network Intelligence, Karlskrona, Sweden, pp. 60\u201366. IEEE Computer Society, Washington, DC (2015)","DOI":"10.1109\/ENIC.2015.17"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.knosys.2016.05.037","volume":"106","author":"W-P Lee","year":"2016","unstructured":"Lee, W.-P., Ma, C.-Y.: Enhancing collaborative recommendation performance by combining user preference and trust-distrust propagation in social networks. Knowl.-Based Syst. 106, 125\u2013134 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"13326","DOI":"10.1109\/ACCESS.2018.2806488","volume":"6","author":"X Zuo","year":"2018","unstructured":"Zuo, X., Liu, X., Yang, B.: Coupled low rank approximation for collaborative filtering in social networks. IEEE Access 6, 13326\u201313335 (2018)","journal-title":"IEEE Access"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Tang, J., Charu, A.: Recommendations in signed social networks. In: Proceedings of the 25th International World Wide Web Conference, pp. 31\u201340. ACM, New York (2016)","DOI":"10.1145\/2872427.2882971"},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MIS.2011.22","volume":"26","author":"P Victor","year":"2011","unstructured":"Victor, P., Cornelis, M., Cock, D., Teredesai, A.M.: Trust and distrust-based recommendation for controversial reviews. IEEE Intell. Syst. 26(1), 48\u201355 (2011)","journal-title":"IEEE Intell. Syst."},{"key":"32_CR20","first-page":"505","volume":"15","author":"EP Xing","year":"2003","unstructured":"Xing, E.P., Ng, A.Y., Jordan, M.I., Russel, S.: Distance metric learning, with application to clustering with side-information. Adv. Neural. Inf. Process. Syst. 15, 505\u2013512 (2003)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Davis, J.V., Kulis, B., Jain, P., Sra, S., Dhillon, I.: Information-theoretic metric learning. In: Proceeding of the 24th International Conference on Machine Learning, pp. 209\u2013216. ACM, New York (2007)","DOI":"10.1145\/1273496.1273523"},{"key":"32_CR22","unstructured":"Slaney, M., Weinberger, K., White, W.: Learning a metric for music similarity. In: Bello, J.P., Chew, E., Tumbull, D. (eds.) Proceedings of the 9th International Symposium on Music Information Retrieval, ISMIR 2008, Philadelphia, PA, USA, pp. 313\u2013318 (2008)"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Guillaumin, M., Verbeek, J., Schmid, C.: Is that you? Metric learning approaches for face identification. In: Proceeding of the 12th IEEE International Conference on Computer Vision, pp. 498\u2013505. IEEE Xplore (2009)","DOI":"10.1109\/ICCV.2009.5459197"},{"key":"32_CR24","first-page":"207","volume":"10","author":"KQ Weinberger","year":"2009","unstructured":"Weinberger, K.Q., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. J. Mach. Learn. Res. 10, 207\u2013244 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Kiwiel, K.C.: Convergence and efficiency of sub-gradient methods for quasi convex minimization. Math. Program. (Ser. A) 90(1), 1\u201325 (2001)","DOI":"10.1007\/PL00011414"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99247-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T08:52:18Z","timestamp":1751791938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99247-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992464","9783319992471"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99247-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ksem2018.venue.link\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"262","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"We have 3 reviews for 235 submissions, 4 reviews for 25 submissions and 5 review for 2 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}