{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:07:33Z","timestamp":1742396853626},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T00:00:00Z","timestamp":1266883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10852-010-9126-0","type":"journal-article","created":{"date-parts":[[2010,2,22]],"date-time":"2010-02-22T09:03:43Z","timestamp":1266829423000},"page":"131-147","source":"Crossref","is-referenced-by-count":10,"title":["Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function"],"prefix":"10.1007","volume":"9","author":[{"given":"Charles-Edmond","family":"Bichot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,23]]},"reference":[{"key":"9126_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Dasgupta, A., Kumar, R.: Approximation algorithms for co-clustering. In: Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 201\u2013210 (2008)","DOI":"10.1145\/1376916.1376945"},{"key":"9126_CR2","doi-asserted-by":"crossref","unstructured":"Baker, L.D., McCallum, A.K.: Distributional clustering of words for text classification. In: Proceedings of the 21st ACM SIGIR International Conference on Research and Development in Information Retrieval, pp. 96\u2013103 (1998)","DOI":"10.1145\/290941.290970"},{"key":"9126_CR3","doi-asserted-by":"crossref","unstructured":"Bichot, C.-E.: A metaheuristic based on fusion and fission for partitioning problems. In: Proceedings of NIDISC\u201908 in Conjunction with the 20th IEEE International Parallel and Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639518"},{"issue":"3","key":"9126_CR4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10852-007-9059-4","volume":"6","author":"C-E Bichot","year":"2007","unstructured":"Bichot, C.-E.: A new Method, the fusion fission, for the relaxed k-way graph partitioning problem, and comparisons with some multilevel algorithms. J. Math. Model Algorithm 6(3), 319\u2013344 (2007)","journal-title":"J. Math. Model Algorithm"},{"key":"9126_CR5","doi-asserted-by":"crossref","unstructured":"Bichot, C.-E.: A new meta-method for graph partitioning. In: Proceedings of the 2008 IEEE Congress on Evolutionary Computation, pp. 3498\u20133505 (2008)","DOI":"10.1109\/CEC.2008.4631271"},{"issue":"3","key":"9126_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0167-9236(99)00055-X","volume":"27","author":"D Boley","year":"1999","unstructured":"Boley, D., Gini, M., Gross, R., Han, S., Hastings, K., Karypis, G., Kumar, V., Mobasher, B., Moore, J.: Partitioning-based clustering for web document categorization. Decis. Support Syst. 27(3), 329\u2013341 (1999)","journal-title":"Decis. Support Syst."},{"key":"9126_CR7","doi-asserted-by":"crossref","unstructured":"Costa, G., Manco, G., Ortale, R.: A hierarchical model-based approach to co-clustering high-dimensional data. In: Proceedings of the ACM Symposium on Applied Computing, pp. 886\u2013890 (2008)","DOI":"10.1145\/1363686.1363891"},{"key":"9126_CR8","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"9126_CR9","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"IS Dhillon","year":"2007","unstructured":"Dhillon, I.S., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors: a multilevel approach. IEEE Trans. Pattern Anal. Mach. Intell. 29, 1944\u20131957 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9126_CR10","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoric co-clustering. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a089\u201398 (2003)","DOI":"10.1145\/956755.956764"},{"key":"9126_CR11","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of the 1st IEEE International Conference on Data Mining, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"9126_CR12","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of 19th ACM\/IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"9126_CR13","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.W.: A multilevel algorithm for partitioning graphs. In: Proceedings of Supercomputing (1995)","DOI":"10.1145\/224170.224228"},{"issue":"1","key":"9126_CR14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"issue":"3","key":"9126_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"9126_CR16","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"9126_CR17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"9126_CR18","doi-asserted-by":"crossref","unstructured":"Long, B., Zhang, Z.M., Yu, P.S.: Co-clustering by block value decomposition. In: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 635\u2013640 (2005)","DOI":"10.1145\/1081870.1081949"},{"issue":"1","key":"9126_CR19","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinf. 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"9126_CR20","doi-asserted-by":"crossref","unstructured":"Mandhani, B., Joshi, S., Kummamuru, K.: A matrix density based algorithm to hierarchically co-cluster documents and words. In: Proceedings of the 12th International Conference on World Wide Web, pp. 658\u2013665 (2003)","DOI":"10.1145\/775152.775225"},{"issue":"3","key":"9126_CR21","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M Porter","year":"1980","unstructured":"Porter, M.: An algorithm for suffix stripping. Program 14(3), 130\u2013137 (1980)","journal-title":"Program"},{"issue":"3","key":"9126_CR22","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9126_CR23","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W Rand","year":"1971","unstructured":"Rand, W.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66, 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"9126_CR24","doi-asserted-by":"crossref","unstructured":"Rege, M., Dong, M., Fotouhi, F.: Co-clustering documents and words using bipartite isoperimetric graph partitioning. In: Proceedings of the 6th IEEE International Conference on Data Mining, pp. 532\u2013541 (2006)","DOI":"10.1109\/ICDM.2006.36"},{"key":"9126_CR25","doi-asserted-by":"crossref","unstructured":"Rege, M., Dong, M., Toouhi, F.: Co-clustering image features and semantic concepts. In: Proceedings of IEEE International Conference on Image Processing, pp. 137\u2013140 (2006)","DOI":"10.1109\/ICIP.2006.312378"},{"key":"9126_CR26","doi-asserted-by":"crossref","unstructured":"Rokach, L., Maimon, O.: Data mining and knowledge discovery handbook, Chapt. Clustering methods. Springer (2005)","DOI":"10.1007\/b107408"},{"key":"9126_CR27","doi-asserted-by":"crossref","unstructured":"Slonim, N., Tishby, N.: Document clustering using word clusters via the information bottleneck method. In: Proceedings of the 23rd ACM SIGIR International Conference on Research and Development in Informaion Retrieval, pp. 208\u2013215 (2000)","DOI":"10.1145\/345508.345578"},{"key":"9126_CR28","unstructured":"Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. In: Proceedings of ACM SIGKDD Workshop on Text Mining (2000)"},{"key":"9126_CR29","unstructured":"Tagarelli, A., Karypis, G.: A segment-based approach To clustering multi-topic documents. In: Text Mining Workshop, SIAM Datamining Conference (2008)"},{"issue":"3","key":"9126_CR30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.patrec.2005.07.012","volume":"27","author":"W-C Tjhi","year":"2006","unstructured":"Tjhi, W.-C., Chen, L.: A partitioning based algorithm to fuzzy co-cluster documents and words. Pattern Recogn. Lett. 27(3), 151\u2013159 (2006)","journal-title":"Pattern Recogn. Lett."},{"key":"9126_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Ann. Oper. Res. 131, 325\u2013372 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9126_CR32","unstructured":"Wu, X., Ngo, C.-W., Li, Q.: Co-Clustering of time-evolving news story with transcript and keyframe. In: Proceedings of IEEE International Conference on Multimedia and Expo, pp. 117\u2013120 (2005)"},{"key":"9126_CR33","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C.H.Q., Gu, M., Simon, H.D.: Bipartite graph partitioning and data clustering. In: ACM Conference on Information and Knowledge Management, pp. 25\u201332 (2001)","DOI":"10.2172\/816202"},{"issue":"3","key":"9126_CR34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:MACH.0000027785.44527.d6","volume":"55","author":"Y Zhao","year":"2004","unstructured":"Zhao, Y., Karypis, G.: Empirical and theoretical comparisons of selected criterion functions for document clustering. Mach. Learn. 55(3), 311\u2013331 (2004)","journal-title":"Mach. Learn."},{"issue":"2","key":"9126_CR35","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10618-005-0361-3","volume":"10","author":"Y Zhao","year":"2005","unstructured":"Zhao, Y., Karypis, G., Fayyad, U.M.: Hierarchical clustering algorithms for document datasets. Data Min. Knowl. Discov. 10(2), 141\u2013168 (2005)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9126-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-010-9126-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9126-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:31Z","timestamp":1559269591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-010-9126-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,23]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9126"],"URL":"https:\/\/doi.org\/10.1007\/s10852-010-9126-0","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,23]]}}}