{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:33:32Z","timestamp":1768516412753,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,29]],"date-time":"2014-01-29T00:00:00Z","timestamp":1390953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10618-014-0347-0","type":"journal-article","created":{"date-parts":[[2014,1,28]],"date-time":"2014-01-28T11:41:57Z","timestamp":1390909317000},"page":"324-357","source":"Crossref","is-referenced-by-count":6,"title":["Exemplar-based low-rank matrix decomposition for data clustering"],"prefix":"10.1007","volume":"29","author":[{"given":"Lijun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ming","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,29]]},"reference":[{"issue":"2","key":"347_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1219092.1219097","volume":"54","author":"D Achlioptas","year":"2007","unstructured":"Achlioptas D, Mcsherry F (2007) Fast computation of low-rank matrix approximations. J ACM 54(2):9","journal-title":"J ACM"},{"key":"347_CR2","volume-title":"The numerical treatment of integral equations","author":"CTH Baker","year":"1997","unstructured":"Baker CTH (1997) The numerical treatment of integral equations. Clarendon Press, Oxford"},{"issue":"6","key":"347_CR3","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1109\/18.720554","volume":"44","author":"AR Barron","year":"1998","unstructured":"Barron AR, Rissanen J, Yu B (1998) The minimum description length principle in coding and modeling. IEEE Trans Inf Theory 44(6):2743\u20132760","journal-title":"IEEE Trans Inf Theory"},{"key":"347_CR4","doi-asserted-by":"crossref","unstructured":"Berry MW, Browne M, Langville AN, Pauca PV, Plemmons RJ (September 2007) Algorithms and applications for approximate nonnegative matrix factorization. Comput Stat Data Anal 52(1):155\u2013173","DOI":"10.1016\/j.csda.2006.11.006"},{"issue":"2","key":"347_CR5","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/1067967.1067972","volume":"31","author":"MW Berry","year":"2005","unstructured":"Berry MW, Pulatova SA, Stewart GW (2005) Algorithm 844: computing sparse reduced-rank approximations to sparse matrices. ACM Trans Math Softw 31(2):252\u2013269","journal-title":"ACM Trans Math Softw"},{"issue":"6","key":"347_CR6","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1109\/TVCG.2009.165","volume":"15","author":"Y Chen","year":"2009","unstructured":"Chen Y, Wang L, Dong M, Hua J (2009) Exemplar-based visualization of large document corpus. IEEE Trans Visual Comput Graphics 15(6):1169\u20131176","journal-title":"IEEE Trans Visual Comput Graphics"},{"key":"347_CR7","doi-asserted-by":"crossref","unstructured":"Chung FRK (1997) Spectral graph theory. American Mathematical Society","DOI":"10.1090\/cbms\/092"},{"key":"347_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569609","volume-title":"Computational methods for integral equations","author":"LM Delves","year":"1985","unstructured":"Delves LM, Mohamed JL (1985) Computational methods for integral equations. Cambridge University Press, New York"},{"key":"347_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc B 39:1\u201338","journal-title":"J R Stat Soc B"},{"key":"347_CR10","doi-asserted-by":"crossref","unstructured":"Dhillon I, Guan Y, Kulis B (2004) Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 551\u2013556","DOI":"10.1145\/1014052.1014118"},{"key":"347_CR11","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Guan Y, Kulis B (2005) A unified view of kernel k-means, spectral clustering and graph cuts. Technical Report TR-04-25, University of Texas Dept. of Computer Science","DOI":"10.1145\/1014052.1014118"},{"key":"347_CR12","doi-asserted-by":"crossref","unstructured":"Ding C, He X, Simon HD (2005) On the equivalence of nonnegative matrix factorization and spectral clustering. In: Proceedings of SIAM International Conference of Data Mining, pp 606\u2013610","DOI":"10.1137\/1.9781611972757.70"},{"key":"347_CR13","doi-asserted-by":"crossref","unstructured":"Ding C, He X, Zha H, Simon HD (2001) A min-max cut algorithm for graph partitioning and data clustering. In: IEEE International Conference on Data Mining, pp 107\u2013114","DOI":"10.1109\/ICDM.2001.989507"},{"key":"347_CR14","unstructured":"Ding C, Li T, Jordan MI (2008) Convex and semi-nonnegative matrix factorizations. In: IEEE Transactions on Pattern Analysis and Machine Intelligence, vol 99. IEEE Computer Society, Los Alamitos"},{"issue":"1","key":"347_CR15","first-page":"342","volume":"21","author":"C Ding","year":"2006","unstructured":"Ding C, Li T, Peng W (2006) Nonnegative matrix factorization and probabilistic latent semantic indexing: equivalence chi-square statistic, and a hybrid method. Proc Natl Conf Artif Intell 21(1):342","journal-title":"Proc Natl Conf Artif Intell"},{"key":"347_CR16","doi-asserted-by":"crossref","unstructured":"Ding C, Li T, Peng W, Park H (2006) Orthogonal nonnegative matrix t-factorizations for clustering. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 126\u2013135","DOI":"10.1145\/1150402.1150420"},{"issue":"1\u20133","key":"347_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas P, Frieze A, Kannan R, Vempala S, Vinay V (2004) Clustering large graphs via the singular value decomposition. IEEE J Mach Learn 56(1\u20133):9\u201333","journal-title":"IEEE J Mach Learn"},{"key":"347_CR18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/S0097539704442696","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas P, Kannan R, Mahoney M (2006) Fast monte-carlo algorithms for matrices ii: computing low-rank approximations to a matrix. SIAM J Comput 36:158\u2013183","journal-title":"SIAM J Comput"},{"key":"347_CR19","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/S0097539704442702","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas P, Kannan R, Mahoney MW (2006) Fast monte carlo algorithms for matrices iii: computing a compressed approximate matrix decomposition. SIAM J Comput 36:184\u2013206","journal-title":"SIAM J Comput"},{"key":"347_CR20","first-page":"2153","volume":"6","author":"P Drineas","year":"2005","unstructured":"Drineas P, Mahoney MW (2005) On the nystr\u00f6m method for approximating a gram matrix for improved kernel-based learning. J Mach Learn Res 6:2153\u20132175","journal-title":"J Mach Learn Res"},{"key":"347_CR21","volume-title":"Pattern classification","author":"HO Duda","year":"2001","unstructured":"Duda HO, Hart PE, Stork DG (2001) Pattern classification, 2nd edn. Wiley, New York","edition":"2"},{"issue":"98","key":"347_CR22","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler M (1973) Algebraic connectivity of graphs. Czechoslov Math J 23(98):298\u2013305","journal-title":"Czechoslov Math J"},{"issue":"2","key":"347_CR23","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TPAMI.2004.1262185","volume":"26","author":"C Fowlkes","year":"2004","unstructured":"Fowlkes C, Belongie S, Chung F, Malik J (2004) Spectral grouping using the nystr\u00f6m method. IEEE Trans Pattern Anal Mach Intell 26(2):214\u2013225","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"347_CR24","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York"},{"key":"347_CR25","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore","edition":"3"},{"issue":"9","key":"347_CR26","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen L, Kahng AB (1992) New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput Aided Des Integr Circuits Syst 11(9):1074\u20131085","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"347_CR27","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer PO (2004) Non-negative matrix factorization with sparseness constraints. J Mach Learn Res 5:1457\u20131469","journal-title":"J Mach Learn Res"},{"key":"347_CR28","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31:264\u2013323","journal-title":"ACM Comput Surv"},{"key":"347_CR29","volume-title":"Principal component analysis","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe IT (2002) Principal component analysis, 2nd edn. Springer, New York","edition":"2"},{"issue":"12","key":"347_CR30","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","volume":"23","author":"H Kim","year":"2007","unstructured":"Kim H, Park H (2007) Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics 23(12):1495\u20131502","journal-title":"Bioinformatics"},{"key":"347_CR31","unstructured":"Lang K (1995) News weeder: learning to filter netnews. In: Proceedings of the 12th International Conference on Machine Learning, pp 331\u2013339"},{"issue":"6755","key":"347_CR32","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"key":"347_CR33","first-page":"556","volume":"13","author":"DD Lee","year":"2000","unstructured":"Lee DD, Seung HS (2000) Algorithms for non-negative matrix factorization. Neural Inf Proc Syst 13:556\u2013562","journal-title":"Neural Inf Proc Syst"},{"key":"347_CR34","doi-asserted-by":"crossref","unstructured":"Li T, Ding C (2006) The relationships among various nonnegative matrix factorization methods for clustering. In: Proceedings of the IEEE International Conference on Data Mining, pp 362\u2013371","DOI":"10.1109\/ICDM.2006.160"},{"key":"347_CR35","unstructured":"MacQueen JB (1967) Some methods for classsification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp 281\u2013297"},{"key":"347_CR36","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/s10618-008-0123-0","volume":"18","author":"M Mahdavi","year":"2009","unstructured":"Mahdavi M, Abolhassani H (2009) Harmony k-means algorithm for document clustering. Data Min Knowl Disc 18:370\u2013391. doi: 10.1007\/s10618-008-0123-0","journal-title":"Data Min Knowl Disc"},{"issue":"3","key":"347_CR37","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"MF Porter","year":"1980","unstructured":"Porter MF (1980) An algorithm for suffix stripping. Program 14(3):130\u2013137","journal-title":"Program"},{"issue":"2","key":"347_CR38","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz G (1978) Estimating the dimension of a model. Ann Stat 6(2):461\u2013464","journal-title":"Ann Stat"},{"issue":"8","key":"347_CR39","doi-asserted-by":"crossref","first-page":"2004","DOI":"10.1162\/neco.2007.19.8.2004","volume":"19","author":"F Sha","year":"2007","unstructured":"Sha F, Lin Y, Saul LK, Lee DD (2007) Multiplicative updates for nonnegative quadratic programming. Neural Comput 19(8):2004\u20132031","journal-title":"Neural Comput"},{"issue":"8","key":"347_CR40","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"347_CR41","unstructured":"Shyamalkumar ND, Varadarajan K (2007) Efficient subspace approximation algorithms. In: SODA \u201907 Proceedings of the 18th annual ACM-SIAM symposium on Discrete algorithms, pp 532\u2013540"},{"key":"347_CR42","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s002110050451","volume":"83","author":"GW Stewart","year":"1999","unstructured":"Stewart GW (1999) Four algorithms for the efficient computation of truncated qr approximations to a sparse matrix. Numer Math 83:313\u2013323","journal-title":"Numer Math"},{"key":"347_CR43","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J, Cardie C (2002) Cluster ensembles: a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"issue":"1","key":"347_CR44","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1002\/sam.102","volume":"1","author":"J Sun","year":"2008","unstructured":"Sun J, Xie Y, Zhang H, Faloutsos C (2008) Less is more: sparse graph mining with compact matrix decomposition. Stat Anal Data Min 1(1):6\u201322","journal-title":"Stat Anal Data Min"},{"key":"347_CR45","doi-asserted-by":"crossref","unstructured":"Tong H, Papadimitriou S, Sun J, Yu PS, Faloutsos C (2008) Colibri: fast mining of large static and dynamic graphs. In: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 686\u2013694","DOI":"10.1145\/1401890.1401973"},{"key":"347_CR46","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10618-010-0181-y","volume":"22","author":"F Wang","year":"2011","unstructured":"Wang F, Li T, Wang X, Zhu S, Ding C (2011) Community discovery using nonnegative matrix factorization. Data Min Knowl Disc 22:493\u2013521. doi: 10.1007\/s10618-010-0181-y","journal-title":"Data Min Knowl Disc"},{"key":"347_CR47","doi-asserted-by":"crossref","unstructured":"Wang L, Dong M (2011) On the clustering of large-scale data: a matrix-based approach. In: To appear Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN 2011), p 10","DOI":"10.1109\/IJCNN.2011.6033212"},{"key":"347_CR48","unstructured":"Williams CK, Seeger M (2001) Using the nystr\u00f6m method to speed up kernel machines. In: Advances in Neural Information Processing Systems 13: Proceedings of the 2000 Conference, MIT Press, pp 682\u2013688"},{"key":"347_CR49","doi-asserted-by":"crossref","unstructured":"Xu W, Gong Y (2004) Document clustering by concept factorization. In: SIGIR \u201904: proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, ACM, New York, pp 202\u2013209","DOI":"10.1145\/1008992.1009029"},{"key":"347_CR50","doi-asserted-by":"crossref","unstructured":"Xu W, Liu X, Gong Y (2003) Document clustering based on non-negative matrix factorization. In: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, pp 267\u2013273","DOI":"10.1145\/860435.860485"},{"key":"347_CR51","doi-asserted-by":"crossref","unstructured":"Yan D, Huang L, Jordan M (2009) Fast approximate spectral clustering. Technical Report UCB\/EECS-2009-45, EECS Department, University of California, Berkeley","DOI":"10.1145\/1557019.1557118"},{"issue":"2","key":"347_CR52","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/TNN.2007.905858","volume":"19","author":"GG Yen","year":"2008","unstructured":"Yen GG, Wu Z (2008) Ranked centroid projection: a data visualization approach with self-organizing maps. IEEE Trans Neural Netw 19(2):245\u2013259","journal-title":"IEEE Trans Neural Netw"},{"key":"347_CR53","doi-asserted-by":"crossref","unstructured":"Zhang K, Kwok JT (2006) Block-quantized kernel matrix for fast spectral embedding. In: ICML \u201906: proceedings of the 23rd international conference on Machine learning, ACM, New York, pp 1097\u20131104","DOI":"10.1145\/1143844.1143982"},{"key":"347_CR54","doi-asserted-by":"crossref","unstructured":"Zhang K, Tsang IW, Kwok JT (2008) Improved nystr\u00f6m low-rank approximation and error analysis. In ICML \u201908: proceedings of the 25th international conference on Machine learning, ACM, New York, pp 1232\u20131239","DOI":"10.1145\/1390156.1390311"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0347-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-014-0347-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0347-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T18:32:52Z","timestamp":1716489172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-014-0347-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,29]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["347"],"URL":"https:\/\/doi.org\/10.1007\/s10618-014-0347-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,29]]}}}