{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:33:22Z","timestamp":1774416802475,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T00:00:00Z","timestamp":1277251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10489-010-0239-y","type":"journal-article","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T03:28:00Z","timestamp":1277177280000},"page":"39-53","source":"Crossref","is-referenced-by-count":11,"title":["PHD: an efficient data clustering scheme using partition space technique for knowledge discovery in large databases"],"prefix":"10.1007","volume":"33","author":[{"given":"Cheng-Fa","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng-Fu","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jui-Fang","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning-Han","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,23]]},"reference":[{"key":"239_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM SIGMOD international conference on management of data, pp\u00a094\u2013105","DOI":"10.1145\/276304.276314"},{"key":"239_CR2","doi-asserted-by":"crossref","unstructured":"Borah B, Bhattacharyya DK (2004) An improved sampling-based DBSCAN for large spatial databases. In: Proceedings of international conference on intelligent sensing and information processing, pp\u00a092\u201396","DOI":"10.1109\/ICISIP.2004.1287631"},{"key":"239_CR3","doi-asserted-by":"crossref","unstructured":"Breitenbach M, Grudic GZ (2005) Clustering through ranking on manifolds. In: Proceedings of the 22nd international conference on machine learning, pp\u00a073\u201380","DOI":"10.1145\/1102351.1102361"},{"issue":"3","key":"239_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10115-008-0134-6","volume":"17","author":"Y Chen","year":"2008","unstructured":"Chen Y, Rege M, Dong M, Hua J (2008) Non-negative matrix factorization for semi-supervised data clustering. Knowl Inf Syst 17(3):355\u2013379","journal-title":"Knowl Inf Syst"},{"key":"239_CR5","doi-asserted-by":"crossref","unstructured":"Cheng H, Hua KA, Vu K (2008) Constrained locally weighted clustering. In: Proceedings of the VLDB endowment, pp\u00a090\u2013101","DOI":"10.14778\/1453856.1453871"},{"key":"239_CR6","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd international conference on knowledge discovery and data mining, pp\u00a0226\u2013231"},{"key":"239_CR7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.patcog.2007.05.018","volume":"41","author":"M Filippone","year":"2008","unstructured":"Filippone M, Camastra F, Masulli F, Rovetta S (2008) A survey of kernel and spectral methods for clustering. Pattern Recogn 41:176\u2013190","journal-title":"Pattern Recogn"},{"key":"239_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"R Fisher","year":"1936","unstructured":"Fisher R (1936) The use of multiple measurements in taxonomic problems. Ann Eugen 7:179\u2013188","journal-title":"Ann Eugen"},{"key":"239_CR9","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) CURE: An efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD international conference on management of data, pp\u00a073\u201384","DOI":"10.1145\/276305.276312"},{"key":"239_CR10","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1999) ROCK: A robust clustering algorithm for categorical attributes. In: Proceedings of the 15th international conference on data engineering, pp\u00a0512\u2013521","DOI":"10.1109\/ICDE.1999.754967"},{"issue":"8","key":"239_CR11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han EH, Kumar V (1999) CHAMELEON: A hierarchical clustering using dynamic modeling. IEEE Comput 32(8):68\u201375","journal-title":"IEEE Comput"},{"key":"239_CR12","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley symposium on mathematical statistics and probability, vol\u00a01, pp\u00a0281\u2013297"},{"key":"239_CR13","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/11785231_73","volume":"4029","author":"C-F Tsai","year":"2006","unstructured":"Tsai C-F, Liu C-W (2006) KIDBSCAN: A new efficient data clustering algorithm for data mining in large databases. Lect Notes Comput Sci (LNCS) 4029:702\u2013711","journal-title":"Lect Notes Comput Sci (LNCS)"},{"key":"239_CR14","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/978-3-540-71701-0_90","volume":"4426","author":"C-F Tsai","year":"2007","unstructured":"Tsai C-F, Yen C-C (2007) ANGEL: A new effective and efficient hybrid clustering technique for large databases. Lect Notes Comput Sci (LNCS) 4426:817\u2013824","journal-title":"Lect Notes Comput Sci (LNCS)"},{"key":"239_CR15","unstructured":"equation:UCI Repository. http:\/\/www.sgi.com\/tech\/mlc\/db\/"},{"key":"239_CR16","unstructured":"Wang T-P, Tsai C-F (2006) GDH: An effective and efficient approach to detect arbitrary patterns in clusters with noises in very large databases. Master thesis, National Pingtung University of Science and Technology, Taiwan"},{"issue":"301","key":"239_CR17","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244","journal-title":"J Am Stat Assoc"},{"key":"239_CR18","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R (1996) BIRCH: An efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD international conference on management of data, pp\u00a0103\u2013114","DOI":"10.1145\/233269.233324"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0239-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-010-0239-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0239-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:44Z","timestamp":1559154344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-010-0239-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,23]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s10489-010-0239-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,23]]}}}