{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:06:48Z","timestamp":1758272808150,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdm.2002.1183915","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"290-297","source":"Crossref","is-referenced-by-count":31,"title":["O-Cluster: scalable clustering of large high dimensional data sets"],"prefix":"10.1109","author":[{"given":"B.L.","family":"Milenova","sequence":"first","affiliation":[]},{"given":"M.M.","family":"Campos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"528","article-title":"Active Data Clustering","author":"hofmann","year":"1997","journal-title":"Advances in Neural Information Processing Systems (NIPS"},{"key":"ref11","first-page":"58","article-title":"An Efficient Approach to Clustering in Large Multimedia Databases with Noise","author":"hinneburg","year":"1998","journal-title":"Proc 1998 Int Conf Knowledge Discovery and Data Mining (KDD'98)"},{"key":"ref12","first-page":"506","article-title":"Optimal Grid -Clustering: Towards Breaking the Curse of Dimensionality in High- Dimensional Clustering","volume":"1999","author":"hinneburg","year":"0","journal-title":"Proc 25th Int l Conf Very Large Data Bases (VLDB 99)"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","article-title":"Finding Groups in Data: An introduction to Cluster Analysis","author":"kaufman","year":"1990"},{"key":"ref14","first-page":"281","article-title":"Some Methods for Classification and Analysis of Multivariate Observations","volume":"1","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Prob"},{"key":"ref15","article-title":"MAFIA: Efficient and Scalable Subspace Clustering for Very Large Data Sets","author":"nagesh","year":"1999","journal-title":"Technical Report 9906–010"},{"key":"ref16","first-page":"144","article-title":"Efficient and Effective Clustering Method for Spatial Data Mining","author":"ng","year":"1994","journal-title":"Proc Conf Very Large Data Bases (VLDB)"},{"article-title":"Multivariate Density Estimation","year":"1979","author":"scott","key":"ref17"},{"key":"ref18","first-page":"428","article-title":"WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases","volume":"1998","author":"sheikholeslami","year":"0","journal-title":"Proc 1998 Very Large Data Bases Conf (VLDB)"},{"key":"ref19","first-page":"59","article-title":"Data-Based Choice of Histogram Bin Width","volume":"51","author":"wand","year":"1996","journal-title":"The American Statistician"},{"key":"ref4","first-page":"8","article-title":"Scaling Clustering Algorithms to Large Databases","author":"bradely","year":"1998","journal-title":"Proc 1998 Int Conf Knowledge Discovery and Data Mining (KDD 98)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335383"},{"key":"ref6","first-page":"226","article-title":"A Density - Based Algorithm for Discovering Clusters in Large Spatial Database","author":"ester","year":"1996","journal-title":"Proc 1996 Int Conf Knowledg Discovery and Data Mining (KDD '96)"},{"key":"ref5","first-page":"217","article-title":"When Is ‘Nearest Neighbor’ Meaningful?","volume":"1999","author":"beyer","year":"0","journal-title":"Proc Intern Conf on Database Theory (ICDT 99)"},{"key":"ref8","first-page":"73","article-title":"CURE: An Efficient Clustering Algorithm for Large Databases","author":"ester","year":"1998","journal-title":"Proc 1998 ACM-SIGMOD Int Conf Management of Data (SIGMOD'98)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360419"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304188"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"ref9","first-page":"506","article-title":"What Is the Nearest Neighbor in High Dimensional Spaces?","volume":"2000","author":"hinneburg","year":"0","journal-title":"Proc Very Large Data Bases Conf (VLDB 00)"},{"key":"ref20","first-page":"186","article-title":"STING: A Statistical Information Grid Approach to Spatial Data Mining","author":"wang","year":"1997","journal-title":"Proceedings of the 1997 International Conference on Very Large Data Bases (VLDB)"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/233269.233324","article-title":"BIRCH: An efficient Data Clustering Method for Very Large Databases","author":"zhang","year":"1996","journal-title":"Proc 1996 SIGMOD Conf"}],"event":{"name":"2002 IEEE International Conference on Data Mining. ICDM 2002","acronym":"ICDM-02","location":"Maebashi City, Japan"},"container-title":["2002 IEEE International Conference on Data Mining, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8435\/26564\/01183915.pdf?arnumber=1183915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:46:34Z","timestamp":1497552394000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1183915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icdm.2002.1183915","relation":{},"subject":[]}}