{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:19Z","timestamp":1759205299332,"version":"3.30.2"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10115-003-0141-6","type":"journal-article","created":{"date-parts":[[2004,4,8]],"date-time":"2004-04-08T08:47:30Z","timestamp":1081414050000},"page":"135-157","source":"Crossref","is-referenced-by-count":20,"title":["Accelerating EM clustering to find high-quality solutions"],"prefix":"10.1007","volume":"7","author":[{"given":"Carlos","family":"Ordonez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Omiecinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,2,1]]},"reference":[{"key":"141_CRAY2000","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Yu P (2000) Finding generalized projected clusters in high dimensional spaces. In: Proceedings of the ACM SIGMOD conference, pp 70\u201381","DOI":"10.1145\/342009.335383"},{"key":"141_CRAGG1998","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopolos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM SIGMOD conference, pp 94\u2013105","DOI":"10.1145\/276304.276314"},{"key":"141_CRBGR1999","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R (1999) When is nearest neighbor meaningful? In: Proceedings of the ICDT conference, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"141_CRBFR1998","unstructured":"Bradley P, Fayyad U, Reina C (1998) Scaling clustering algorithms to large databases. In: Proceedings of the ACM KDD conference, pp 9\u201315"},{"key":"141_CRBFR1999","unstructured":"Bradley P, Fayyad U, Reina C (1999) Scaling EM clustering to large databases. Technical Report, Microsoft Research"},{"key":"141_CRBRF2000","doi-asserted-by":"crossref","unstructured":"Bradley P, Reina C, Fayyad U (2000) Clustering very large databases using EM mixture models. In: Proceedings of the IEEE ICPR conference, pp 2076\u20132080","DOI":"10.1109\/ICPR.2000.906021"},{"key":"141_CRBKK2001","doi-asserted-by":"crossref","unstructured":"Breunig M, Kriegel H, Kroger P, Sander J (2001) Data bubbles: quality preserving performance boosting for hierarchical clustering. In: Proceedings of the ACM SIGMOD conference, pp 102\u2013113","DOI":"10.1145\/376284.375672"},{"key":"141_CRDLR1977","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"Dempster","year":"1977","unstructured":"Dempster A, Laird N, Rubin D (1977) Maximum likelihood estimation from incomplete data via the EM algorithm. J Royal Stat Soc 39(1):1\u201338","journal-title":"J Royal Stat Soc"},{"key":"141_CRDJ1980","doi-asserted-by":"crossref","unstructured":"Dubes R, Jain A (1980) Clustering methodologies in exploratory data analysis. Academic, New York, pp 10\u201335","DOI":"10.1016\/S0065-2458(08)60034-0"},{"key":"141_CRDH1973","unstructured":"Duda R, Hart P (1973) Pattern classification and scene analysis. Wiley, New York, pp 10\u201345"},{"key":"141_CREN2000","unstructured":"Elmasri R, Navathe SB (2000) Fundamentals of database systems. 3rd edn. Benjamin\/Cummings, Redwood City, CA, pp 841\u2013871"},{"key":"141_CRFLE2000","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"Fanstrom","year":"2000","unstructured":"Fanstrom F, Lewis J, Elkan C (2000) Scalability for clustering algorithms revisited. SIGKDD Explor 2(1):51\u201357","journal-title":"SIGKDD Explor"},{"key":"141_CRFRI1997","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1009653226428","volume":"5","author":"Fritzke","year":"1997","unstructured":"Fritzke B (1997) The LBG-U method for vector quantization\u2014an improvement over LBG inspired from neural networks. Neural Process Lett 5(1):35\u201345","journal-title":"Neural Process Lett"},{"key":"141_CRGGRKDD1999","doi-asserted-by":"crossref","unstructured":"Ganti V, Gehrke J, Ramakrishnan R (1999) Cactus-clustering categorical data using summaries. In: Proceedings of the ACM KDD conference, pp 73\u201383","DOI":"10.1145\/312129.312201"},{"key":"141_CRGRSCURE1998","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) Cure: an efficient clustering algorithm for large databases. In: Proceedings of the SIGMOD conference, pp 73\u201384","DOI":"10.1145\/276304.276312"},{"key":"141_CRGRS1999","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1999) ROCK: a robust clustering algorithm for categorical attributes. In: Proceedings of the ICDE conference, pp 512\u2013521","DOI":"10.1109\/ICDE.1999.754967"},{"key":"141_CRHE2002","unstructured":"Hammerly G, Elkan C (2002) Alternatives to k-means clustering that find better solutions. In: Proceedings of the ACM CIKM conference, pp 600\u2013607"},{"key":"141_CRHK1999","unstructured":"Hinneburg A, Keim D (1999) Optimal grid-clustering: towards breaking the curse of dimensionality. In: Proceedings of the VLDB conference, pp 506\u2013517"},{"key":"141_CRHUA1998","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Huang","year":"1998","unstructured":"Huang Z (1998) Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min Knowl Discov 2(3):283\u2013304","journal-title":"Data Min Knowl Discov"},{"key":"141_CRJJ1994","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"Jordan","year":"1994","unstructured":"Jordan M, Jacobs R (1994) Hierarchical mixtures of experts and the EM algorithm. Neural Comput 6(2):181\u2013214","journal-title":"Neural Comput"},{"key":"141_CRKN1999","unstructured":"Knorr E, Ng R (1999) Finding intentional knowledge of distance-based outliers. In: Proceedings of the VLDB conference, pp 211\u2013222"},{"key":"141_CRMK1997","unstructured":"MacLachlan G, Krishnan T (1997) The EM algorithm and extensions. Wiley, New York, pp 120\u2013211"},{"key":"141_CRMGB1974","unstructured":"Mood A, Graybill F, Boes D (1974) Introduction to the theory of statistics. McGraw-Hill, New York, pp 299\u2013320"},{"key":"141_CRNTM2001","unstructured":"Nanopoulos A, Theodoridis Y, Manolopoulos Y (2001) C2p: clustering based on closest pairs. In: Proceedings of the VLDB conference, pp 331\u2013340"},{"key":"141_CRNH1993","unstructured":"Neal R, Hinton G (1993) A view of the EM algorithm that justifies incremental, sparse and other variants. Technical report, Dept of Statistics, University of Toronto"},{"key":"141_CRNH1994","unstructured":"Ng R, Han J (1994) Efficient and effective clustering method for spatial data mining. In: Proceedings of the VLDB conference, pp 144\u2013155"},{"key":"141_CROC2000","doi-asserted-by":"crossref","unstructured":"Ordonez C, Cereghini P (2000) SQLEM: fast clustering in SQL using the EM algorithm. In: Proceedings of the ACM SIGMOD conference, pp 559\u2013570","DOI":"10.1145\/335191.335468"},{"key":"141_CROO2002","doi-asserted-by":"crossref","unstructured":"Ordonez C, Omiecinski E (2002) FREM: fast and robust EM clustering for large data sets. In: Proceedings of the ACM CIKM conference, pp 590\u2013599","DOI":"10.1145\/584792.584889"},{"key":"141_CROOE2001","doi-asserted-by":"crossref","unstructured":"Ordonez C, Omiecinski E, Ezquerra N (2001) A fast algorithm to cluster high dimensional basket data. In: Proceedings of the IEEE ICDM conference, pp 633\u2013636","DOI":"10.1109\/ICDM.2001.989586"},{"key":"141_CRPM1999","doi-asserted-by":"crossref","unstructured":"Pelleg D, Moore A (1999) Accelerating exact K-means algorithms with geometric reasoning. In: Proceedings of the ACM KDD conference, pp 277\u2013281","DOI":"10.1145\/312129.312248"},{"key":"141_CRRG1999","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1162\/089976699300016674","volume":"11","author":"Roweis","year":"1999","unstructured":"Roweis S, Ghahramani Z (1999) A unifying review of linear Gaussian models. Neural Comput 11:305\u2013345","journal-title":"Neural Comput"},{"key":"141_CRSI2000","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1162\/089976600300015853","volume":"12","author":"Sato","year":"2000","unstructured":"Sato M, Ishii S (2000) On-line EM algorithm for the normalized Gaussian network. Neural Comput 12(2):407\u2013432","journal-title":"Neural Comput"},{"key":"141_CRUNGH2000","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1162\/089976600300015088","volume":"12","author":"Ueda","year":"2000","unstructured":"Ueda N, Nakano R, Ghahramani Z, Hinton G (2000) SMEM algorithm for mixture models. Neural Comput 12(9):2109\u20132128","journal-title":"Neural Comput"},{"key":"141_CRXJ1996","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1162\/neco.1996.8.1.129","volume":"8","author":"Xu","year":"1996","unstructured":"Xu L, Jordan M (1996) On convergence properties of the EM algorithm for Gaussian mixtures. Neural Comput 8(1):129\u2013151","journal-title":"Neural Comput"},{"key":"141_CRYSU1994","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1162\/neco.1994.6.2.334","volume":"6","author":"Yuille","year":"1994","unstructured":"Yuille A, Stolorz P, Utans J (1994) Statistical physics, mixtures of distributions and the EM algorithm. Neural Comput 6(1):334\u2013340","journal-title":"Neural Comput"},{"key":"141_CRZRL1996","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: An efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD conference, pp 103\u2013114","DOI":"10.1145\/233269.233324"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-003-0141-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-003-0141-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-003-0141-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T20:00:27Z","timestamp":1734292827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-003-0141-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s10115-003-0141-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}