{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:23Z","timestamp":1725559103554},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260325"},{"type":"electronic","value":"9783540321118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428831_26","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T04:14:05Z","timestamp":1279080845000},"page":"204-211","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-level Approach for Document Clustering"],"prefix":"10.1007","author":[{"given":"Suely","family":"Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Cheol","family":"Seok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Bui, T., Jones, C.: A heuristic for reducing fill in sparse matrix factorization. In: 6th SIAM Conf. Parallel Processing for Scientific Computing, pp. 445\u2013452 (1993)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/ICDM.2001.989507","volume-title":"ICDM 2001, Proceedings IEEE International Conference on Data Mining, 2001","author":"C. Ding","year":"2001","unstructured":"Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A min-max cut algorithm for graph partitioning data clustering. In: ICDM 2001, Proceedings IEEE International Conference on Data Mining, 2001, pp. 107\u2013114. IEEE, Los Alamitos (2001)"},{"key":"26_CR3","unstructured":"Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A minmaxcut spectral method for data clustering and graph partitioning. echnical Report 54111, LBNL (December 2003)"},{"key":"26_CR4","first-page":"10","volume-title":"Proceedings of IEEE International Conference on Computer Aided Design","author":"L. Hagen","year":"1991","unstructured":"Hagen, L., Kahng, A.: Fast spectral methods for ratio cut partitioning and clustering. In: Proceedings of IEEE International Conference on Computer Aided Design, pp. 10\u201313. IEEE, Los Alamitos (1991)"},{"key":"26_CR5","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratories (1993)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1142\/S0129054199000162","volume":"10","author":"M. Holzrichter","year":"1999","unstructured":"Holzrichter, M., Oliveira, S.: A graph based davidson algorithm for the graph partitioning problem. International Journal of Foundations of Computer Science\u00a010, 225\u2013246 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"26_CR7","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN (1998)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"26_CR9","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proc. Fifth Berkeley Symp. Math. Statistics and Probability, vol.\u00a01, pp. 281\u2013296 (1967)"},{"key":"26_CR10","unstructured":"McCallum, A.: A toolkit for statistical language modeling, text retrieval, classification and clustering (1996), Available on WWW at \n                    \n                      http:\/\/www.cs.cmu.edu\/~mccallum\/bow"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou., K.-P.K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl.\u00a011(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"8","key":"26_CR12","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428831_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T18:26:59Z","timestamp":1552760819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428831_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260325","9783540321118"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11428831_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}