{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T01:40:20Z","timestamp":1740015620267,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121586"},{"type":"electronic","value":"9783642121593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12159-3_24","type":"book-chapter","created":{"date-parts":[[2010,4,16]],"date-time":"2010-04-16T07:32:43Z","timestamp":1271403163000},"page":"259-273","source":"Crossref","is-referenced-by-count":1,"title":["Clustering Very Large Dissimilarity Data Sets"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Hammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Hasenfuss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7-9","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/j.neucom.2008.12.026","volume":"72","author":"N. Alex","year":"2009","unstructured":"Alex, N., Hasenfuss, A., Hammer, B.: Patch clustering for massive data sets. Neurocomputing\u00a072(7-9), 1455\u20131469 (2009)","journal-title":"Neurocomputing"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. STOC, pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1162\/089976603321780281","volume":"15","author":"G. De","year":"2003","unstructured":"De, G., Barreto, A., Araujo, A.F.R., Kremer, S.C.: A Taxonomy for Spatiotemporal Connectionist Networks Revisited: The Unsupervised Case. Neural Computation\u00a015(6), 1255\u20131320 (2003)","journal-title":"Neural Computation"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-47977-5_35","volume-title":"Computer Vision - ECCV 2002","author":"S. Belongie","year":"2002","unstructured":"Belongie, S., Fowlkes, C., Chung, F., Malik, J.: Spectral partitioning with indefinite kernels using the Nystr\u00f6m extension. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 531\u2013542. Springer, Heidelberg (2002)"},{"key":"24_CR5","unstructured":"Bezdek, J.C., Hathaway, R.J., Huband, J.M., Leckie, C., Kotagiri, R.: Approximate data mining in very large relational data. In: Dobbie, G., Bailey, J. (eds.) Proc. Australasian Database Conference, pp. 3\u201313 (2006)"},{"key":"24_CR6","first-page":"9","volume-title":"Proc. KDD","author":"P.S. Bradley","year":"1998","unstructured":"Bradley, P.S., Fayyad, U., Reina, C.: Scaling clustering algorithms to large data sets. In: Proc. KDD, pp. 9\u201315. AAAI Press, Menlo Park (1998)"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vitanyi, M.B.: Clustering by compression. IEEE Transactions on Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/j.neunet.2006.05.018","volume":"19","author":"M. Cottrell","year":"2006","unstructured":"Cottrell, M., Hammer, B., Hasenfuss, A., Villmann, T.: Batch and median neural gas. Neural Networks\u00a019, 762\u2013771 (2006)","journal-title":"Neural Networks"},{"key":"24_CR9","unstructured":"Domingos, P., Hulten, G.: A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering. In: Proc. ICML, pp. 106\u2013113 (2001)"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"F. Farnstrom","year":"2000","unstructured":"Farnstrom, F., Lewis, J., Elkan, C.: Scalability for clustering algorithms revisited. SIGKDD Explorations\u00a02(1), 51\u201357 (2000)","journal-title":"SIGKDD Explorations"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1162\/089976699300016854","volume":"11","author":"T. Graepel","year":"1999","unstructured":"Graepel, T., Obermayer, K.: A stochastic self-organizing map for proximity data. Neural Computation\u00a011, 139\u2013155 (1999)","journal-title":"Neural Computation"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large datasets. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 73\u201384 (1998)","DOI":"10.1145\/276305.276312"},{"key":"24_CR13","unstructured":"Hammer, B., Hasenfuss, A.: Topographic mapping of large dissimilarity data sets, Technical Report IFI-01-2010, Clausthal University of Technology (2010)"},{"issue":"8-9","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/j.neunet.2004.06.009","volume":"17","author":"B. Hammer","year":"2004","unstructured":"Hammer, B., Micheli, A., Sperduti, A., Strickert, M.: Recursive self-organizing network models. Neural Networks\u00a017(8-9), 1061\u20131086 (2004)","journal-title":"Neural Networks"},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0031-3203(94)90119-8","volume":"27","author":"R.J. Hathaway","year":"1994","unstructured":"Hathaway, R.J., Bezdek, J.C.: Nerf c-means: Non-Euclidean relational fuzzy clustering. Pattern Recognition\u00a027(3), 429\u2013437 (1994)","journal-title":"Pattern Recognition"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0031-3203(89)90066-6","volume":"22","author":"R.J. Hathaway","year":"1989","unstructured":"Hathaway, R.J., Davenport, J.W., Bezdek, J.C.: Relational duals of the c-means algorithms. Pattern Recognition\u00a022, 205\u2013212 (1989)","journal-title":"Pattern Recognition"},{"key":"24_CR17","first-page":"1299","volume":"12","author":"T. Heskes","year":"2001","unstructured":"Heskes, T.: Self-organizing maps, vector quantization, and mixture modeling. IEEE TNN\u00a012, 1299\u20131305 (2001)","journal-title":"IEEE TNN"},{"key":"24_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97610-0","volume-title":"Self-Organizing Maps","author":"T. Kohonen","year":"1995","unstructured":"Kohonen, T.: Self-Organizing Maps. Springer, Heidelberg (1995)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/S0893-6080(02)00069-2","volume":"15","author":"T. Kohonen","year":"2002","unstructured":"Kohonen, T., Somervuo, P.: How to make large self-organizing maps for non-vectorial data. Neural Networks\u00a015, 945\u2013952 (2002)","journal-title":"Neural Networks"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1+epsilon)- approximation algorithm for k-means clustering in any dimensions. In: Proc. IEEE FOCS, pp. 454\u2013462 (2004)","DOI":"10.1109\/FOCS.2004.7"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1016\/j.patcog.2006.04.016","volume":"39","author":"J. Laub","year":"2006","unstructured":"Laub, J., Roth, V., Buhmann, J.M., M\u00fcller, K.-R.: On the information and representation of non-Euclidean pairwise data. Pattern Recognition\u00a039, 1815\u20131826 (2006)","journal-title":"Pattern Recognition"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-02124-4_5","volume-title":"Graph-Based Representations in Pattern Recognition","author":"B. Mokbel","year":"2009","unstructured":"Mokbel, B., Hasenfuss, A., Hammer, B.: Graph-based Representation of Symbolic Musical Data. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol.\u00a05534, pp. 42\u201351. Springer, Heidelberg (2009)"},{"key":"24_CR23","unstructured":"Nisbet, R., Elder, J., Miner, G.: Handbook of Statistical Analysis and Data Mining Applications. Academic Press\/Elsevier (2009)"},{"key":"24_CR24","first-page":"1417","volume-title":"Advances in Neural Information Processing Systems","author":"J. Ontrup","year":"2001","unstructured":"Ontrup, J., Ritter, H.: Hyperbolic self-organizing maps for semantic navigation. In: Dietterich, T., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems, vol.\u00a014, pp. 1417\u20131424. MIT Press, Cambridge (2001)"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP hard. Journal of Global Optimization\u00a01, 15\u201322 (1991)","journal-title":"Journal of Global Optimization"},{"key":"24_CR26","doi-asserted-by":"publisher","DOI":"10.1142\/9789812703170","volume-title":"The Dissimilarity Representation for Pattern Recognition \u2013 Foundations and Applications","author":"E. Pekalska","year":"2005","unstructured":"Pekalska, E., Duin, R.P.W.: The Dissimilarity Representation for Pattern Recognition \u2013 Foundations and Applications. World scientific, Singapore (2005)"},{"issue":"3","key":"24_CR27","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M.F. Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program\u00a014(3), 130\u2013137 (1980)","journal-title":"Program"},{"issue":"12","key":"24_CR28","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1109\/TPAMI.2003.1251147","volume":"25","author":"V. Roth","year":"2003","unstructured":"Roth, V., Laub, J., Kawanabe, M., Buhmann, J.M.: Optimal cluster preserving embedding of nonmetric proximity data. IEEE TPAMI\u00a025(12), 1540\u20131551 (2003)","journal-title":"IEEE TPAMI"},{"issue":"4","key":"24_CR29","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM Journal on Computing\u00a03(4), 262\u2013279 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR30","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.neunet.2004.06.012","volume":"17","author":"S. Seo","year":"2004","unstructured":"Seo, S., Obermayer, K.: Self-organizing maps and clustering methods for matrix data. Neural Networks\u00a017, 1211\u20131230 (2004)","journal-title":"Neural Networks"},{"key":"24_CR31","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/1014052.1014143","volume-title":"Proc. KDD 2004","author":"P. Tino","year":"2004","unstructured":"Tino, P., Kaban, A., Sun, Y.: A generative probabilistic approach to visualizing sets of symbolic sequences. In: Kohavi, R., Gehrke, J., DuMouchel, W., Ghosh, J. (eds.) Proc. KDD 2004, pp. 701\u2013706. ACM Press, New York (2004)"},{"key":"24_CR32","unstructured":"Wang, W., Yang, J., Muntz, R.R.: STING: a statistical information grid approach to spatial data mining. In: Proc. VLDB, pp. 186\u2013195 (1997)"},{"issue":"5","key":"24_CR33","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MCG.2004.39","volume":"24","author":"P.C. Wong","year":"2004","unstructured":"Wong, P.C., Thomas, J.: Visual Analytics. IEEE Computer Graphics and Applications\u00a024(5), 20\u201321 (2004)","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"6","key":"24_CR34","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.neunet.2006.05.007","volume":"19","author":"H. Yin","year":"2006","unstructured":"Yin, H.: On the equivalence between kernel self-organising maps and self-organising mixture density network. Neural Networks\u00a019(6), 780\u2013784 (2006)","journal-title":"Neural Networks"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pp. 103\u2013114 (1996)","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12159-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T01:18:57Z","timestamp":1740014337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12159-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121586","9783642121593"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12159-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}