{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T17:15:31Z","timestamp":1763226931750,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002398","name":"Sharif University of Technology","doi-asserted-by":"publisher","award":["00435-1563"],"award-info":[{"award-number":["00435-1563"]}],"id":[{"id":"10.13039\/501100002398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10288-020-00445-y","type":"journal-article","created":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T08:02:32Z","timestamp":1606809752000},"page":"473-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization"],"prefix":"10.1007","volume":"19","author":[{"given":"Ja\u2019far","family":"Dehghanpour-Sahron","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2763-4279","authenticated-orcid":false,"given":"Nezam","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,1]]},"reference":[{"key":"445_CR1","unstructured":"Arthur D, Sergi V (2007) K-means++: the advantages of careful seeding. In: SODA \u201907: proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, pp 1027\u20131035"},{"issue":"1","key":"445_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IMA J Numer Anal 8(1):141\u2013148","journal-title":"IMA J Numer Anal"},{"issue":"4","key":"445_CR3","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.jctb.2010.01.002","volume":"100","author":"A Daneshgar","year":"2010","unstructured":"Daneshgar A, Hajiabolhassan H, Javadi R (2010) On the isoperimetric spectrum of graphs and its approximations. J Comb Theory Ser B 100(4):390\u2013412","journal-title":"J Comb Theory Ser B"},{"issue":"12","key":"445_CR4","doi-asserted-by":"publisher","first-page":"3371","DOI":"10.1016\/j.patcog.2013.05.015","volume":"46","author":"A Daneshgar","year":"2013","unstructured":"Daneshgar A, Javadi R, Razavi SS (2013) Clustering and outlier detection using isoperimetric number of trees. Pattern Recogn 46(12):3371\u20133382","journal-title":"Pattern Recogn"},{"key":"445_CR5","doi-asserted-by":"crossref","unstructured":"Ding C, He X, Simon HD (2005) On the equivalence of non-negative matrix factorization and spectral clustering. In: Proceedings of the SIAM international conference on data mining. Society for Industrial and Applied Mathematics, pp 606\u2013610","DOI":"10.1137\/1.9781611972757.70"},{"key":"445_CR6","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Guan Y, Kulis B (2004) A unified view of kernel k-means, spectral clustering and graph cuts. Technical Report No. UTCS TR-04-25, Computer Science Department, University of Texas at Austin","DOI":"10.1145\/1014052.1014118"},{"issue":"2","key":"445_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201\u2013213","journal-title":"Math Program"},{"issue":"2","key":"445_CR8","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","volume":"153","author":"B Jiang","year":"2015","unstructured":"Jiang B, Dai YH (2015) A framework of constraint preserving update schemes for optimization on Stiefel manifold. Math Program 153(2):535\u2013575","journal-title":"Math Program"},{"issue":"6","key":"445_CR9","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"J Kim","year":"2011","unstructured":"Kim J, Park H (2011) Fast non-negative matrix factorization: an active-set-like method and comparisons. SIAM J Sci Comput 33(6):3261\u20133281","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"445_CR10","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118","journal-title":"Phys Rev E"},{"issue":"1","key":"445_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"H Lawrence","year":"1985","unstructured":"Lawrence H, Phipps A (1985) Comparing partitions. J Classif 2(1):193\u2013218","journal-title":"J Classif"},{"key":"445_CR12","doi-asserted-by":"crossref","unstructured":"Li T, Ding C (2006) The relationships among various non-negative matrix factorization methods for clustering. In: Data mining. ICDM\u201906. Sixth international conference on IEEE, pp 362\u2013371","DOI":"10.1109\/ICDM.2006.160"},{"key":"445_CR13","first-page":"849","volume-title":"Advances in neural information processing systems","author":"AY Ng","year":"2002","unstructured":"Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Scholkopf B, Platt J, Hoffman T (eds) Advances in neural information processing systems. MIT Press, Cambridge, pp 849\u2013856"},{"key":"445_CR14","volume-title":"Numerical optimization. Springer series in operations research and financial engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer series in operations research and financial engineering, 2nd edn. Springer, New York","edition":"2"},{"issue":"1","key":"445_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/050641983","volume":"18","author":"J Peng","year":"2007","unstructured":"Peng J, Wei Y (2007) Approximating k-means-type clustering via semidefinite programming. SIAM J Optim 18(1):186\u2013205","journal-title":"SIAM J Optim"},{"key":"445_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.neucom.2014.02.018","volume":"141","author":"F Pompili","year":"2014","unstructured":"Pompili F, Gillis N, Absil PA, Glineur F (2014) Two algorithms for orthogonal non-negative matrix factorization with application to clustering. Neurocomputing 141:15\u201325","journal-title":"Neurocomputing"},{"issue":"1\u20132","key":"445_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen Z, Yin W (2013) A feasible method for optimization with orthogonality constraints. Math Program 142(1\u20132):397\u2013434","journal-title":"Math Program"},{"key":"445_CR18","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, vol 2. Prentice-Hall, Upper Saddle River"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00445-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-020-00445-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00445-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T10:11:22Z","timestamp":1637575882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-020-00445-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,1]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["445"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00445-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2020,12,1]]},"assertion":[{"value":"3 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}