{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T04:36:24Z","timestamp":1767414984496},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,7,1]]},"DOI":"10.1587\/transinf.2019edp7238","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T22:13:24Z","timestamp":1593555204000},"page":"1683-1692","source":"Crossref","is-referenced-by-count":3,"title":["Sparsity Reduction Technique Using Grouping Method for Matrix Factorization in Differentially Private Recommendation Systems"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Taewhan","family":"KIM","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Sogang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangsoo","family":"JUNG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Sogang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seog","family":"PARK","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Sogang University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] F. Bach, \u201cStructured sparse methods for matrix factorization,\u201d http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.636.945&rep=rep1&type=pdf, 2011."},{"key":"2","unstructured":"[2] N. Gillis, \u201cSparse and unique nonnegative matrix factorization through data preprocessing,\u201d Journal of Machine Learning Research, vol.13, pp.3349-3386, 2012."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. Narayanan and S. Vitaly, \u201cRobust de-anonymization of large sparse datasets,\u201d University of Texas at Austin, 2008. 10.1109\/sp.2008.33","DOI":"10.1109\/SP.2008.33"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Y. Koren, R. Bell, and C. Volinsky, \u201cMatrix factorization techniques for recommender systems,\u201d Computers, vol.42, no.8, pp.30-37, 2009. 10.1109\/mc.2009.263","DOI":"10.1109\/MC.2009.263"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Dwork, \u201cDifferential privacy: A survey of results,\u201d International Conference on Theory and Applications of Models of Computation, pp.1-19, 2008. 10.1007\/978-3-540-79228-4_1","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] C. Dwork, F. McSherry, K. Nissim, and A. Smith, \u201cCalibrating noise to sensitivity in private data analysis,\u201d International Conference on Theory of Cryptography, pp.265-284, 2006. 10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A. Calandrino, A. Kilzer, A. Narayanan, E.W. Felten, and V. Shmatikov, \u201cYou Might Also Like: Privacy Risks of Collaborative Filtering,\u201d IEEE Symposium on Security and Privacy, pp.231-246, 2011. 10.1109\/sp.2011.40","DOI":"10.1109\/SP.2011.40"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Canny, \u201cCollaborative filtering with privacy,\u201d IEEE Symposium on Security and Privacy, pp.45-57, 2002. 10.1109\/secpri.2002.1004361","DOI":"10.1145\/564376.564419"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] V. Nikolaenko, S. Ioannidis, U. Weinsberg, M. Joye, N. Taft, and D. Boneh, \u201cPrivacy-preserving matrix factorization,\u201d Proc. 2013 ACM SIGSAC conference on Computer & communications security, pp.801-812, 2013. 10.1145\/2508859.2516751","DOI":"10.1145\/2508859.2516751"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] F. McSherry and M. Ilya, \u201cDifferentially private recommender systems: Building privacy into the netflix prize contenders,\u201d Proc. 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.627-636, 2009. 10.1145\/1557019.1557090","DOI":"10.1145\/1557019.1557090"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A. Berlioz, A. Friedman, M.A. Kaafar, R. Boreli, and S. Berkovsky, \u201cApplying differential privacy to matrix factorization,\u201d Proc. 9th ACM Conference on Recommender Systems, pp.107-114, 2015. 10.1145\/2792838.2800173","DOI":"10.1145\/2792838.2800173"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R. Balu and T. Furon, \u201cDifferentially private matrix factorization using sketching techniques,\u201d Proc. 4th ACM Workshop on Information Hiding and Multimedia Security, pp.57-62, 2016. 10.1145\/2909827.2930793","DOI":"10.1145\/2909827.2930793"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Shin, S. Kim, J. Shin, and X. Xiao, \u201cPrivacy enhanced matrix factorization for recommendation with local differential privacy,\u201d IEEE Trans. Knowl. Data Eng., vol.30, no.9, pp.1770-1782, 2018. 10.1109\/tkde.2018.2805356","DOI":"10.1109\/TKDE.2018.2805356"},{"key":"14","unstructured":"[14] S. Niwattanakul, et al., \u201cUsing of Jaccard coefficient for keywords similarity,\u201d Proc. International MultiConference of Engineers and Computer Scientists, pp.380-384, 2013."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] S.L. Warner, \u201cRandomized response: A survey technique for eliminating evasive answer bias,\u201d Journal of the American Statistical Association, vol.60, pp.63-69, 1965. 10.1080\/01621459.1965.10480775","DOI":"10.1080\/01621459.1965.10480775"},{"key":"16","unstructured":"[16] MovieLens dataset, available: https:\/\/grouplens.org\/datasets\/movielens\/100k\/"},{"key":"17","unstructured":"[17] Book Crossing dataset, available: http:\/\/www2.informatik.uni-freiburg.de\/~cziegler\/BX\/"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/7\/E103.D_2019EDP7238\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T07:01:34Z","timestamp":1696316494000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/7\/E103.D_2019EDP7238\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":17,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019edp7238","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,1]]}}}