{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:01:05Z","timestamp":1772906465177,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. &amp; Technol."],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1007\/bf02948829","type":"journal-article","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:18:59Z","timestamp":1221265139000},"page":"611-624","source":"Crossref","is-referenced-by-count":119,"title":["Squeezer: An efficient algorithm for clustering categorical data"],"prefix":"10.1007","volume":"17","author":[{"given":"Zengyou","family":"He","sequence":"first","affiliation":[]},{"given":"Xiaofei","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Shengchun","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02948829_CR1","doi-asserted-by":"crossref","unstructured":"Sudipto Guha, Rajeev Rastogi, Kyuseok Shim. ROCK: A robust clustering algorithm for categorical attributes. InProc. 1999 Int. Conf. Data Engineering, Sydney, Australia, Mar., 1999, pp. 512\u2013521.","DOI":"10.1109\/ICDE.1999.754967"},{"key":"BF02948829_CR2","unstructured":"Alexandros Nanopoulos, Yannis Theodoridis, Yannis Manolopoulos C2P: Clustering based on closest pairs. InProc. 27th Int. Conf. Very Large Database, Rome, Italy, September, 2001, pp. 331\u2013340."},{"key":"BF02948829_CR3","unstructured":"Ester M, Kriegel H P, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases. InProc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD\u201996), Portland, Oregon, USA., Aug., 1996, pp.226\u2013231."},{"key":"BF02948829_CR4","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livny M. BIRTH: An efficient data clustering method for very large databases. InProc. the ACM-SIGMOD Int. Conf. Management of Data, Montreal, Quebec, Canada, June, 1996, pp. 103\u2013114.","DOI":"10.1145\/235968.233324"},{"key":"BF02948829_CR5","doi-asserted-by":"crossref","unstructured":"Sudipto Guha, Rajeev Rastogi, Kyuseok Shim. CURE: A clustering algorithm for large databases. InProc. the ACM SIGMOD Int. Conf. Management of Data, Seattle, Washington, USA, June, 1998, pp. 73\u201384.","DOI":"10.1145\/276304.276312"},{"issue":"8","key":"BF02948829_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han E-H, Kumar V. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling.IEEE Computer, 1999, 32(8): 68\u201375.","journal-title":"IEEE Computer"},{"key":"BF02948829_CR7","unstructured":"Sheikholeslami G, Chatterjee S, Zhang A. WaveCluster: A multi-resolution clustering approach for very large spatial databases. InProc. 1998 Int. Conf. Very Large Databases, New York, August, 1998, pp. 428\u2013439."},{"key":"BF02948829_CR8","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. InProc. the 1998 ACM SIGMOD Int. Conf. Management of Data, Seattle, Washington, USA, June, 1998, pp. 94\u2013105.","DOI":"10.1145\/276304.276314"},{"issue":"6\/7","key":"BF02948829_CR9","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/S0167-8655(00)00131-8","volume":"22","author":"M F Jiang","year":"2001","unstructured":"Jiang M F, Tseng S S, Su C M. Two-phase clustering process for outliers detection.Pattern Recognition Letters, 2001, 22(6\/7): 691\u2013700.","journal-title":"Pattern Recognition Letters"},{"key":"BF02948829_CR10","unstructured":"Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishnan. CACTUS-clustering categorical data using summaries. InProc. 1999 Int. Conf. Knowledge Discovery and Data Mining, August, 1999, pp. 73\u201383."},{"key":"BF02948829_CR11","unstructured":"UCI Repository of Machine Learning Databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRRepository.html"},{"key":"BF02948829_CR12","unstructured":"Huang Z. A fast clustering algorithm to cluster very large categorical data sets in data mining. InProc. SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Tucson, Arizona, USA, May, 1997, pp. 146\u2013151."},{"key":"BF02948829_CR13","unstructured":"David Gibson, Jon Kleiberg, Prabhakar Raghavan. Clustering categorical data: An approach based on dynamic systems. InProc. 1998 Int. Conf. Very Large Databases, New York, August, 1998, pp. 311\u2013322."},{"key":"BF02948829_CR14","unstructured":"Zhang Yi, Ada Wai-Chee Fu, Chun Hing Cai, Peng-Ann Heng. Clustering categorical data. InProc. 2000 IEEE Int. Conf. Data Engineering, San Deigo, USA, March, 2000, p.305."},{"key":"BF02948829_CR15","unstructured":"Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad Mobasher. Clustering based on association rule hypergraphs. InProc. 1997 SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery. Tucson, Arizona, USA, May, 1997, pp. 78\u201385."},{"key":"BF02948829_CR16","doi-asserted-by":"crossref","unstructured":"Wang Ke, Xu Chu, Liu Bing. Clustering transactions using large items. InProceedings of the 1999 ACM International Conference on Information and Knowledge Management, Kansas City, Missouri, USA, November, 1999, pp. 483\u2013490.","DOI":"10.1145\/319950.320054"},{"key":"BF02948829_CR17","doi-asserted-by":"crossref","unstructured":"Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O\u2019Callaghan. Clustering data streams. InThe 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, USA, November, 2000, pp. 359\u2013366.","DOI":"10.1109\/SFCS.2000.892124"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948829\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:03:09Z","timestamp":1558566189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["BF02948829"],"URL":"https:\/\/doi.org\/10.1007\/bf02948829","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}