{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:24Z","timestamp":1725456744213},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029634","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"392-398","source":"Crossref","is-referenced-by-count":1,"title":["The use of graphs of elliptical influence in visual hierarchical clustering"],"prefix":"10.1007","author":[{"given":"Mirko","family":"K\u0159iv\u00e1nek","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF00164401","volume":"20","author":"P. Ash","year":"1986","unstructured":"ASH P.,BOLKER E.:Generalized Dirichlet tesselations. Geometriae dedicata 20(1986), 209\u2013243.","journal-title":"Geometriae dedicata"},{"key":"43_CR2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J. Bentley","year":"1980","unstructured":"BENTLEY J.,WEIDE B., YAO A.:Optimal expected-time algorithms for closest point problems, ACM Trans.on Math.Software 6(1980),563\u2013580.","journal-title":"ACM Trans.on Math.Software"},{"key":"43_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"W. Day","year":"1984","unstructured":"DAY W.,EDELSBRUNNER H.:Efficient algorithms for agglomerative hierarchical clustering methods. J.of Classification 1(1984), 7\u201324.","journal-title":"J.of Classification"},{"key":"43_CR4","unstructured":"DIDAY E.,et all: Optimisation en classification automatique. INRIA, 1979."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"EDELSBRUNNER H.:Algorithms in combinatorial geometry. Springer, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"43_CR6","unstructured":"HARTIGAN J.:Clustering algorithms. Wiley, 1975."},{"key":"43_CR7","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H. Hotteling","year":"1933","unstructured":"HOTTELING H.:Analysis of a complex statistical variables into principal components, J.Educ.Psych. 24(1933), 417\u2013441.","journal-title":"J.Educ.Psych."},{"key":"43_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-2496(77)90029-3","volume":"15","author":"L. Hubert","year":"1977","unstructured":"HUBERT L.:Data analysis implications of some concepts related to cuts of graphs, J.Math.Psych. 15(1977), 199\u2013208.","journal-title":"J.Math.Psych."},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M. K\u0159iv\u00e1nek","year":"1986","unstructured":"K\u0158IV\u00c1NEK M., MOR\u00c1VEK J.: N-P-hard problems in hierarchical-tree clustering, Acta informatica 23(1986), 311\u2013323.","journal-title":"Acta informatica"},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D. Matula","year":"1980","unstructured":"MATULA D., SOKAL R.:Properties of Gabriel graphs relevant to geographic variation research and the clustering of point in the plane, Geographical analysis 12(1980), 205\u2013222.","journal-title":"Geographical analysis"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"MEHLHORN K.: Data structures and algorithms 3: multidimensional searching and computational geometry. Springer, 1984.","DOI":"10.1007\/978-3-642-69900-9"},{"key":"43_CR12","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/comjnl\/26.4.354","volume":"26","author":"F. Murtagh","year":"1983","unstructured":"MURTAGH F.:A survey of recent advances in hierarchical clustering algorithms, Computer J. 26(1983), 354\u2013360.","journal-title":"Computer J."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"PREPARATA F., SHAMOS M.: Computational geometry: an introduction. Springer, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"43_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G. Toussaint","year":"1980","unstructured":"TOUSSAINT G.:The relative neighborhood graph of a finite planer set, Pattern recognition 12(1980), 261\u2013268.","journal-title":"Pattern recognition"},{"key":"43_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0031-3203(82)90069-3","volume":"15","author":"R. Urquhart","year":"1982","unstructured":"URQUHART R.:Graph theoretical clustering based on limited neighborhood sets, Pattern recognition 15(1982), 173\u2013187.","journal-title":"Pattern recognition"},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C. Zahn","year":"1971","unstructured":"ZAHN C.:Graph-theoretical methods for detecting and describing gestalt clusters, IEEE Trans.on Computers 20(1971), 68\u201386.","journal-title":"IEEE Trans.on Computers"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029634.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:49Z","timestamp":1607551189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0029634","relation":{},"subject":[]}}