{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T10:40:22Z","timestamp":1712227222273},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,22]],"date-time":"2011-02-22T00:00:00Z","timestamp":1298332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10898-011-9691-4","type":"journal-article","created":{"date-parts":[[2011,2,21]],"date-time":"2011-02-21T16:48:24Z","timestamp":1298306904000},"page":"123-137","source":"Crossref","is-referenced-by-count":4,"title":["An efficient algorithm for maximal margin clustering"],"prefix":"10.1007","volume":"52","author":[{"given":"Jiming","family":"Peng","sequence":"first","affiliation":[]},{"given":"Lopamudra","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Vikas","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Dale","family":"Schuurmans","sequence":"additional","affiliation":[]},{"given":"Linli","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,22]]},"reference":[{"key":"9691_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"V. Vapnik","year":"1995","unstructured":"Vapnik V.: The Nature of Statistical Learning Theory. Springer, New York (1995)"},{"key":"9691_CR2","volume-title":"Learning with Kernels Support Vector Machines, Regularization, Optimization and Beyond","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf B., Smola A.: Learning with Kernels Support Vector Machines, Regularization, Optimization and Beyond. MIT Press, Cambridge (2002)"},{"key":"9691_CR3","unstructured":"Xu, L., Neufeld, J., Larson, B., Schuurmans, D.: Maximum margin clustering. In: Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge (2005)"},{"key":"9691_CR4","unstructured":"Xu, L., Schuurmans, D.: Unsupervised and semi-supervised multi-class support vector machines. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI) (2005)"},{"key":"9691_CR5","doi-asserted-by":"crossref","unstructured":"Valizadegan, H., Jin, R.: Generalized maximum margin clustering and unsupervised kernel learning. In: Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge (2006)","DOI":"10.7551\/mitpress\/7503.003.0182"},{"key":"9691_CR6","unstructured":"Bennett, K., Demiriz, A.: Semi-supervised support vector machines. In: Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge (1998)"},{"key":"9691_CR7","unstructured":"Bie, T. D., Cristianini, N.: Convex methods for transduction. In: Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge (2004)"},{"key":"9691_CR8","first-page":"1409","volume":"7","author":"T. De Bie","year":"2006","unstructured":"De Bie T., Cristianini N.: Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems. J. Mach. Learn. Res. 7, 1409\u20131436 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9691_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe L., Boyd S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"9691_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, K., Tsang, I.W., Kwok, J.T.: Maximum margin clustering made practical. In: International Conference on Machine learning (ICML), pp. 1119\u20131126 (2007)","DOI":"10.1145\/1273496.1273637"},{"key":"9691_CR11","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge (2002)"},{"key":"9691_CR12","first-page":"3","volume":"2","author":"O.A. Prokopyev","year":"2007","unstructured":"Prokopyev O.A., Busygin S., Pardalos P.M.: An optimization based approach for data classification. Optim. Methods Softw. 2, 3\u20139 (2007)","journal-title":"Optim. Methods Softw."},{"key":"9691_CR13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R. Xu","year":"2005","unstructured":"Xu R., Wunsch D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16, 645\u2013648 (2005)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9691_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"H.D. Sherali","year":"2005","unstructured":"Sherali H.D., Desai J.: A global optimization rlt-based approach for solving the hard clustering problem. J. Global Optim. 32, 281\u2013306 (2005)","journal-title":"J. Global Optim."},{"key":"9691_CR15","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10898-004-7390-0","volume":"33","author":"H.D. Sherali","year":"2005","unstructured":"Sherali H.D., Desai J.: A global optimization rlt-based approach for solving the fuzzy clustering approach. J. Global Optim. 33, 597\u2013615 (2005)","journal-title":"J. Global Optim."},{"key":"9691_CR16","doi-asserted-by":"crossref","DOI":"10.1142\/9789812771667","volume-title":"Clustering Challenges in Biological Networks","author":"S. Butenko","year":"2009","unstructured":"Butenko S., Chaovalitwongse W., Pardalos P.M.: Clustering Challenges in Biological Networks. World Scientific, Singapore (2009)"},{"key":"9691_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1008324625522","volume":"16","author":"P.S. Bradley","year":"2000","unstructured":"Bradley P.S., Mangasarian O.L.: k-plane clustering. J. Global Optim. 16, 23\u201332 (2000)","journal-title":"J. Global Optim."},{"key":"9691_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1021394316112","volume":"25","author":"D. Du","year":"2003","unstructured":"Du D., Jung Y., Park H., Drake B.L.: A decision criterion for the optimal number of clusters in hierarchical clustering. J. Global Optim. 25, 91\u2013111 (2003)","journal-title":"J. Global Optim."},{"key":"9691_CR19","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 cut and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9691_CR20","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., Kulis B.: Kernel k-means, spectral clustering and normalized cuts. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 551\u2013556 (2004)","DOI":"10.1145\/1014052.1014118"},{"key":"9691_CR21","doi-asserted-by":"crossref","unstructured":"Chen, H., Peng, J.: 0\u20131 semidefinite programming for graph-cut clustering: modelling and approximation. In: Pardalos, P.M., Hansen, P. (eds.) Data Mining and Mathematical Programming. CRM Proceedings and Lecture Notes of the American Mathematical Society, pp. 15\u201340 (2008)","DOI":"10.1090\/crmp\/045\/02"},{"key":"9691_CR22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. B. Johnson","year":"1984","unstructured":"Johnson W. B., Lindenstrauss J.: Extensions of lipshitz mapping into hilbert space. Contemp. Math. 26, 189\u2013206 (1984)","journal-title":"Contemp. Math."},{"key":"9691_CR23","unstructured":"Musicant, D. R.: NDC: normally distributed clustered datasets (1998) http:\/\/www.cs.wisc.edu\/dmi\/svm\/ndc\/"},{"key":"9691_CR24","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: ACM Symposium on Principles of Database Systems (PODS), pp. 274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"9691_CR25","doi-asserted-by":"crossref","unstructured":"Graham, D. B., Allinson, N. M.: In: Face Recognition: From Theory to Applications, vol. 163, chapter Characterizing Virtual Eigensignatures for General Purpose Face Recognition. NATO ASI Series F, Computer and Systems Sciences, pp. 446\u2013456 (1998)","DOI":"10.1007\/978-3-642-72201-1_25"},{"key":"9691_CR26","unstructured":"Samaria, F., Harter, A.: Parameterisation of a stochastic model for human face identification. In: Proceedings of 2nd IEEE Workshop on Applications of Computer Vision (1994)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9691-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9691-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9691-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T10:15:16Z","timestamp":1712225716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9691-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,22]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9691"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9691-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,22]]}}}