{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T13:59:51Z","timestamp":1774533591188,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135286","type":"print"},{"value":"9783642135293","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13529-3_8","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T19:01:53Z","timestamp":1277319713000},"page":"60-69","source":"Crossref","is-referenced-by-count":43,"title":["TI-DBSCAN: Clustering with DBSCAN by Means of the\u00a0Triangle Inequality"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Lasek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD, Atlantic City, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"8_CR2","unstructured":"Elkan, C.: Using the Triangle Inequality to Accelerate k-Means. In: Proc. of ICML 2003, Washington, pp. 147\u2013153 (2003)"},{"key":"8_CR3","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Database with Noise. In: Proc. of KDD 1996, Portland, pp. 226\u2013231 (1996)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure For Spatial Searching. In: Proc. of ACM SIGMOD, Boston, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality, ICS Research Report, Warsaw University of Technology (April 2010)","DOI":"10.1007\/978-3-642-13529-3_8"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Skonieczny, \u0141.: Faster Clustering with DBSCAN. In: Proc. of IIPWM 2005, Gda\u0144sk, pp. 605\u2013614 (2005)","DOI":"10.1007\/3-540-32392-9_73"},{"key":"8_CR7","unstructured":"Moore, A.W.: The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In: Proc. of UAI, Stanford, pp. 397\u2013405 (2000)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Stonebraker, M., Frew, J., Gardels, K., Meredith, J.: The SEQUOIA 2000 Storage Benchmark. In: Proc. of ACM SIGMOD, Washington, pp. 2\u201311 (1993)","DOI":"10.1145\/170035.170038"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T. Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: A New Data Clustering Algorithm and its Applications. Data Mining and Knowledge Discovery\u00a01(2), 141\u2013182 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"8_CR10","unstructured":"http:\/\/kdd.ics.uci.edu\/databases\/kddcup98\/kddcup98.html"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Current Trends in Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13529-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:35Z","timestamp":1606185575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13529-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135286","9783642135293"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13529-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}