{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:09:46Z","timestamp":1725883786292},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566078"},{"type":"electronic","value":"9783319566085"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56608-5_24","type":"book-chapter","created":{"date-parts":[[2017,4,7]],"date-time":"2017-04-07T10:25:19Z","timestamp":1491560719000},"page":"304-316","source":"Crossref","is-referenced-by-count":3,"title":["Feature-Oriented Analysis of User Profile Completion Problem"],"prefix":"10.1007","author":[{"given":"Morteza","family":"Haghir Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,8]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A Berman","year":"1994","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York (1994)"},{"issue":"6","key":"24_CR2","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Candes","year":"2009","unstructured":"Candes, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Computat. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Computat. Math."},{"issue":"5","key":"24_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.dam.2010.11.017","volume":"159","author":"P Chebotarev","year":"2011","unstructured":"Chebotarev, P.: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discrete Appl. Math. 159(5), 295\u2013302 (2011)","journal-title":"Discrete Appl. Math."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H.: K-nearest neighbor search and outlier detection via minimax distances. In: Proceedings of the 2016 SIAM International Conference on Data Mining, Miami, Florida, USA, 5\u20137 May 2016, pp. 405\u2013413 (2016)","DOI":"10.1137\/1.9781611974348.46"},{"issue":"3","key":"24_CR5","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"1","key":"24_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TPAMI.2008.277","volume":"32","author":"CHQ Ding","year":"2010","unstructured":"Ding, C.H.Q., Li, T., Jordan, M.I.: Convex and semi-nonnegative matrix factorizations. IEEE Trans. Pattern Anal. Mach. Intell. 32(1), 45\u201355 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.neunet.2012.03.001","volume":"31","author":"F Fouss","year":"2012","unstructured":"Fouss, F., Francoisse, K., Yen, L., Pirotte, A., Saerens, M.: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Networks 31, 53\u201372 (2012)","journal-title":"Neural Networks"},{"issue":"3","key":"24_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"24_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815867","volume-title":"Statistical Models: Theory and Practice","author":"DA Freedman","year":"2009","unstructured":"Freedman, D.A.: Statistical Models: Theory and Practice. Cambridge University Press, Cambridge (2009)"},{"issue":"2","key":"24_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"HN Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109\u2013122 (1986)","journal-title":"Combinatorica"},{"issue":"5","key":"24_CR12","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF02163027","volume":"14","author":"G Golub","year":"1970","unstructured":"Golub, G., Reinsch, C.E.R.: Singular value decomposition and least squares solutions. Numer. Math. 14(5), 403\u2013420 (1970)","journal-title":"Numer. Math."},{"key":"24_CR13","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD Archive, Irvine, CA. University of California, Department of Information and Computer Science (1999). http:\/\/kdd.ics.uci.edu"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0024-3795(00)00299-8","volume":"328","author":"L Hogben","year":"2001","unstructured":"Hogben, L.: Graph theoretic methods for matrix completion problems. Linear Algebra Appl. 328, 161\u2013202 (2001)","journal-title":"Linear Algebra Appl."},{"key":"24_CR15","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Hsieh, C.-J., Dhillon, I.S.: Fast coordinate descent methods with variable selection for non-negative matrix factorization. In: 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1064\u20131072 (2011)","DOI":"10.1145\/2020408.2020577"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1287\/opre.9.6.898","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu, T.C.: The maximum capacity route problem. Oper. Res. 9, 898\u2013900 (1961)","journal-title":"Oper. Res."},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1090\/psapm\/040\/1059486","volume":"40","author":"CR Johnson","year":"1990","unstructured":"Johnson, C.R.: Matrix completion problems: a survey. Matrix Theory Appl. 40, 171\u2013176 (1990)","journal-title":"Matrix Theory Appl."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Kim, K.-H., Choi, S.: Neighbor search with global geometry: a minimax message passing algorithm. In: ICML, pp. 401\u2013408 (2007)","DOI":"10.1145\/1273496.1273547"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Kim, K.-H., Choi, S.: Walking on minimax paths for K-NN search. In: AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8588"},{"key":"24_CR21","doi-asserted-by":"crossref","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 nonnegative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"24_CR22","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems 13, pp. 556\u2013562. MIT Press (2001)"},{"key":"24_CR23","unstructured":"Lichman, M.: UCI Machine Learning Repository, Irvine, CA. University of California, School of Information and Computer Science (2013). http:\/\/archive.ics.uci.edu\/ml"},{"volume-title":"Matrix Analysis and Applied Linear Algebra","year":"2000","key":"24_CR24","unstructured":"Meyer, C.D. (ed.): Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"24_CR25","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.dss.2014.03.001","volume":"62","author":"S Moro","year":"2014","unstructured":"Moro, S., Cortez, P., Rita, P.: A data-driven approach to predict the success of bank telemarketing. Decis. Support Syst. 62, 22\u201331 (2014)","journal-title":"Decis. Support Syst."},{"key":"24_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6911(93)90038-8","volume":"21","author":"AS Morse","year":"1993","unstructured":"Morse, A.S.: A gain matrix decomposition and some of its applications. Syst. Control Lett. 21, 1\u201310 (1993)","journal-title":"Syst. Control Lett."},{"key":"24_CR27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2690882","volume":"72","author":"R Piziak","year":"1999","unstructured":"Piziak, R., Odell, P.L.: Full rank factorization of matrices. Math. Mag. 72, 193\u2013201 (1999)","journal-title":"Math. Mag."},{"issue":"6","key":"24_CR28","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"5500","key":"24_CR29","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319 (2000)","journal-title":"Science"},{"key":"24_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0024-3795(03)00370-7","volume":"368","author":"X Hongguo","year":"2003","unstructured":"Hongguo, X.: An SVD-like matrix decomposition and its applications. Linear Algebra Appl. 368, 1\u201324 (2003)","journal-title":"Linear Algebra Appl."},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Yen, L., Saerens, M., Mantrach, A., Shimbo, M.: A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In: KDD, pp. 785\u2013793 (2008)","DOI":"10.1145\/1401890.1401984"},{"issue":"10\u201312","key":"24_CR32","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1016\/j.neucom.2008.01.022","volume":"71","author":"T Zhang","year":"2008","unstructured":"Zhang, T., Fang, B., Liu, W., Tang, Y.Y., He, G., Wen, J.: Total variation norm-based nonnegative matrix factorization for identifying discriminant representation of image patterns. Neurocomputing 71(10\u201312), 1824\u20131831 (2008)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56608-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T01:43:07Z","timestamp":1692754987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56608-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566078","9783319566085"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56608-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}