{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T04:36:12Z","timestamp":1714624572861},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T00:00:00Z","timestamp":1169769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2007,3,13]]},"DOI":"10.1007\/s10618-006-0047-5","type":"journal-article","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T15:22:03Z","timestamp":1169738523000},"page":"207-224","source":"Crossref","is-referenced-by-count":29,"title":["Two topographic maps for data visualisation"],"prefix":"10.1007","volume":"14","author":[{"given":"Colin","family":"Fyfe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,1,26]]},"reference":[{"issue":"1","key":"47_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1162\/089976698300017953","volume":"10","author":"CM Bishop","year":"1997","unstructured":"Bishop CM, Svensen M, Williams CKI (1997) Gtm: the generative topographic mapping. Neural Comput 10(1): 215\u2013234","journal-title":"Neural Comput"},{"key":"47_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:DAMI.0000023673.23078.a3","volume":"8","author":"E Corchado","year":"2004","unstructured":"Corchado E, MacDonald D, Fyfe C (2004) Maximum and minimum likelihood hebbian learning for exploratory projection pursuit. Data Mining Knowl Disc 8:203\u2013225","journal-title":"Data Mining Knowl Disc"},{"issue":"2","key":"47_CR3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0893-6080(96)00058-5","volume":"10","author":"C Fyfe","year":"1997","unstructured":"Fyfe C (1997) A comparative study of two neural methods of exploratory projection pursuit. Neural Networks 10(2):257\u2013262","journal-title":"Neural Networks"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Fyfe C (2005) The topographic product of experts. In: Proceedings of the International Conference on Artificial Neural Networks, ICANN2005 Warsaw, Poland","DOI":"10.1007\/11550822_62"},{"key":"47_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The elements of statistical learning","author":"T Hastie","year":"2001","unstructured":"Hastie T, Tibshirani R, Friedman J (2001) The elements of statistical learning. Springer, Berlin"},{"key":"47_CR6","unstructured":"Hinton G, Teh Y-W (2001) Discovering multiple constraints that are frequently approximately satisfied. In Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence, Fort Lauder dale, USA, pp 227\u2013234"},{"key":"47_CR7","unstructured":"Hinton GE (2000) Training products of experts by minimizing contrastive divergence. Technical Report GCNU TR 2000-004, Gatsby Computational Neuroscience Unit, University College, London, http:\/\/www.gatsby.ucl.ac.uk\/"},{"key":"47_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1162\/neco.1991.3.1.79","volume":"3","author":"R Jacobs","year":"1991","unstructured":"Jacobs R, Jordan M, Nowlan S, Hinton G (1991) Adaptive mixtures of local experts. Neural Comput 3:79\u201387","journal-title":"Neural Comput"},{"key":"47_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"M Jordan","year":"1994","unstructured":"Jordan M, Jacobs R (1994) Hierarchical mixtures of experts and the em algorithm. Neural Comput 6:181\u2013214","journal-title":"Neural Comput"},{"key":"47_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97610-0","volume-title":"Self-organising maps","author":"T Kohonen","year":"1995","unstructured":"Kohonen T (1995) Self-organising maps. Springer, Berlin"},{"key":"47_CR11","unstructured":"Williams C, Agakov FV (2001) Products of gaussians and probabilistic minor components analysis. Technical Report EDI-INF-RR-0043, University of Edinburgh"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Zhang B (2000) Generalized k-harmonic means\u2014boosting in unsupervised learning. Technical report, HP Laboratories, Palo Alto","DOI":"10.1137\/1.9781611972719.6"},{"key":"47_CR13","unstructured":"Zhang B, Hsu M, Dayal U (1999) K-harmonic means\u2014a data clustering algorithm. Technical report, HP Laboratories, Palo Alto"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0047-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-006-0047-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0047-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:29:39Z","timestamp":1559230179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-006-0047-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,26]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,13]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s10618-006-0047-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,26]]}}}