{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:40Z","timestamp":1725566380586},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231080"},{"type":"electronic","value":"9783540301165"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30116-5_37","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T03:34:59Z","timestamp":1284780899000},"page":"398-409","source":"Crossref","is-referenced-by-count":5,"title":["Itemset Classified Clustering"],"prefix":"10.1007","author":[{"given":"Jun","family":"Sese","sequence":"first","affiliation":[]},{"given":"Shinichi","family":"Morishita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proc. of ACM SIGMOD 1998, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"key":"37_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of 20th VLDB, pp. 487\u2013499 (1994)"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: Proc. of ACM SIGMOD 1998, pp. 85\u201393 (1998)","DOI":"10.1145\/276305.276313"},{"key":"37_CR4","volume-title":"Classification and Regression Trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Olshen, R.A., Friedman, J.H., Stone, C.J.: Classification and Regression Trees. Brooks\/Cole Publishing Company, Monterey (1984)"},{"key":"37_CR5","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proc. of the Eighth Intl. Conf. on ISMB, pp. 93\u2013103 (2000)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S1097-2765(00)80114-8","volume":"2","author":"R.J. Cho","year":"1998","unstructured":"Cho, R.J., Campbell, M.J., et al.: A genome-wide transcriptional analysis of the mitotic cell cycle. Molecular Cell\u00a02, 65\u201373 (1998)","journal-title":"Molecular Cell"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1126\/science.278.5338.680","volume":"278","author":"J.L. DeRisi","year":"1997","unstructured":"DeRisi, J.L., Iyer, V.R., Brown, P.O.: Exploring the metabolic and genetic control of gene expression on a genomic scale. Science\u00a0278, 680\u2013686 (1997)","journal-title":"Science"},{"key":"37_CR8","volume-title":"Computer and Intractability. A Guide to NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability. A Guide to NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: Cure: an efficient clustering algorithm for large databases. In: Proc. of ACM SIGMOD 1998, pp. 73\u201384 (1998)","DOI":"10.1145\/276305.276312"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"37_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global optimization: Deterministic approaches","author":"R. Horst","year":"1993","unstructured":"Horst, R., Tuy, H.: Global optimization: Deterministic approaches. Springer, Heidelberg (1993)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Michalski, R.S., Stepp, R.E.: Learning from observation: Conceptual clustering, pp. 331\u2013363. Tioga Publishing Company (1983)","DOI":"10.1007\/978-3-662-12405-5_11"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Morishita, S., Sese, J.: Traversing itemset lattice with statistical metric pruning. In: Proc. of ACM PODS 2000, pp. 226\u2013236 (2000)","DOI":"10.1145\/335168.335226"},{"key":"37_CR14","unstructured":"Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: 20th VLDB, Los Altos, CA 94022, USA, pp. 144\u2013155 (1994)"},{"key":"37_CR15","volume-title":"C4-5: programs for machine learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4-5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Sese, J., Kurokawa, Y., Monden, M., Kato, K., Morishita, S.: Constrained clusters of gene expression profiles with pathological features. Bioinformatics (2004) (in press)","DOI":"10.1093\/bioinformatics\/bth373"},{"key":"37_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-45681-3_34","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J. Sese","year":"2002","unstructured":"Sese, J., Morishita, S.: Answering the most correlated n association rules efficiently. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 410\u2013422. Springer, Heidelberg (2002)"},{"key":"37_CR18","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1091\/mbc.9.12.3273","volume":"9","author":"P.T. Spellman","year":"1998","unstructured":"Spellman, P.T., other: Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Molecular Biology of the Cell\u00a09, 3273\u20133297 (1998)","journal-title":"Molecular Biology of the Cell"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Tantrum, J., Murua, A., Stuetzle, W.: Hierarchical model-based clustering of large datasets through fractionation and refractionation. In: Proc. of the KDD 2002 (2002)","DOI":"10.1145\/775072.775074"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Wang, H., Wang, W., Yang, J., Yu, P.S.: Clustering by pattern similarity in large data sets. In: Proc. of ACM SIGMOD 2002, pp. 394\u2013405 (2002)","DOI":"10.1145\/564691.564737"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Zaki, M., Hsiao, C.: Charm: An efficient algorithm for closed itemset mining. In: 2nd SI AM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. In: Proc. of ACM SIGMOD 1996, pp. 103\u2013114 (1996)","DOI":"10.1145\/235968.233324"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30116-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:44:15Z","timestamp":1558305855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30116-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231080","9783540301165"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30116-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}