{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:05:35Z","timestamp":1778904335362,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10618-005-1396-1","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T13:08:37Z","timestamp":1122815317000},"page":"5-33","source":"Crossref","is-referenced-by-count":245,"title":["Automatic Subspace Clustering of High Dimensional Data"],"prefix":"10.1007","volume":"11","author":[{"given":"Rakesh","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Gehrke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1396_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. and Yu, P.S. 2000. Finding generalized projected clusters in high dimensional spaces. In Proc. of SIGMOD 2000 Conference, pp. 70\u201381.","DOI":"10.1145\/342009.335383"},{"key":"1396_CR2","doi-asserted-by":"crossref","unstructured":"Aggrawal, C., Procopiuc, C., Wolf, J., Yu, P., and Park, J. 1999. Fast algorithms for projected clustering. In Proc. of 1999 ACM SIGMOD Int. Conf. on Management of Data, Philadelphia, PA.","DOI":"10.1145\/304182.304188"},{"key":"1396_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., and Raghavan, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. of 1998 ACM SIGMOD Int. Conf. on Management of Data, pp. 94\u2013105.","DOI":"10.1145\/276304.276314"},{"key":"1396_CR4","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.). AAAI\/MIT Press, Chap 12, pp. 307\u2013328."},{"key":"1396_CR5","unstructured":"Aho, A., Hopcroft, J., and Ullman, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Welsley."},{"key":"1396_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1142\/9789812832153_0002","volume-title":"Clustering and Classification","author":"P. Arabie","year":"1996","unstructured":"Arabie, P. and Hubert, L.J. 1996. An overview of combinatorial data analyis. In Clustering and Classification. P. Arabie, L. Hubert, and G.D. Soete, (Eds.). New Jersey: World Scientific Pub., pp. 5\u201363."},{"key":"1396_CR7","unstructured":"Arbor Software Corporation. Application Manager User\u2019s Guide, Essbase Version 4.0 edition."},{"key":"1396_CR8","doi-asserted-by":"crossref","unstructured":"Bayardo, R. 1998. Efficiently mining long patterns from databases. In Proc. of the ACM SIGMOD Conference on Management of Data, Seattle, Washington.","DOI":"10.1145\/276304.276313"},{"key":"1396_CR9","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Keim, D., and Kriegel, H.-P. 1997. A cost model for nearest neighbor search in high-dimensional data space. In Proceedings of the 16th Symposium on Principles of Database Systems (PODS), pp. 78\u201386.","DOI":"10.1145\/263661.263671"},{"issue":"5","key":"1396_CR10","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1109\/21.120081","volume":"21","author":"M. Berger","year":"1991","unstructured":"Berger, M. and Regoutsos, I. 1991. An algorithm for point clustering and grid generation. IEEE Transactions on Systems, Man and Cybernetics, 21(5):1278\u201386.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"1396_CR11","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J. D., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD Conference on Management of Data.","DOI":"10.1145\/253260.253325"},{"key":"1396_CR12","doi-asserted-by":"crossref","unstructured":"Bronniman, H. and Goodrich, M. 1994. Almost optimal set covers in finite VC-dimension. In Proc. of the 10th ACM Symp. on Computational Geometry, pp. 293\u2013302.","DOI":"10.1145\/177424.178029"},{"key":"1396_CR13","unstructured":"Cheeseman, P. and Stutz, J. 1996. Bayesian classification (autoclass): Theory and results. In Advances in Knowledge Discovery and Data Mining. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, (Eds.). Chap 6. AAAI\/MIT Press, pp. 153\u2013180."},{"key":"1396_CR14","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/00401706.1979.10489824","volume":"21","author":"R. Chhikara","year":"1979","unstructured":"Chhikara, R. and Register, D. 1979. A numerical classification method for partitioning of a large multidimensional mixed data set. Technometrics, 21:531\u2013537.","journal-title":"Technometrics"},{"key":"1396_CR15","doi-asserted-by":"crossref","unstructured":"Domeniconi, C., Papadopoulos, D., Gunopulos, D., and Ma, S. 2004. Subspace clustering of high dimensional data. SIAM International Conference on Data Mining (SDM).","DOI":"10.1137\/1.9781611972740.58"},{"key":"1396_CR16","unstructured":"Duda, R.O. and Hart, P.E. 1973. Pattern Classification and Scene Analysis. John Wiley and Sons."},{"key":"1396_CR17","unstructured":"Earle, R.J. 1994. Method and apparatus for storing and retrieving multi-dimensional data in computer memory. U.S. Patent No. 5359724."},{"key":"1396_CR18","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of the 2nd Int\u2019l Conference on Knowledge Discovery in Databases and Data Mining, Portland, Oregon."},{"key":"1396_CR19","unstructured":"Ester, M., Kriegel, H. -P., and Xu, X. 1995. A database interface for clustering in large spatial databases. In Proc. of the 1st Int\u2019l Conference on Knowledge Discovery in Databases and Data Mining, Montreal, Canada."},{"key":"1396_CR20","unstructured":"Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R. (Eds.). 1996. Advances in Knowledge Discovery and Data Mining. AAAI\/MIT Press."},{"key":"1396_CR21","unstructured":"Feige, U. 1996. A threshold of ln n for approximating set cover. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 314\u2013318."},{"issue":"3","key":"1396_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/0402027","volume":"2","author":"D. Franzblau","year":"1989","unstructured":"Franzblau, D. 1989. Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles. SIAM J. Disc. Math, 2(3):307\u2013321.","journal-title":"SIAM J. Disc. Math"},{"key":"1396_CR23","doi-asserted-by":"crossref","unstructured":"Franzblau, D.S. and Kleitman, D.J. 1984. An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals. In Proc. of the 6th Annual Symp. on Theory of Computing, Washington D.C., pp. 268\u2013276.","DOI":"10.1145\/800057.808678"},{"key":"1396_CR24","unstructured":"Friedman, J. 1997. Optimizing a noisy function of many variables with application to data mining. In UW\/MSR Summer Research Institute in Data Mining."},{"key":"1396_CR25","doi-asserted-by":"crossref","unstructured":"Fukunaga, K. 1990. Introduction to Statistical Pattern Recognition. Academic Press.","DOI":"10.1016\/B978-0-08-047865-4.50007-7"},{"key":"1396_CR26","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., and Shim, K. 1998. CURE: An efficient clustering algorithm for large databases. Proceedings of ACM SIGMOD, pp. 73\u201384.","DOI":"10.1145\/276304.276312"},{"key":"1396_CR27","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., and Saluja, S. 1997. Data mining, hypergraph transversals, and machine learning. In Proc. of the 16th ACM Symp. on Principles of Database Systems, pp. 209\u2013216."},{"key":"1396_CR28","doi-asserted-by":"crossref","unstructured":"Ho, C.-T., Agrawal, R., Megiddo, N., and Srikant, R. 1997. Range queries in OLAP data cubes. In Proc. of the ACM SIGMOD Conference on Management of Data, Tucson, Arizona.","DOI":"10.1145\/253260.253274"},{"key":"1396_CR29","unstructured":"Hong, S.J. 1987. MINI: A heuristic algorithm for two-level logic minimization. In Selected Papers on Logic Synthesis for Integrated Circuit Design, R. Newton (Eds.). IEEE Press."},{"key":"1396_CR30","unstructured":"Internationl Business Machines. 1996. IBM Intelligent Miner User\u2019s Guide, Version 1 Release 1, SH12-6213-00 edition, July 1996."},{"key":"1396_CR31","unstructured":"Jain, A.K. and Dubes, R.C. 1988. Algorithms for Clustering Data. Prentice Hall."},{"key":"1396_CR32","doi-asserted-by":"crossref","unstructured":"Kaufman, L. and Rousseeuw, P. 1990. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley and Sons.","DOI":"10.1002\/9780470316801"},{"key":"1396_CR33","doi-asserted-by":"crossref","unstructured":"Lin, D.-I. and Kedem, Z.M. 1998. Pincer search: A new algorithm for discovering the maximum frequent sets. In Proc. of the 6th Int\u2019l Conference on Extending Database Technology (EDBT), Valencia, Spain.","DOI":"10.1007\/BFb0100980"},{"key":"1396_CR34","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L. 1975. On the ratio of the optimal integral and fractional covers. Discrete Mathematics, 13:383\u2013390.","journal-title":"Discrete Mathematics"},{"key":"1396_CR35","doi-asserted-by":"crossref","unstructured":"Lund, C. and Yannakakis, M. 1993. On the hardness of approximating minimization problems. In Proceedings of the ACM Symposium on Theory of Computing, pp. 286\u2013293.","DOI":"10.1145\/167088.167172"},{"key":"1396_CR36","unstructured":"Masek, W. 1978. Some NP-Complete Set Covering Problems. M.S. Thesis, MIT."},{"key":"1396_CR37","doi-asserted-by":"crossref","unstructured":"Mehta, M., Agrawal, R., and Rissanen, J. 1996. SLIQ: A fast scalable classifier for data mining. In Proc. of the Fifth Int\u2019l Conference on Extending Database Technology (EDBT), Avignon, France.","DOI":"10.1007\/BFb0014141"},{"key":"1396_CR38","unstructured":"Michalski, R.S. and Stepp, R.E. 1983. Learning from observation: Conceptual clustering. In Machine Learning: An Artificial Intelligence Approach, R.S. Michalski, J.G. Carbonell, and T. M. Mitchell (Eds.). Volume I. Morgan Kaufmann, pp. 331\u2013363."},{"key":"1396_CR39","doi-asserted-by":"crossref","unstructured":"Miller, R. and Yang, Y. 1997. Association rules over interval data. In Proc. ACM SIGMOD International Conf. on Management of Data, pp. 452\u2013461.","DOI":"10.1145\/253260.253361"},{"key":"1396_CR40","unstructured":"Ng, R.T. and Han, J. 1994. Efficient and effective clustering methods for spatial data mining. In Proc. of the VLDB Conference, Santiago, Chile."},{"key":"1396_CR41","doi-asserted-by":"crossref","unstructured":"Procopiuc, C.M., Jones, M., Agarwal, P.K., and Murali, T.M. 2002. A Monte Carlo algorithm for fast projective clustering. SIGMOD.","DOI":"10.1145\/564691.564739"},{"key":"1396_CR42","doi-asserted-by":"crossref","unstructured":"Reckhow, R.A. and Culberson, J. 1987. Covering simple orthogonal polygon with a minimum number of orthogonally convex polygons. In Proc. of the ACM 3rd Annual Computational Geometry Conference, pp. 268\u2013277.","DOI":"10.1145\/41958.41987"},{"key":"1396_CR43","unstructured":"Rissanen, J. 1989. Stochastic Complexity in Statistical Inquiry. World Scientific Publ. Co."},{"issue":"5","key":"1396_CR44","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/0031-3203(94)00133-7","volume":"25","author":"P. Schroeter","year":"1995","unstructured":"Schroeter, P. and Bigun, J. 1995. Hierarchical image segmentation by multi-dimensional clustering and orientation-adaptive boundary refinement. Pattern Recognition, 25(5):695\u2013709.","journal-title":"Pattern Recognition"},{"key":"1396_CR45","unstructured":"Shafer, J., Agrawal, R. and Mehta, M. 1996. SPRINT: A scalable parallel classifier for data mining. In Proc. of the 22nd Int\u2019l Conference on Very Large Databases, Bombay, India."},{"key":"1396_CR46","unstructured":"Shoshani, A. Personal communication, 1997."},{"key":"1396_CR47","unstructured":"Sneath, P. and Sokal, R. 1973. Numerical Taxonomy. Freeman."},{"key":"1396_CR48","doi-asserted-by":"crossref","unstructured":"Soltan, V. and Gorpinevich, A. 1992. Minimum dissection of rectilinear polygon with arbitrary holes into rectangles. In Proc. of the ACM 8th Annual Computational Geometry Conference, Berlin, Germany, pp. 296\u2013302.","DOI":"10.1145\/142675.142735"},{"key":"1396_CR49","doi-asserted-by":"crossref","unstructured":"Srikant, R. and Agrawal, R. 1996. Mining quantitative association rules in large relational tables. In Proc. of the ACM SIGMOD Conference on Management of Data, Montreal, Canada.","DOI":"10.1145\/233269.233311"},{"key":"1396_CR50","unstructured":"Toivonen, H. 1996. Sampling large databases for association rules. In Proc. of the 22nd Int\u2019l Conference on Very Large Databases, Mumbai (Bombay), India, pp. 134\u2013145."},{"issue":"2","key":"1396_CR51","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0031-3203(83)90022-5","volume":"16","author":"S. Wharton","year":"1983","unstructured":"Wharton, S. 1983. A generalized histogram clustering for multidimensional image data. Pattern Recognition, 16(2):193\u2013199.","journal-title":"Pattern Recognition"},{"issue":"2\u20133","key":"1396_CR52","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-739X(97)00018-6","volume":"13","author":"M. Zait","year":"1997","unstructured":"Zait, M. and Messatfa, H. 1997. A comparative study of clustering methods. Future Generation Computer Systems, 13(2-3):149\u2013159.","journal-title":"Future Generation Computer Systems"},{"key":"1396_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, D. and Bowyer, A. 1986. CSG set-theoretic solid modelling and NC machining of blend surfaces. In Proceedings of the Second Annual ACM Symposium on Computational Geometry, pp. 314\u2013318.","DOI":"10.1145\/10515.10541"},{"key":"1396_CR54","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., and Livny, M. 1996. BIRCH: An efficient data clustering method for very large databases. In Proc. of the ACM SIGMOD Conference on Management of Data, Montreal, Canada.","DOI":"10.1145\/233269.233324"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-1396-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-005-1396-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-1396-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T13:42:54Z","timestamp":1586353374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-005-1396-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["1396"],"URL":"https:\/\/doi.org\/10.1007\/s10618-005-1396-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}