{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T09:00:32Z","timestamp":1778835632405,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642121449","type":"print"},{"value":"9783642121456","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12145-6_10","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T08:42:24Z","timestamp":1280133744000},"page":"93-102","source":"Crossref","is-referenced-by-count":7,"title":["A Novel Method to Find Appropriate \u03b5 for DBSCAN"],"prefix":"10.1007","author":[{"given":"Jamshid","family":"Esmaelnejad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jafar","family":"Habibi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soheil Hassas","family":"Yeganeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"226","volume-title":"Second International Conference on Knowledge Discovery and Data Mining","author":"M. Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis, E., Han, J., Fayyad, U. (eds.) Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, pp. 226\u2013231. AAAI Press, Menlo Park (1996)"},{"key":"10_CR2","unstructured":"MacQueen, J.B.: Some methods for classification and analysis ofmultivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematics, Statistics and Probabilities, vol.\u00a01, pp. 281\u2013297 (1967)"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"J.C. Dunn","year":"1973","unstructured":"Dunn, J.C.: A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. Journal of Cybernetics and Systems\u00a03(3), 32\u201357 (1973)","journal-title":"Journal of Cybernetics and Systems"},{"key":"10_CR4","series-title":"The Morgan Kaufmann Series in DataManagement Systems","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. The Morgan Kaufmann Series in DataManagement Systems. Morgan Kaufmann, San Francisco (2006)","edition":"2"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304182.304187","volume-title":"Proceedings of 1999 ACM International Conference on Management of Data (SIGMOD 1999)","author":"M. Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. In: Proceedings of 1999 ACM International Conference on Management of Data (SIGMOD 1999), vol.\u00a028, pp. 49\u201360. ACM, New York (1999)"},{"key":"10_CR6","unstructured":"Hinneburg, A., Keim, D.A.: An efficient approach to clustering in large multimedia databases with noise. In: Knowledge Discovery and Data Mining, pp. 58\u201365 (1998)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Wang, X., Hamilton, H.J.: Dbrs: A density-based spatial clustering method with random sampling. In: Proceedings of the 7th PAKDD, Seoul, Korea, pp. 563\u2013575 (2003)","DOI":"10.1007\/3-540-36175-8_56"},{"key":"10_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-540-30116-5_41","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"X. Wang","year":"2004","unstructured":"Wang, X., Rostoker, C., Hamilton, H.J.: Density-Based Spatial Clustering in the Presence of Obstacles and Facilitators. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 446\u2013458. Springer, Heidelberg (2004)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/CIDM.2009.4938678","volume-title":"Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009","author":"S.H. Yeganeh","year":"2009","unstructured":"Yeganeh, S.H., Habibi, J., Abolhassani, H., Tehrani, M.A., Esmaelnezhad, J.: An approximation algorithm for finding skeletal points for density based clustering approaches. In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, March 2009, pp. 403\u2013410. IEEE, Los Alamitos (2009)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/ICCEE.2008.92","volume-title":"International Conference on Computer and Electrical Engineering","author":"S.H. Yeganeh","year":"2008","unstructured":"Yeganeh, S.H., Habibi, J., Abolhassani, H., Shirali-Shahreza, S.: A novel clustering algorithm based on circlusters to find arbitrary shaped clusters. In: International Conference on Computer and Electrical Engineering, pp. 619\u2013624. IEEE Computer Society, Los Alamitos (2008)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Shirali-Shahreza, S., Hassas-Yeganeh, S., Abolhassani, H., Habibi, J.: Circluster: Storing cluster shapes for clustering. To appear in the Proceedings of the 4th IEEE International Conference on Intelligent Systems, Varna, Bulgaria (September 2008)","DOI":"10.1109\/IS.2008.4670502"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11890393_10","volume-title":"Advances in Information Systems","author":"M. Gorawski","year":"2006","unstructured":"Gorawski, M., Malczok, R.: AEC Algorithm: A Heuristic Approach to Calculating Density-Based Clustering Eps Parameter. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol.\u00a04243, pp. 90\u201399. Springer, Heidelberg (2006)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11827252_24","volume-title":"Advances in Databases and Information Systems","author":"M. Gorawski","year":"2006","unstructured":"Gorawski, M., Malczok, R.: Towards Automatic Eps Calculation in Density-Based Clustering. In: Manolopoulos, Y., Pokorn\u00fd, J., Sellis, T.K. (eds.) ADBIS 2006. LNCS, vol.\u00a04152, pp. 313\u2013328. Springer, Heidelberg (2006)"},{"key":"10_CR14","unstructured":"Karypis, G.: Chameleon data set (2008), http:\/\/glaros.dtc.umn.edu\/gkhome\/cluto\/cluto\/download"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12145-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T13:22:19Z","timestamp":1635772939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12145-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121449","9783642121456"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12145-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}