{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:10Z","timestamp":1725567070862},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_67","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"661-670","source":"Crossref","is-referenced-by-count":1,"title":["On Approximate Balanced Bi-clustering"],"prefix":"10.1007","author":[{"given":"Guoxuan","family":"Ma","sequence":"first","affiliation":[]},{"given":"Jiming","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","unstructured":"Aggarwal, C., Kaplan, H., Orlin, J., Tarjan, R.: A Faster Primal Network Simplex Algorithm. Operations Research Center, Massachusetts Institute of Technology. OR 315-96 (1996)"},{"key":"67_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-46515-7_3","volume-title":"Discrete and Computational Geometry","author":"T. Asano","year":"2000","unstructured":"Asano, T.: Effective Use of Geometric Properties for Clustering. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 30\u201346. Springer, Heidelberg (2000)"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Ferligoj, A.: Constrained Clustering Problems. In: Proc. of IFCS 1998 (1998)","DOI":"10.1007\/978-3-642-72253-0_19"},{"key":"67_CR4","unstructured":"Bradley, P., Bennet, K., Demiriz, A.: Constrained K-Means Clustering. MSRTR- 2000-65, Microsoft Research (2000)"},{"key":"67_CR5","unstructured":"Hasegawa, S., Imai, H., Inaba, M.: Efficient Algorithms for Variance-Based kclustering. In: First Pacific Conf. on Comp. Graph. and Appl. (1993)"},{"key":"67_CR6","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Clustering analysis and mathematical programming. Math. Prog. B.\u00a079, 191\u2013215 (1997)","journal-title":"Math. Prog. B."},{"key":"67_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: J-means: a new local search heuristic for minimum sum-of-squares clustering. Pattern Recog.\u00a034, 405\u2013413 (2001)","journal-title":"Pattern Recog."},{"key":"67_CR8","unstructured":"He, J., Lan, M., Tan, C., Sung, S., Low, H.: Initialization of clusters refinement algorithms: a review and comparative study. In: International Joint Conf. on Neural Networks, IJCNN, pp. 25\u201329 (2004)"},{"key":"67_CR9","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-clustering. In: Proc. of 10th ACM Symp. on Comp. Geo., pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"issue":"1999","key":"67_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, N.M., Flynn, P.J.: Data Clustering: A Review. ACM Comput. Surveys\u00a031(1999), 264\u2013323 (1999)","journal-title":"ACM Comput. Surveys"},{"key":"67_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J. Matou\u0161ek","year":"2000","unstructured":"Matou\u0161ek, J.: On Approximate Geometric k-clustering. Dis. and Comput. Geo.\u00a024, 61\u201384 (2000)","journal-title":"Dis. and Comput. Geo."},{"issue":"2","key":"67_CR12","first-page":"125","volume":"4","author":"R.S. Michalski","year":"1980","unstructured":"Michalski, R.S., Chilausky, R.L.: Learning by being told and learning from examples: An experimental comparison of the two methods of knowledge acquisition in the context of developing an expert system for soybean disease diagnosis. International Journal of Policy Analysis and Information Systems\u00a04(2), 125\u2013161 (1980)","journal-title":"International Journal of Policy Analysis and Information Systems"},{"key":"67_CR13","volume-title":"Cluster analysis Algorithms for Data Reduction and Classification of Objects","author":"H. Sp\u00e4th","year":"1980","unstructured":"Sp\u00e4th, H.: Cluster analysis Algorithms for Data Reduction and Classification of Objects. John Wiley and Sons, Ellis Horwood (1980)"},{"key":"67_CR14","doi-asserted-by":"crossref","unstructured":"Tung, A., Ng, R., Lakshmanan, L., Han, J.: Constraint-Based Clustering in Large Databases. In: Proc. of the 8th Inter. Conf. on Database Theory, pp. 405\u2013419 (2001)","DOI":"10.1007\/3-540-44503-X_26"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:51:43Z","timestamp":1553140303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11533719_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}