{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T01:27:53Z","timestamp":1705886873167},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,2]],"date-time":"2009-10-02T00:00:00Z","timestamp":1254441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10115-009-0255-6","type":"journal-article","created":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T16:08:25Z","timestamp":1254413305000},"page":"393-413","source":"Crossref","is-referenced-by-count":11,"title":["A general framework for relation graph clustering"],"prefix":"10.1007","volume":"24","author":[{"given":"Bo","family":"Long","sequence":"first","affiliation":[]},{"given":"Zhongfei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,2]]},"reference":[{"key":"255_CR1","doi-asserted-by":"crossref","unstructured":"Banerjee A, Dhillon I, Ghosh J, Merugu S, Modha D (2004) A generalized maximum entropy approach to bregman co-clustering and matrix approximation. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 509\u2013514","DOI":"10.1145\/1014052.1014111"},{"key":"255_CR2","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee A, Merugu S, Dhillon I, Ghosh J (2005) Clustering with Bregman divergences. J Mach Learn Res 6: 1705\u20131749","journal-title":"J Mach Learn Res"},{"key":"255_CR3","unstructured":"Bui T, Jones C (1993) A heuristic for reducing fill in sparse matrix factorization. In: 6th SIAM conference on parallel processing for scientific computing, pp 445\u2013452"},{"key":"255_CR4","doi-asserted-by":"crossref","unstructured":"Chan P, Schlag M, Zien J (1993) Spectral k-way ratio-cut partitioning and clustering. In: Proceedings of the 30th international conference on design automation. ACM, New York, NY, USA, pp 749\u2013754","DOI":"10.1145\/157485.165117"},{"key":"255_CR5","unstructured":"Della Pietra S, Della Pietra V, Lafferty J (2002) Duality and auxiliary functions for Bregman distances. Technical report, Technical Report CMU-CS-01-109, School of Computer Science, Carnegie Mellon University, 2001"},{"key":"255_CR6","doi-asserted-by":"crossref","unstructured":"Dhillon I (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 269\u2013274","DOI":"10.1145\/502512.502550"},{"key":"255_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon I, Guan Y, Kulis B (2005) A fast kernel-based multilevel algorithm for graph clustering. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining. ACM, New York, NY, USA, pp 629\u2013634","DOI":"10.1145\/1081870.1081948"},{"key":"255_CR8","unstructured":"Dhillon I, Guan Y, Kulis B (2005) A unified view of kernel k-means, spectral clustering and graph cuts. The University of Texas at Austin, Department of Computer Sciences, Technical Report TR-04"},{"key":"255_CR9","doi-asserted-by":"crossref","unstructured":"Dhillon I, Mallela S, Modha D (2003) Information-theoretic co-clustering. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 89\u201398","DOI":"10.1145\/956750.956764"},{"key":"255_CR10","doi-asserted-by":"crossref","unstructured":"Ding C, He X, Zha H, Gu M, Simon H (2001) A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings IEEE international conference on data mining, 2001, ICDM 2001, pp 107\u2013114","DOI":"10.1109\/ICDM.2001.989507"},{"key":"255_CR11","unstructured":"El-Yaniv R, Souroujon O (2001) Iterative double clustering for unsupervised and semi-supervised learning. In: EMCL\u201901: Proceedings of the 12th European conference on machine learning. Springer, London, UK, pp 121\u2013132. ISBN:3-540-42536-5"},{"key":"255_CR12","doi-asserted-by":"crossref","unstructured":"Gao B, Liu T, Zheng X, Cheng Q, Ma W (2005) Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining. ACM, New York, NY, USA, pp 41\u201350","DOI":"10.1145\/1081870.1081879"},{"key":"255_CR13","volume-title":"Matrix computations","author":"G Golub","year":"1996","unstructured":"Golub G, Van Loan C (1996) Matrix computations. Johns Hopkins University Press, Baltimore"},{"key":"255_CR14","doi-asserted-by":"crossref","unstructured":"Hendrickson B, Leland R (1995) A multilevel algorithm for partitioning graphs. In: Supercomputing \u201995: proceedings of the 1995 ACM\/IEEE conference on supercomputing (CDROM). ACM, New York, NY, USA, p 28","DOI":"10.1145\/224170.224228"},{"key":"255_CR15","doi-asserted-by":"crossref","unstructured":"Hofmann T (1999) Probabilistic latent semantic indexing. In: Proceedings of the 22nd annual international ACM SIGIR conference on research and development in information retrieval. ACM, New York, NY, USA, pp 50\u201357","DOI":"10.1145\/312624.312649"},{"key":"255_CR16","unstructured":"Hofmann T, Puzicha J (1999), Latent class models for collaborative filtering. In: IJCAI \u201999: proceedings of the sixteenth international joint conference on artificial intelligence. Morgan Kaufmann, San Francisco, CA, USA, pp 688\u2013693"},{"issue":"1","key":"255_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1): 359","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"255_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B Kernighan","year":"1970","unstructured":"Kernighan B, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2): 291\u2013307","journal-title":"Bell Syst Tech J"},{"key":"255_CR19","doi-asserted-by":"crossref","unstructured":"Lang K (1995) Newsweeder: learning to filter netnews. In: Proceedings of the twelfth international conference on machine learning, pp 331\u2013339","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"255_CR20","first-page":"556","volume":"13","author":"DD Lee","year":"2001","unstructured":"Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. Adv Neural Inf Process Syst 13: 556\u2013562","journal-title":"Adv Neural Inf Process Syst"},{"key":"255_CR21","doi-asserted-by":"crossref","unstructured":"Li T (2005) A general model for clustering binary data. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining. ACM, New York, NY, USA, pp 188\u2013197","DOI":"10.1145\/1081870.1081894"},{"key":"255_CR22","doi-asserted-by":"crossref","unstructured":"Long B, Binghamton S, Wu X, Zhang Z, Yu P (2007) Community learning by graph approximation. In: Proceedings of the 2007 seventh IEEE international conference on data mining. IEEE Computer Society, Washington, DC, USA, pp 232\u2013241","DOI":"10.1109\/ICDM.2007.42"},{"key":"255_CR23","doi-asserted-by":"crossref","unstructured":"Long B, Wu X, Zhang Z, Yu P (2006) Unsupervised learning on k-partite graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 317\u2013326","DOI":"10.1145\/1150402.1150439"},{"key":"255_CR24","doi-asserted-by":"crossref","unstructured":"Long B, Zhang Z, Yu P (2005) Co-clustering by block value decomposition. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining. ACM, New York, NY, USA, pp 635\u2013640","DOI":"10.1145\/1081870.1081949"},{"key":"255_CR25","doi-asserted-by":"crossref","unstructured":"Long B, Zhang Z, Wu X, Yu P (2006) Spectral clustering for multi-type relational data. In: Proceedings of the 23rd international conference on machine learning. ACM, New York, NY, USA, pp 585\u2013592","DOI":"10.1145\/1143844.1143918"},{"key":"255_CR26","unstructured":"Neville J, Adler M, Jensen D (2003) Clustering relational data using attribute and link information. In: Proceedings of the IJCAI text mining and link analysis workshop"},{"key":"255_CR27","first-page":"849","volume":"2","author":"A Ng","year":"2002","unstructured":"Ng A, Jordan M, Weiss Y (2002) On spectral clustering: analysis and an algorithm. Adv Neural Inf Process Syst 2: 849\u2013856","journal-title":"Adv Neural Inf Process Syst"},{"key":"255_CR28","unstructured":"Salakhutdinov R, Roweis S (2003) Adaptive overrelaxed bound optimization methods. In: Machine learning-international workshop then conference, vol 20, p 664"},{"key":"255_CR29","unstructured":"Shental N, Zomet A, Hertz T, Weiss Y (2003) Pairwise clustering and graphical models. Adv Neural Inf Process Syst 16"},{"issue":"8","key":"255_CR30","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8): 888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"255_CR31","first-page":"583","volume":"3","author":"A Strehl","year":"2003","unstructured":"Strehl A, Ghosh J (2003) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3: 583\u2013617","journal-title":"J Mach Learn Res"},{"key":"255_CR32","unstructured":"Tishby N, Pereira FC, Bialek W (1999) The information bottleneck method. In: Proceedings of the 37th annual allerton conference on communication, control and computing, pp 368\u2013377"},{"key":"255_CR33","unstructured":"Van Dongen SM (2000) Graph clustering by flow simulation. PhD thesis, University of Utrecht"},{"key":"255_CR34","doi-asserted-by":"crossref","unstructured":"Wang J, Zeng H, Chen Z, Lu H, Tao L, Ma W (2003) ReCoM: reinforcement clustering of multi-type interrelated data objects. In: Proceedings of the 26th annual international ACM SIGIR conference on research and development in informaion retrieval. ACM, New York, NY, USA, pp 274\u2013281","DOI":"10.1145\/860435.860486"},{"key":"255_CR35","first-page":"1553","volume":"18","author":"K Yu","year":"2006","unstructured":"Yu K, Yu S, Tresp V (2006) Soft clustering on graphs. Adv Neural Inf Process Syst 18: 1553","journal-title":"Adv Neural Inf Process Syst"},{"key":"255_CR36","doi-asserted-by":"crossref","unstructured":"Yu SX, Shi J (2003) Multiclass spectral clustering. In: ICCV \u201903: Proceedings of the ninth IEEE international conference on computer vision. IEEE Computer Society, Washington, DC, USA, p 313","DOI":"10.1109\/ICCV.2003.1238361"},{"key":"255_CR37","unstructured":"Zeng H-J, Chen Z, Ma W-Y (2002) A unified framework for clustering heterogeneous web objects. In: WISE\u201902: Proceedings of the 3rd international conference on web information systems engineering. IEEE Computer Society, Washington, DC, USA, pp 161\u2013172. ISBN:0-7695-1766-8"},{"key":"255_CR38","doi-asserted-by":"crossref","unstructured":"Zha H, He X, Ding C, Simon H, Gu M (2001) Bipartite graph partitioning and data clustering. In: Proceedings of the tenth international conference on information and knowledge management. ACM, New York, NY, USA, pp 25\u201332","DOI":"10.2172\/816202"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0255-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0255-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0255-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:20Z","timestamp":1559124620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0255-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,2]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0255-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,2]]}}}