{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:47Z","timestamp":1725796847710},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319086071"},{"type":"electronic","value":"9783319086088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08608-8_13","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T01:30:34Z","timestamp":1404437434000},"page":"147-159","source":"Crossref","is-referenced-by-count":3,"title":["Fast Information-Theoretic Agglomerative Co-clustering"],"prefix":"10.1007","author":[{"given":"Tiantian","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leman","family":"Akoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"16-18","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1016\/j.neucom.2006.02.018","volume":"69","author":"A. Abdullah","year":"2006","unstructured":"Abdullah, A., Hussain, A.: A new biclustering technique based on crossing minimization. Neurocomputing\u00a069(16-18), 1882\u20131896 (2006)","journal-title":"Neurocomputing"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data. In: SIGMOD, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. SIGMOD\u00a022(2), 207\u2013216 (1993)","journal-title":"SIGMOD"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Akoglu, L., Tong, H., Meeder, B., Faloutsos, C.: Pics: Parameter-free identification of cohesive subgroups in large attributed graphs. In: SDM (2012)","DOI":"10.1137\/1.9781611972825.38"},{"key":"13_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 74\u201386. Springer, Heidelberg (2002)"},{"key":"13_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-540-30116-5_13","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"D. Chakrabarti","year":"2004","unstructured":"Chakrabarti, D.: AutoPart: Parameter-free graph partitioning and outlier detection. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 112\u2013124. Springer, Heidelberg (2004)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully automatic cross-associations. In: ACM SIGKDD, pp. 79\u201388 (2004)","DOI":"10.21236\/ADA459025"},{"issue":"6","key":"13_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S., Furnas, G., Landauer, T., Harshman, R.: Indexing by latent semantic analysis. JASI\u00a041(6), 391\u2013407 (1990)","journal-title":"JASI"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Mallela, S., Modha, D.: Information- theoretic co-clustering. In: ACM SIGKDD (2003)","DOI":"10.1145\/956755.956764"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: PNAS, 104(1), 36 (2007)","DOI":"10.1073\/pnas.0605965104"},{"key":"13_CR11","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB, pp. 518\u2013529 (1999)"},{"key":"13_CR12","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-540-30116-5_18","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"A. Gionis","year":"2004","unstructured":"Gionis, A., Mannila, H., Sepp\u00e4nen, J.K.: Geometric and combinatorial tiles in 0-1 data. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 173\u2013184. Springer, Heidelberg (2004)"},{"key":"13_CR13","unstructured":"Hamerly, G., Elkan, C.: Learning the k in k-means. In: NIPS (2003)"},{"key":"13_CR14","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: ICDM, pp. 211\u2013218 (2002)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Karypis, G., Han, E.-H., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer\u00a032(8) (1999)","DOI":"10.1109\/2.781637"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: A survey. TKDD\u00a03(1), 1:1\u20131:58 (2009)","DOI":"10.1145\/1497577.1497578"},{"key":"13_CR17","unstructured":"Kr\u00f6ger, P., Kriegel, H.-P., Kailing, K.: Density-connected subspace clustering for high-dimensional data. In: SDM (2004)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Raghavan, P., Schtze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511809071"},{"key":"13_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-45167-9_33","volume-title":"Learning Theory and Kernel Machines","author":"N. Mishra","year":"2003","unstructured":"Mishra, N., Ron, D., Swaminathan, R.: On finding large conjunctive clusters. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 448\u2013462. Springer, Heidelberg (2003)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physical Review E\u00a069 (2004)","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"13_CR21","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS (2001)"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Pan, J., Manocha, D.: Bi-level locality sensitive hashing for k-nearest neighbor computation. In: ICDE, pp. 378\u2013389 (2012)","DOI":"10.1109\/ICDE.2012.40"},{"key":"13_CR23","unstructured":"Pelleg, D., Moore, A.: X-means: Extending K-means with efficient estimation of the number of clusters. In: ICML (2000)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1186\/1471-2105-7-280","volume":"7","author":"D.J. Reiss","year":"2006","unstructured":"Reiss, D.J., Baliga, N.S., Bonneau, R.: Integrated biclustering of heterogeneous genome-wide datasets. BMC Bioinformatics\u00a07, 280 (2006)","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J. Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. The Annals of Statistics\u00a011(2), 416\u2013431 (1983)","journal-title":"The Annals of Statistics"},{"issue":"5","key":"13_CR26","first-page":"430","volume":"5","author":"V. Satuluri","year":"2012","unstructured":"Satuluri, V., Parthasarathy, S.: Bayesian locality sensitive hashing for fast similarity search. PVLDB\u00a05(5), 430\u2013441 (2012)","journal-title":"PVLDB"},{"key":"13_CR27","unstructured":"Slonim, N., Tishby, N.: Agglomerative information bottleneck. In: NIPS (1999)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs. In: ACM SIGKDD, pp. 687\u2013696 (2007)","DOI":"10.1145\/1281192.1281266"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Wang, Y., Parthasarathy, S., Tatikonda, S.: Locality sensitive outlier detection: A ranking driven approach. In: ICDE, pp. 410\u2013421 (2011)","DOI":"10.1109\/ICDE.2011.5767852"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08608-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T03:07:47Z","timestamp":1558926467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08608-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319086071","9783319086088"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08608-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}