{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T22:40:05Z","timestamp":1739227205276,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015359"},{"type":"electronic","value":"9783642015366"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01536-6_3","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T13:23:06Z","timestamp":1247232186000},"page":"57-78","source":"Crossref","is-referenced-by-count":1,"title":["Investigating Neighborhood Graphs for Inducing Density Based Clusters"],"prefix":"10.1007","author":[{"given":"Viviani Akemi","family":"Kasahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"do Carmo Nicoletti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"key":"3_CR2","volume-title":"Introduction to data mining","author":"P.N. Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to data mining. Addison-Wesley, Reading (2005)"},{"key":"3_CR3","series-title":"IEEE Press Series on Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1002\/9780470382776","volume-title":"Clustering","author":"R. Xu","year":"2008","unstructured":"Xu, R., Wunsch, D.: Clustering. IEEE Press Series on Computational Intelligence. Wiley\/ IEEE Press, New York (2008)"},{"key":"3_CR4","series-title":"Wiley Series in Probability and Statistics","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L. Kaufman","year":"2005","unstructured":"Kaufman, L., Rousseeuw, P.: Finding groups in data: an introduction to cluster analysis. Wiley Series in Probability and Statistics. Wiley Interscience, New York (2005)"},{"key":"3_CR5","volume-title":"Algorithms for clustering data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for clustering data. Prentice-Hall, Englewood Cliffs (1988)"},{"volume-title":"Clustering and Classification","year":"1998","key":"3_CR6","unstructured":"Arabie, P., Hubert, L.J., Soete, G.D. (eds.): Clustering and Classification. World Scientific, River Edge (1998)"},{"key":"3_CR7","volume-title":"Pattern classification","author":"R.O. Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Store, D.G.: Pattern classification. John Wiley, New York (2001)"},{"key":"3_CR8","volume-title":"Pattern recognition","author":"S. Theodoridis","year":"1998","unstructured":"Theodoridis, S., Koutroumbas, K.: Pattern recognition. Academic Press, San Diego (1998)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal","year":"1965","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Math. Soc.\u00a07, 48\u201350 (1965)","journal-title":"Proc. American Math. Soc."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest Connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers\u00a020(1), 68\u201386 (1971)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR12","unstructured":"Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem, Technical Report CS-96\u201322, Department of Computer Science, Brown University, USA (June 1996)"},{"issue":"4\u20136","key":"3_CR13","first-page":"175","volume":"76","author":"E. Hartuv","year":"1999","unstructured":"Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Information Processing Letters\u00a076(4\u20136), 175\u2013181 (1999)","journal-title":"Information Processing Letters"},{"key":"3_CR14","first-page":"307","volume-title":"Proc. of 8th International Conference on Intelligent Systems for Molecular Biology, (ISMB)","author":"R. Sharan","year":"2000","unstructured":"Sharan, R., Shamir, R.: CLICK: a clustering algorithm with applications to gene expression analysis. In: Proc. of 8th International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 307\u2013316. AAAI Press, Menlo Park (2000)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"14863","DOI":"10.1073\/pnas.95.25.14863","volume":"95","author":"M.B. Eisen","year":"1998","unstructured":"Eisen, M.B., Spellman, P.T., Brown, P.O., Botstein, D.: Cluster analysis and display of genome-wide expression patterns. Proceedings of the National Academy of Sciences\u00a095, 14863\u201314868 (1998)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3-4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A. Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Yakhini, Z.: Clustering gene expression patterns. Journal of Computational Biology\u00a06(3-4), 281\u2013297 (1999)","journal-title":"Journal of Computational Biology"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.patrec.2004.09.039","volume":"26","author":"N. P\u00e4ivinen","year":"2005","unstructured":"P\u00e4ivinen, N.: Clustering with minimum spanning tree of scale-free structure. Pattern Recognition\u00a026, 921\u2013930 (2005)","journal-title":"Pattern Recognition"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Asano, T., Bhattacharia, B., Keil, M., Yao, F.: Clustering algorithms based on minimum and maximum spanning trees. In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, Illinois, pp. 252\u2013257 (1998)","DOI":"10.1145\/73393.73419"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K. Gabriel","year":"1969","unstructured":"Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology\u00a018(3), 259\u2013278 (1969)","journal-title":"Systematic Zoology"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighborhood graph of a finite planar set. Pattern Recognition\u00a012, 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","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\u00a015(3), 173\u2013187 (1982)","journal-title":"Pattern Recognition"},{"issue":"6","key":"3_CR23","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. CACM\u00a016(6), 372\u2013378 (1973)","journal-title":"CACM"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.cad.2006.02.008","volume":"38","author":"J.C. Park","year":"2006","unstructured":"Park, J.C., Shin, H., Choi, B.K.: Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimation. Computer-Aided Design\u00a038, 619\u2013626 (2006)","journal-title":"Computer-Aided Design"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/B978-0-444-87806-9.50013-X","volume-title":"Computational Geometry","author":"D.G. Kirkpatrick","year":"1985","unstructured":"Kirkpatrick, D.G., Radke, J.D.: A framework for computational morphology. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 217\u2013248. North-Holland, Amsterdam (1985)"},{"key":"3_CR26","first-page":"229","volume-title":"Computational Morphology","author":"G.T. Toussaint","year":"1988","unstructured":"Toussaint, G.T.: A graph-theoretical primal sketch. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 229\u2013260. North-Holland, Amsterdam (1988)"},{"issue":"9","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. of the IEEE\u00a080(9), 1502\u20131517 (1992)","journal-title":"Proc. of the IEEE"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/gmip.1998.0465","volume":"60","author":"N. Amenta","year":"1998","unstructured":"Amenta, N., Bern, M., Eppstein, D.: The crust and the \u03b2-Skeleton: combinatorial curve reconstruction. Graph Models Image Process\u00a060(2), 125\u2013135 (1998)","journal-title":"Graph Models Image Process"},{"key":"3_CR29","unstructured":"Zhang, W., King, I.: Locating support vectors via \u03b2-Skeleton technique. In: Proceedings of the International Conference on Neural Information Processing (ICONIP), pp. 1423\u20131427 (2002)"},{"issue":"6","key":"3_CR30","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.cag.2004.08.012","volume":"28","author":"J. Klein","year":"2004","unstructured":"Klein, J., Zachmann, G.: Point cloud surfaces using geometric proximity graphs. Computers & Graphics\u00a028(6), 839\u2013850 (2004)","journal-title":"Computers & Graphics"}],"container-title":["Studies in Computational Intelligence","Foundations of Computational Intelligence Volume 5"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01536-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T22:02:53Z","timestamp":1739224973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01536-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015359","9783642015366"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01536-6_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}