{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T02:54:10Z","timestamp":1720752850019},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"S2","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1186\/s12859-019-2626-7","type":"journal-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T13:03:24Z","timestamp":1552568604000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Partition-based optimization model for generative anatomy modeling language (POM-GAML)"],"prefix":"10.1186","volume":"20","author":[{"given":"Doga","family":"Demirel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Cetinsaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tansel","family":"Halic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sinan","family":"Kockara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahryar","family":"Ahmadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"key":"2626_CR1","doi-asserted-by":"crossref","unstructured":"Demirel D, Yu A, Baer-Cooper S, Halic T, Bayrak C. Generative Anatomy Modeling Language (GAML). Int J Med Robot. 2017;13:e1813.","DOI":"10.1002\/rcs.1813"},{"key":"2626_CR2","doi-asserted-by":"crossref","unstructured":"Powell MJ. A fast algorithm for nonlinearly constrained optimization calculations. In: Numerical analysis: Springer; 1978. p. 144\u201357.","DOI":"10.1007\/BFb0067703"},{"key":"2626_CR3","doi-asserted-by":"crossref","unstructured":"Powell MJ. A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Advances in optimization and numerical analysis: Springer; 1994. p. 51\u201367. http:\/\/link.springer.com\/chapter\/10.1007\/978-94-015-8330-5_4 . Accessed 28 Nov 2016.","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"2626_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TAI.2002.1180792","volume-title":"14th IEEE international conference on tools with artificial intelligence, 2002. (ICTAI 2002). Proceedings","author":"S Anand","year":"2002","unstructured":"Anand S, Chin W-N, Khoo S-C. A lazy divide and conquer approach to constraint solving. In: 14th IEEE international conference on tools with artificial intelligence, 2002. (ICTAI 2002). Proceedings; 2002. p. 91\u201398."},{"key":"2626_CR5","first-page":"548","volume-title":"IJCAI","author":"EC Freuder","year":"1995","unstructured":"Freuder EC, Hubbe PD. Extracting constraint satisfaction subproblems. In: IJCAI; 1995. p. 548\u201357."},{"key":"2626_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10107-015-0966-2","volume":"159","author":"A Forsgren","year":"2016","unstructured":"Forsgren A, Gill PE, Wong E. Primal and dual active-set methods for convex quadratic programming. Math Program. 2016;159:469\u2013508.","journal-title":"Math Program"},{"key":"2626_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0962492904000248","volume":"14","author":"N Gould","year":"2005","unstructured":"Gould N, Orban D, Toint P. Numerical methods for large-scale nonlinear optimization. Acta Numer. 2005;14:299\u2013361.","journal-title":"Acta Numer"},{"key":"2626_CR8","doi-asserted-by":"crossref","unstructured":"Platt JC. Fast training of support vector machines using sequential minimal optimization. Adv Kernel Methods. 1999:185\u2013208.","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"2626_CR9","doi-asserted-by":"crossref","unstructured":"Vapnik V. Estimation of dependences based on empirical data: Springer Science & Business Media; 2006.","DOI":"10.1007\/0-387-34239-7"},{"key":"2626_CR10","unstructured":"Hsieh C-J, Si S, Dhillon I. A divide-and-conquer solver for kernel support vector machines. In: International conference on machine learning; 2014. p. 566\u201374."},{"key":"2626_CR11","doi-asserted-by":"crossref","unstructured":"Chitta R, Jin R, Havens TC, Jain AK. Approximate kernel k-means: solution to large scale kernel clustering. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining: ACM; 2011. p. 895\u2013903.","DOI":"10.1145\/2020408.2020558"},{"key":"2626_CR12","first-page":"27","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang C-C, Lin C-J. LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol TIST. 2011;2:27.","journal-title":"ACM Trans Intell Syst Technol TIST"},{"key":"2626_CR13","doi-asserted-by":"crossref","unstructured":"Yuan Y. Subspace techniques for nonlinear optimization. In: Some topics in industrial and applied mathematics: World Scientific; 2007. p. 206\u201318.","DOI":"10.1142\/9789812709356_0012"},{"key":"2626_CR14","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"RH Byrd","year":"1999","unstructured":"Byrd RH, Hribar ME, Nocedal J. An interior point algorithm for large-scale nonlinear programming. SIAM J Optim. 1999;9:877\u2013900.","journal-title":"SIAM J Optim"},{"key":"2626_CR15","volume-title":"Third SIAM Conference on Optimization, Houston, Texas","author":"RH Byrd","year":"1987","unstructured":"Byrd RH. Robust trust region methods for constrained optimization. In: Third SIAM Conference on Optimization, Houston, Texas; 1987."},{"key":"2626_CR16","doi-asserted-by":"crossref","unstructured":"Byrd RH, Gilbert JC. Nocedal J. A trust region method based on interior point techniques for nonlinear programming. Math Program. 2000;89:149\u201385.","DOI":"10.1007\/PL00011391"},{"key":"2626_CR17","first-page":"7","volume":"35","author":"S Wright","year":"1999","unstructured":"Wright S, Nocedal J. Numerical optimization. Springer Sci. 1999;35:7.","journal-title":"Springer Sci"},{"key":"2626_CR18","first-page":"807","volume-title":"Proceedings of the International Congress of Mathematics","author":"Y Yuan","year":"2014","unstructured":"Yuan Y. A review on subspace methods for nonlinear optimization. In: Proceedings of the International Congress of Mathematics; 2014. p. 807\u201327."},{"key":"2626_CR19","doi-asserted-by":"crossref","unstructured":"Tillman FA, Hwang C-L, Kuo W. Optimization techniques for system reliability with Redundancy A review. IEEE Trans Reliab. 1977;26:148\u201355.","DOI":"10.1109\/TR.1977.5220100"},{"key":"2626_CR20","first-page":"73","volume":"8","author":"LS Lasdon","year":"1974","unstructured":"Lasdon LS, Fox RL, Ratner MW. Nonlinear optimization using the generalized reduced gradient method. Rev Fr Autom Inform Rech Op\u00e9rationnelle Rech Op\u00e9rationnelle. 1974;8:73\u2013103.","journal-title":"Rev Fr Autom Inform Rech Op\u00e9rationnelle Rech Op\u00e9rationnelle"},{"key":"2626_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1093\/comjnl\/8.1.42","volume":"8","author":"MJ Box","year":"1965","unstructured":"Box MJ. A new method of constrained optimization and a comparison with other methods. Comput J. 1965;8:42\u201352.","journal-title":"Comput J"},{"key":"2626_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"IIIH Everett","year":"1963","unstructured":"Everett IIIH. Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper Res. 1963;11:399\u2013417.","journal-title":"Oper Res"},{"key":"2626_CR23","unstructured":"Himmelblau DM. Applied nonlinear programming: McGraw-Hill Companies; 1972."},{"key":"2626_CR24","doi-asserted-by":"crossref","unstructured":"Wah BW, Chen Y. Solving large-scale nonlinear programming problems by constraint partitioning. In: International conference on principles and practice of constraint programming: Springer; 2005. p. 697\u2013711.","DOI":"10.1007\/11564751_51"},{"key":"2626_CR25","doi-asserted-by":"crossref","unstructured":"Li X, Han C, He GA. Parallel algorithm for SVM based on extended saddle point condition. In: International conference on information computing and applications: Springer; 2010. p. 129\u201336.","DOI":"10.1007\/978-3-642-16336-4_18"},{"key":"2626_CR26","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer S, Integrating SQP. Branch-and-bound for mixed integer nonlinear programming. Comput Optim Appl. 2001;18:295\u2013309.","journal-title":"Comput Optim Appl"},{"key":"2626_CR27","doi-asserted-by":"crossref","unstructured":"Sahinidis NV. BARON: a general purpose global optimization software package. J Glob Optim. 1996;8:201\u20135.","DOI":"10.1007\/BF00138693"},{"key":"2626_CR28","unstructured":"Leyffer S. MacMINLP: AMPL collection of MINLP problems; 2003."},{"key":"2626_CR29","unstructured":"Nagarajan H, Lu M, Wang S, Bent R, Sundar K. An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. J Glob Optim. 2017;1\u201337."},{"key":"2626_CR30","doi-asserted-by":"crossref","unstructured":"Bussieck MR, Drud AS, Meeraus A. MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. Inf J Comput. 2003;15:114\u201319.","DOI":"10.1287\/ijoc.15.1.114.15159"},{"key":"2626_CR31","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S. Community detection in graphs. Phys Rep. 2010;486:75\u2013174.","journal-title":"Phys Rep"},{"key":"2626_CR32","doi-asserted-by":"crossref","unstructured":"Jain AK. Data clustering: 50 years beyond K-means. Pattern Recogn Lett. 2010;31:651\u201366.","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"2626_CR33","doi-asserted-by":"crossref","unstructured":"Hamerly G, Elkan C. Alternatives to the k-means algorithm that find better clusterings. In: Proceedings of the eleventh international conference on information and knowledge management: ACM; 2002. p. 600\u201307.","DOI":"10.1145\/584792.584890"},{"key":"2626_CR34","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C. Finding community structure in very large networks. Phys Rev E. 2004;70:066111.","journal-title":"Phys Rev E"},{"key":"2626_CR35","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise: AAAI Press; 1996. p. 226\u201331."},{"key":"2626_CR36","unstructured":"MacQueen J. Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. Oakland; 1967. p. 281\u201397."},{"key":"2626_CR37","doi-asserted-by":"publisher","unstructured":"Newman MEJ, Girvan M. Finding and evaluating community structure in networks. Phys Rev E. 2004;69. https:\/\/doi.org\/10.1103\/PhysRevE.69.026113 .","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"2626_CR38","doi-asserted-by":"crossref","unstructured":"Arthur D, Vassilvitskii S. How slow is the k-means method? In: Proceedings of the twenty-second annual symposium on computational geometry: ACM; 2006. p. 144\u201353.","DOI":"10.1145\/1137856.1137880"},{"key":"2626_CR39","doi-asserted-by":"crossref","unstructured":"Kriegel H-P, Schubert E, Zimek A. The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl Inf Syst. 2017;52:341\u201378.","DOI":"10.1007\/s10115-016-1004-2"},{"key":"2626_CR40","unstructured":"Treuting R. Minimally invasive orthopedic surgery: arthroscopy. Ochsner J. 2000;2:158\u201363."},{"key":"2626_CR41","doi-asserted-by":"crossref","unstructured":"Demirel D, Yu A, Cooper\u2010Baer S, Dendukuri A, Halic T, Kockara S, et al. A hierarchical task analysis of shoulder arthroscopy for a virtual arthroscopic tear diagnosis and evaluation platform (VATDEP). Int J Med Robot. 2017;13:e1799.","DOI":"10.1002\/rcs.1799"},{"key":"2626_CR42","doi-asserted-by":"crossref","unstructured":"Canny J. A computational approach to edge detection. In: Readings in Computer Vision: Elsevier; 1987. p. 184\u2013203.","DOI":"10.1016\/B978-0-08-051581-6.50024-6"},{"key":"2626_CR43","first-page":"873","volume":"80","author":"LM Jacobs","year":"1988","unstructured":"Jacobs LM. The importance of airway Management in Trauma. J Natl Med Assoc. 1988;80:873.","journal-title":"J Natl Med Assoc"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-2626-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-019-2626-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-2626-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:56:15Z","timestamp":1694699775000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-019-2626-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":43,"journal-issue":{"issue":"S2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2626"],"URL":"https:\/\/doi.org\/10.1186\/s12859-019-2626-7","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"14 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not Applicable","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not Applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"105"}}