{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T07:10:38Z","timestamp":1657091438399},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T00:00:00Z","timestamp":1471564800000},"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":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s41060-016-0020-3","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T06:26:32Z","timestamp":1471587992000},"page":"131-143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A greedy algorithm to construct sparse graph by using ranked dictionary"],"prefix":"10.1007","volume":"2","author":[{"given":"Shuchu","family":"Han","sequence":"first","affiliation":[]},{"given":"Hong","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,19]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0167-7152(96)00213-1","volume":"35","author":"M Brito","year":"1997","unstructured":"Brito, M., Chavez, E., Quiroz, A., Yukich, J.: Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Stat. Probab. Lett. 35(1), 33\u201342 (1997)","journal-title":"Stat. Probab. Lett."},{"issue":"11","key":"20_CR2","doi-asserted-by":"crossref","first-page":"4813","DOI":"10.1109\/TIT.2008.929920","volume":"54","author":"AM Bruckstein","year":"2008","unstructured":"Bruckstein, A.M., Elad, M., Zibulevsky, M.: On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations. IEEE Trans. Inf. Theory 54(11), 4813\u20134820 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"20_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"4","key":"20_CR4","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1109\/TIP.2009.2038764","volume":"19","author":"B Cheng","year":"2010","unstructured":"Cheng, B., Yang, J., Yan, S., Fu, Y., Huang, T.S.: Learning with-graph for image analysis. IEEE Trans. Image Process. 19(4), 858\u2013866 (2010)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.acha.2006.04.006","volume":"21","author":"RR Coifman","year":"2006","unstructured":"Coifman, R.R., Lafon, S.: Diffusion maps. Appl. Comput. Harmonic Anal. 21(1), 5\u201330 (2006)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Correa, C.D., Lindstrom, P.: Locally-scaled spectral clustering using empty region graphs. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge Discovery and Data mining, pp. 1330\u20131338. ACM (2012)","DOI":"10.1145\/2339530.2339736"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Donoser, M., Bischof, H.: Diffusion processes for retrieval revisited. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1320\u20131327. IEEE (2013)","DOI":"10.1109\/CVPR.2013.174"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2790\u20132797. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206547"},{"issue":"11","key":"20_CR9","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"20_CR10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TKDE.2014.2312322","volume":"27","author":"Y Fang","year":"2015","unstructured":"Fang, Y., Wang, R., Dai, B., Wu, X.: Graph-based learning via auto-grouped sparse regularization and kernelized extension. IEEE Trans. Knowl. Data Eng. 27(1), 142\u2013154 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Han, S., Huang, H., Qin, H., Yu, D.: Locality-preserving l1-graph and its application in clustering. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, pp. 813\u2013818. ACM (2015)","DOI":"10.1145\/2695664.2695710"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Han, S., Qin, H.: A greedy algorithm to construct l1 graph with ranked dictionary. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 309\u2013321. Springer (2016)","DOI":"10.1007\/978-3-319-31750-2_25"},{"issue":"4","key":"20_CR13","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"SJ Kim","year":"2007","unstructured":"Kim, S.J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for large-scale l 1-regularized least squares. IEEE J Sel. Top. Signal Process. 1(4), 606\u2013617 (2007)","journal-title":"IEEE J Sel. Top. Signal Process."},{"issue":"8","key":"20_CR14","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh, K., Kim, S.J., Boyd, S.P.: An interior-point method for large-scale l1-regularized logistic regression. J. Mach. Learn. Res. 8(8), 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR15","unstructured":"Lin, T.H., Kung, H.: Stable and efficient representation learning with nonnegativity constraints. In: Proceedings of the 31st International Conference on Machine Learning (ICML-14), pp. 1323\u20131331 (2014)"},{"key":"20_CR16","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19\u201360 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"18","key":"20_CR17","doi-asserted-by":"crossref","first-page":"188,701","DOI":"10.1103\/PhysRevLett.108.188701","volume":"108","author":"RR Nadakuditi","year":"2012","unstructured":"Nadakuditi, R.R., Newman, M.E.: Graph spectra and the detectability of community structure in networks. Phys. Rev. Lett. 108(18), 188,701 (2012)","journal-title":"Phys. Rev. Lett."},{"key":"20_CR18","first-page":"849","volume":"2","author":"AY Ng","year":"2002","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y., et al.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 2, 849\u2013856 (2002)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"5500","key":"20_CR19","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323\u20132326 (2000)","journal-title":"Science"},{"issue":"8","key":"20_CR20","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"20_CR21","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1996)"},{"issue":"12","key":"20_CR22","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. Inf. Theory, IEEE Trans. 53(12), 4655\u20134666 (2007)","journal-title":"Inf. Theory, IEEE Trans."},{"issue":"6","key":"20_CR23","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/JPROC.2010.2044010","volume":"98","author":"JA Tropp","year":"2010","unstructured":"Tropp, J.A., Wright, S.J.: Computational methods for sparse solution of linear inverse problems. Proc. IEEE 98(6), 948\u2013958 (2010)","journal-title":"Proc. IEEE"},{"issue":"4","key":"20_CR24","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg Von","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"issue":"2","key":"20_CR25","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright, J., Yang, A.Y., Ganesh, A., Sastry, S.S., Ma, Y.: Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 210\u2013227 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Yan, S., Wang, H.: Semi-supervised learning by sparse representation. In: Society for Industrial and Applied Mathematics. Proceedings of the SIAM International Conference on Data Mining, p. 792. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611972795.68"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Yang, A.Y., Sastry, S.S., Ganesh, A., Ma, Y.: Fast l1-minimization algorithms and an application in robust face recognition: a review. In: 2010 17th IEEE International Conference on Image Processing (ICIP)., pp. 1849\u20131852. IEEE (2010)","DOI":"10.1109\/ICIP.2010.5651522"},{"key":"20_CR28","unstructured":"Yang, Y., Feng, J., Yang, J., Huang, T.S.: Learning l1-graph for data clustering. CoRR (2015). arxiv:1510.08520"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Yang, Y., Wang, Z., Yang, J., Han, J., Huang, T.: Regularized l1-graph for data clustering. In: Proceedings of the British Machine Vision Conference. BMVA Press (2014)","DOI":"10.5244\/C.28.49"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Yang, Y., Wang, Z., Yang, J., Wang, J., Chang, S., Huang, T.S.: Data clustering by laplacian regularized l1-graph. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 3148\u20133149 (2014)","DOI":"10.1609\/aaai.v28i1.9087"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"You, C., Robinson, D., Vidal, R.: Scalable sparse subspace clustering by orthogonal matching pursuit. In: IEEE Conference on Computer Vision and Pattern Recognition, vol.\u00a01 (2016)","DOI":"10.1109\/CVPR.2016.425"},{"issue":"11","key":"20_CR32","doi-asserted-by":"crossref","first-page":"2088","DOI":"10.1109\/TCYB.2014.2300489","volume":"44","author":"YM Zhang","year":"2014","unstructured":"Zhang, Y.M., Huang, K., Hou, X., Liu, C.L.: Learning locality preserving graph from data. IEEE Trans. Cybern. 44(11), 2088\u20132098 (2014)","journal-title":"IEEE Trans. Cybern."},{"key":"20_CR33","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.neucom.2013.03.045","volume":"120","author":"G Zhou","year":"2013","unstructured":"Zhou, G., Lu, Z., Peng, Y.: L1-graph construction using structured sparsity. Neurocomputing 120, 441\u2013452 (2013)","journal-title":"Neurocomputing"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-016-0020-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T06:55:47Z","timestamp":1657090547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-016-0020-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,19]]},"references-count":33,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s41060-016-0020-3","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,19]]}}}