{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T15:05:58Z","timestamp":1791039958196,"version":"4.1.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T00:00:00Z","timestamp":1243987200000},"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":[[2009,11]]},"DOI":"10.1007\/s10115-009-0216-0","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T13:01:12Z","timestamp":1243947672000},"page":"201-229","source":"Crossref","is-referenced-by-count":21,"title":["SPARCL: an effective and efficient algorithm for mining arbitrary shape-based clusters"],"prefix":"10.1007","volume":"21","author":[{"given":"Vineet","family":"Chaoji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Al Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeed","family":"Salem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,6,3]]},"reference":[{"key":"216_CR1","doi-asserted-by":"crossref","unstructured":"Astrahan MM (1970) Speech analysis by clustering, or the hyperphoneme method. Stanford A.I. Project Memo, Stanford University","DOI":"10.21236\/AD0709067"},{"key":"216_CR2","unstructured":"Aupetit M (2003) Robust topology representing networks. In: Proceedings of the European symposium on artificial neural networks, Bruges, Belgium, pp 45\u201350"},{"key":"216_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, New Orleans, Louisiana, 2007, pp 1027\u20131035"},{"key":"216_CR4","unstructured":"Ball GH, Hall DJ (1967) PROMENADE\u2014an online pattern recognition system. Stanford Research Institute, Stanford University"},{"key":"216_CR5","unstructured":"Bradley PS, Fayyad UM (1998) Refining initial points for k-means clustering. In: Proceedings of the fifteenth international conference on machine learning Madison, Wisconsin, pp 91\u201399"},{"key":"216_CR6","doi-asserted-by":"crossref","unstructured":"Breunig MM, Kriegel H, Ng RT, Sander J (2000) LOF: identifying density-based local outliers. In: Proceedings of 2000 ACM-SIGMOD international conference on management of data, Dallas, Texas, 2000, pp 93\u2013104","DOI":"10.1145\/342009.335388"},{"key":"216_CR7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-1-4612-2628-4_27","volume-title":"Algebraic geometry and its applications","author":"B Chazelle","year":"1994","unstructured":"Chazelle B, Palios L (1994) Decomposition algorithms in geometry. In: Bajaj C (eds) Algebraic geometry and its applications. Springer, Berlin, pp 419\u2013447"},{"key":"216_CR8","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2005","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2005) Introduction to algorithms, 2nd edn. MIT Press, Cambridge","edition":"2"},{"key":"216_CR9","unstructured":"Dasgupta S, Schulman LJ (2000) A two-round variant of EM for Gaussian mixtures. In: Proceedings of the 16th conference on uncertainty in artificial intelligence, Stanford, CA, June 2000, pp 152\u2013159"},{"key":"216_CR10","unstructured":"Dhillon IS, Guan Y, Julis B (2004) Kernel k-means, spectral clustering and normalized cuts. In: Proceedings of the tenth international conference on knowledge discovery and data mining, Seattle, WA, August 2004, pp 551\u2013556"},{"issue":"6","key":"216_CR11","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1007\/s10115-003-0131-8","volume":"6","author":"C Domeniconi","year":"2004","unstructured":"Domeniconi C, Gunopulos D (2004) An efficient density-based approach for data mining tasks. Knowl Inform Syst 6(6): 750\u2013770","journal-title":"Knowl Inform Syst"},{"key":"216_CR12","volume-title":"Pattern classification","author":"RO Duda","year":"2000","unstructured":"Duda RO, Hart PE, Stork DG (2000) Pattern classification, 2nd edn. Wiley-Interscience, New York","edition":"2"},{"key":"216_CR13","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining, 1996, pp 226\u2013231"},{"issue":"2","key":"216_CR14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0165-1684(95)00023-7","volume":"44","author":"JA Garc\u00eda","year":"1995","unstructured":"Garc\u00eda JA, Fdez-Valdivia J, Cortijo FJ, Molina R (1995) A dynamic approach for clustering data. Signal Process 44(2): 181\u2013196","journal-title":"Signal Process"},{"key":"216_CR15","doi-asserted-by":"crossref","unstructured":"Gao BJ, Ester M, Cai J-Y, Schulte O, Xiong H (2007) The minimum consistent subset cover problem and its applications in data mining. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining San Jose, California, USA, 2007, pp 310\u2013319","DOI":"10.1145\/1281192.1281228"},{"key":"216_CR16","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. In: ACM SIGMOD international conference on management of data, Seattle, WA, pp 73\u201384","DOI":"10.1145\/276304.276312"},{"key":"216_CR17","unstructured":"Hasan MA, Chaoji V, Salem S, Zaki MJ (2008) Robust partitional clustering by outlier and density insensitive seeding. Technical Report 08-04, RPI Computer Science"},{"key":"216_CR18","unstructured":"Hinneburg A, Gabriel H-H (2007) DENCLUE 2.0: fast clustering based on kernel density estimation. In: International symposium on intelligent data analysis, pp 70\u201380"},{"issue":"4","key":"216_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10115-003-0086-9","volume":"5","author":"A Hinneburg","year":"2003","unstructured":"Hinneburg A, Keim DA (2003) A general approach to clustering in large databases with noise. Knowl Inform Syst 5(4): 387\u2013415","journal-title":"Knowl Inform Syst"},{"key":"216_CR20","unstructured":"Hinneburg A, Keim DA (1998) An efficient approach to clustering in multimedia databases with noise. In: Proceedings of 4th international conference on knowledge discovery and data mining. AAAI Press, New York"},{"key":"216_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9780470124642","volume-title":"Knowledge discovery in bioinformatics: techniques, methods, and applications (Wiley Series in Bioinformatics)","author":"X Hu","year":"2007","unstructured":"Hu X, Pan Y (2007) Knowledge discovery in bioinformatics: techniques, methods, and applications (Wiley Series in Bioinformatics). Wiley, New York"},{"key":"216_CR22","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall, Upper Saddle River"},{"issue":"4","key":"216_CR23","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1145\/950191.950192","volume":"6","author":"J Klaus","year":"2003","unstructured":"Klaus J (2003) Clustering intrusion detection alarms to support root cause analysis. ACM Trans Inform Syst Secur 6(4): 443\u2013471","journal-title":"ACM Trans Inform Syst Secur"},{"issue":"8","key":"216_CR24","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 (1999) Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8): 68\u201375","journal-title":"Computer"},{"issue":"10","key":"216_CR25","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/97.329844","volume":"1","author":"I Katsavounidis","year":"1994","unstructured":"Katsavounidis I, Kuo CCJ, Zhen Z (1994) A new initialization technique for generalized Lloyd iteration. IEEE Signal Process Lett 1(10): 144\u2013146","journal-title":"IEEE Signal Process Lett"},{"key":"216_CR26","doi-asserted-by":"crossref","unstructured":"Kaufman, L Rousseeuw, PJ (1990) Finding groups in data: An introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics, New York","DOI":"10.1002\/9780470316801"},{"issue":"1","key":"216_CR27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga H, Ishibashi T, Watanabe T (2007) Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing. Knowl Inform Syst 12(1): 25\u201353","journal-title":"Knowl Inform Syst"},{"key":"216_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-39351-3","volume-title":"Nonlinear dimensionality reduction","author":"J Lee","year":"2007","unstructured":"Lee J, Verleysen M (2007) Nonlinear dimensionality reduction. Springer, Berlin"},{"issue":"3","key":"216_CR29","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0893-6080(94)90109-0","volume":"7","author":"T Martinetz","year":"1994","unstructured":"Martinetz T, Schulten K (1994) Topology representing networks. Neural Netw 7(3): 507\u2013522","journal-title":"Neural Netw"},{"key":"216_CR30","unstructured":"Meila M, Shi J (2001) A random walks view of spectral segmentation. AI and Statistics (AISTATS)"},{"key":"216_CR31","doi-asserted-by":"crossref","DOI":"10.4324\/9780203468029","volume-title":"Geographic data mining and knowledge discovery","author":"HJ Miller","year":"2001","unstructured":"Miller HJ, Han J (2001) Geographic data mining and knowledge discovery. Taylor & Francis, Bristol"},{"key":"216_CR32","unstructured":"Ng AY, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Advances in neural information processing systems, vol 14"},{"key":"216_CR33","volume-title":"Spatial tessellations: concepts and applications of voronoi diagrams","author":"A Okabe","year":"1992","unstructured":"Okabe A, Boots B, Sugihara K (1992) Spatial tessellations: concepts and applications of voronoi diagrams. Wiley, New York"},{"issue":"2","key":"216_CR34","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1177\/002224378302000204","volume":"20","author":"G Punj","year":"1983","unstructured":"Punj G, Stewart DW (1983) Cluster analysis in marketing research: review and suggestions for application. J Mark Res 20(2): 134\u2013148","journal-title":"J Mark Res"},{"key":"216_CR35","volume-title":"Handbook of computational geometry","author":"JR Sack","year":"2000","unstructured":"Sack JR, Urrutia J (2000) Handbook of computational geometry. North-Holland, Amsterdam"},{"key":"216_CR36","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel methods for pattern analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor J, Cristianini N (2004) Kernel methods for pattern analysis. Cambridge University Press, Cambridge"},{"key":"216_CR37","unstructured":"Sheikholeslami G, Chatterjee S, Zhang A (1998) WaveCluster: a multi-resolution clustering approach for very large spatial databases. In: Proceedings of 24th international conference on very large data bases, pp 428\u2013439"},{"issue":"8","key":"216_CR38","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8): 888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5500","key":"216_CR39","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, de Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500): 2319\u20132323","journal-title":"Science"},{"key":"216_CR40","unstructured":"Vennam JR, Vadapalli S (2005) SynDECA: a tool to generate synthetic datasets for evaluation of clustering algorithms. In: 11th international conference on management of data"},{"issue":"1","key":"216_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu X, Kumar V, Ross Q, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng A, Liu B, Yu PS, Zhou Z-H, Steinbach M, Hand DJ, Steinberg D (2008) Top 10 algorithms in data mining. Knowl Inform Syst 14(1): 1\u201337","journal-title":"Knowl Inform Syst"},{"key":"216_CR42","unstructured":"Zelnik-Manor L, Perona P (2004) Self-tuning spectral clustering. In: Proceedings of 18th annual conference on neural information processing systems"},{"key":"216_CR43","doi-asserted-by":"crossref","unstructured":"Zeng H-J, He Q-C, Chen Z, Ma W-Y, Ma J (2004) Learning to cluster web search results. In: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, New York, NY, pp 210\u2013217","DOI":"10.1145\/1008992.1009030"},{"issue":"2","key":"216_CR44","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang T, Ramakrishnan R, Livny M (1997) BIRCH: a new data clustering algorithm and its applications. Data Min Knowl Discov 1(2): 141\u2013182","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"216_CR45","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10618-005-0361-3","volume":"10","author":"Y Zhao","year":"2005","unstructured":"Zhao Y, Karypis G (2005) Hierarchical clustering algorithms for document datasets. Data Min Knowl Discov 10(2): 141\u2013168","journal-title":"Data Min Knowl Discov"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0216-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0216-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0216-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:19Z","timestamp":1559124619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0216-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,3]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["216"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0216-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,3]]}}}