{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:36:06Z","timestamp":1648647366124},"reference-count":29,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2020,2,1]]},"DOI":"10.1587\/transinf.2019inp0013","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T22:10:06Z","timestamp":1580508606000},"page":"299-308","source":"Crossref","is-referenced-by-count":1,"title":["Anonymization Technique Based on SGD Matrix Factorization"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Tomoaki","family":"MIMOTO","sequence":"first","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seira","family":"HIDANO","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"KIYOMOTO","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuko","family":"MIYAJI","sequence":"additional","affiliation":[{"name":"Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y. Zheng, \u201cTrajectory data mining: An overview,\u201d ACM Trans. Intelligent Systems and Technology, vol.6, no.3, Article No.29, 2015. 10.1145\/2743025","DOI":"10.1145\/2743025"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] J. Krumm, \u201cInference attacks on location tracks,\u201d International Conference on Pervasive Computing, Pervasive 2007, Lecture Notes in Computer Science, vol.4480, pp.127-143, Springer, Berlin, Heidelberg, 2007. 10.1007\/978-3-540-72037-9_8","DOI":"10.1007\/978-3-540-72037-9_8"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Y. Zheng, L. Zhang, X. Xie, and W.-Y. Ma, \u201cMining interesting locations and travel sequences from GPS trajectories,\u201d Proc. 18th International Conference on World Wide Web, pp.791-800, ACM, 2009. 10.1145\/1526709.1526816","DOI":"10.1145\/1526709.1526816"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] V.W. Zheng, Y. Zheng, X. Xie, and Q. Yang, \u201cCollaborative location and activity recommendations with GPS history data,\u201d Proc. 19th International Conference on World Wide Web, pp.1029-1038, ACM, 2010. 10.1145\/1772690.1772795","DOI":"10.1145\/1772690.1772795"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] S. Chawla, Y. Zheng, and J. Hu, \u201cInferring the root cause in road traffic anomalies,\u201d 2012 IEEE 12th International Conference on Data Mining (ICDM), pp.141-150, IEEE, 2012. 10.1109\/icdm.2012.104","DOI":"10.1109\/ICDM.2012.104"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] O. Abul, F. Bonchi, and M. Nanni, \u201cNever walk alone: Uncertainty for anonymity in moving objects databases,\u201d 2008 IEEE 24th International Conference on Data Engineering, pp.376-385, 2008. 10.1109\/icde.2008.4497446","DOI":"10.1109\/ICDE.2008.4497446"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Mimoto, S. Kiyomoto, S. Hidano, A. Basu, and A. Miyaji, \u201cThe possibility of matrix decomposition as anonymization and evaluation for time-sequence data,\u201d 2018 16th Annual Conference on Privacy, Security and Trust, pp.1-7, IEEE, 2018. 10.1109\/pst.2018.8514189","DOI":"10.1109\/PST.2018.8514189"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] P. Samarati and L. Sweeney, \u201cGeneralizing data to provide anonymity when disclosing information,\u201d Proc. PODS 1998, p.188, 1998. 10.1145\/275487.275508","DOI":"10.1145\/275487.275508"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] P. Samarati, \u201cProtecting respondents identities in microdata release,\u201d IEEE Trans. Knowl. Data Eng., vol.13, no.6, pp.1010-1027, 2001. 10.1109\/69.971193","DOI":"10.1109\/69.971193"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Sweeney, \u201cAchieving <i>k<\/i>-anonymity privacy protection using generalization and suppression,\u201d Int. J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol.10, no.5, pp.571-588, 2002. 10.1142\/s021848850200165x","DOI":"10.1142\/S021848850200165X"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, \u201cIncognito: Efficient full-domain <i>k<\/i>-anonymity,\u201d Proc. SIGMOD 2005, pp.49-60, 2005. 10.1145\/1066157.1066164","DOI":"10.1145\/1066157.1066164"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, \u201cMondrian multidimensional k-anonymity,\u201d Proc. 22nd International Conference on Data Engineering (ICDE&apos;06), pp.25-35, IEEE, 2006. 10.1109\/icde.2006.101","DOI":"10.1109\/ICDE.2006.101"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J.-W. Byun, A. Kamra, E. Bertino, and N. Li, \u201cEfficient k-anonymization using clustering techniques,\u201d International Conference on Database Systems for Advanced Applications, DASFAA 2007, Lecture Notes in Computer Science, vol.4443, pp.188-200, Springer, Berlin, Heidelberg, 2007. 10.1007\/978-3-540-71703-4_18","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"14","unstructured":"[14] K. Mivule, \u201cUtilizing noise addition for data privacy, an overview,\u201d arXiv preprint arXiv:1309.3958, 2013."},{"key":"15","unstructured":"[15] J.J. Kim, \u201cA method for limiting disclosure in microdata based on random noise and transformation,\u201d Proc. Section on Survey Research Methods, pp.303-308, American Statistical Association, 1986."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] T. Yu and S. Jajodia, Secure Data Management in Decentralized Systems, Advances in Information Security, vol.33, Springer Science &amp; Business Media, 2007. 10.1007\/978-0-387-27696-0","DOI":"10.1007\/978-0-387-27696-0"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] R.M. Bell and Y. Koren, \u201cLessons from the Netflix prize challenge,\u201d SIGKDD Expl. Newsl., vol.9, no.2, pp.75-79, 2007. 10.1145\/1345448.1345465","DOI":"10.1145\/1345448.1345465"},{"key":"18","unstructured":"[18] J. Nocedal and S.J. Wright, Numerical Optimization, Springer Series in Operations Research and Financial Engineering. Springer Science &amp; Business Media, 2006. 10.1007\/978-0-387-40065-5"},{"key":"19","unstructured":"[19] G. Dror, N. Koenigstein, Y. Koren, and M. Weimer, \u201cThe yahoo! music dataset and kdd-cup&apos;11,\u201d Proc. 2011 International Conference on KDD Cup 2011-Volume 18, pp.3-18, JMLR.org, 2011."},{"key":"20","unstructured":"[20] B. Recht, C. Re, S. Wright, and F. Niu, \u201cHogwild: A lock-free approach to parallelizing stochastic gradient descent,\u201d Advances in Neural Information Processing Systems, pp.693-701, 2011."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] R. Gemulla, E. Nijkamp, P.J. Haas, and Y. Sismanis, \u201cLarge-scale matrix factorization with distributed stochastic gradient descent,\u201d Proc. 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.69-77, ACM, 2011. 10.1145\/2020408.2020426","DOI":"10.1145\/2020408.2020426"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] Y. Zhuang, W.-S. Chin, Y.-C. Juan, and C.-J. Lin, \u201cA fast parallel SGD for matrix factorization in shared memory systems,\u201d Proc. 7th ACM Conference on Recommender Systems, pp.249-256, ACM, 2013. 10.1145\/2507157.2507164","DOI":"10.1145\/2507157.2507164"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] J. Oh, W.-S. Han, H. Yu, and X. Jiang, \u201cFast and robust parallel SGD matrix factorization,\u201d Proc. 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.865-874, ACM, 2015. 10.1145\/2783258.2783322","DOI":"10.1145\/2783258.2783322"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] Y. Zheng, L. Zhang, Z. Ma, X. Xie, and W.-Y. Ma, \u201cRecommending friends and locations based on individual location history,\u201d ACM Trans. Web, vol.5, no.1, Article No.5, 2011. 10.1145\/1921591.1921596","DOI":"10.1145\/1921591.1921596"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] H.W. Kuhn, \u201cThe Hungarian method for the assignment problem,\u201d Naval Research Logistics, vol.2, no.1-2, pp.83-97, 1955. 10.1002\/nav.3800020109","DOI":"10.1002\/nav.3800020109"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, and A.W.-C. Fu, \u201cUtility-based anonymization for privacy preservation with less information loss,\u201d SIGKDD Explor. Newsl., vol.8, no.2, pp.21-30, 2006. 10.1145\/1233321.1233324","DOI":"10.1145\/1233321.1233324"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] D. S\u00e1nchez and M. Batet, \u201cC-sanitized: A privacy model for document redaction and sanitization,\u201d Journal of the Association for Information Science and Technology, vol.67, no.1, pp.148-163, 2016. 10.1002\/asi.23363","DOI":"10.1002\/asi.23363"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] T. Mimoto, S. Kiyomoto, K. Tanaka, and A. Miyaji, \u201c(p, n)-identifiability: Anonymity under practical adversaries,\u201d 2017 IEEE Trustcom\/BigDataSE\/ICESS, pp.996-1003, 2017. 10.1109\/trustcom\/bigdatase\/icess.2017.343","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.343"},{"key":"29","unstructured":"[29] M. Freiman, J. Lucero, L. Singh, J. You, M. DePersio, and L. Zayatz, \u201cThe microdata analysis system at the U.S. census bureau,\u201d SORT Special issue: Privacy in statistical databases, pp.77-98, 2011."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/2\/E103.D_2019INP0013\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T03:27:27Z","timestamp":1580527647000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/2\/E103.D_2019INP0013\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019inp0013","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,1]]}}}