{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T03:10:02Z","timestamp":1752462602373,"version":"3.41.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Mining and Knowledge Discovery"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1011405212443","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T05:16:33Z","timestamp":1040620593000},"page":"337-363","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Generative Models for Fast Feature Discovery"],"prefix":"10.1007","volume":"5","author":[{"given":"Machiel","family":"Westerdijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Wiegerinck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"354390_CR1","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1162\/089976699300016458","volume":"11","author":"H. Attias","year":"1999","unstructured":"Attias, H. 1999. Independent factor analysis. Neural Computation, 11(4):803\u2013851.","journal-title":"Neural Computation"},{"issue":"3","key":"354390_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1162\/neco.1989.1.3.295","volume":"1","author":"H.B. Barlow","year":"1989","unstructured":"Barlow, H.B. 1989. Unsupervised learning. Neural Computation, 1(3):295\u2013311.","journal-title":"Neural Computation"},{"issue":"2","key":"354390_CR3","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/18.212286","volume":"36","author":"C.F. Barnes","year":"1993","unstructured":"Barnes, C.F. and Frost, R.L. 1993. Vector Quantizers with Direct Sum Codebooks. IEEE Transactions on Information Theory, 36(2):565\u2013580.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"354390_CR4","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1162\/neco.1995.7.6.1129","volume":"7","author":"A.J. Bell","year":"1995","unstructured":"Bell, A.J. and Sejnowski, T.J. 1995. An information-maximization approach to blind separation and blind deconvolution. Neural Computation, 7(6):1129\u20131159.","journal-title":"Neural Computation"},{"key":"354390_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., and Rubin, D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statistical Society Series B, 39:1\u201338.","journal-title":"J. Royal Statistical Society Series B"},{"key":"354390_CR6","volume-title":"Advances in Neural Information Processing Systems","author":"Z. Ghahramani","year":"1995","unstructured":"Ghahramani, Z. 1995. Factorial learning and the EM algorithm In Advances in Neural Information Processing Systems, vol. 7. Cambridge, MA: The MIT Press."},{"key":"354390_CR7","volume-title":"Advances in Neural Information Processing Systems","author":"Z. Ghahramani","year":"1998","unstructured":"Ghahramani, Z. and Hinton, G.E. 1998. Hierarchical non-linear factor analysis and topographic maps. In Advances in Neural Information Processing Systems, volume 10. Cambridge, MA: The MIT Press."},{"key":"354390_CR8","doi-asserted-by":"crossref","unstructured":"Gray, R.M. 1984. Vector quantisation. IEEE ASSP Magazine, pp. 4\u201329.","DOI":"10.1109\/MASSP.1984.1162229"},{"issue":"5","key":"354390_CR9","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/34.291440","volume":"16","author":"J.J. Hull","year":"1997","unstructured":"Hull, J.J. 1997. A database for handwritten text recognition research. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(5):550\u2013554.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"354390_CR10","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1109\/18.508837","volume":"42","author":"P. Knagenhjelm","year":"1996","unstructured":"Knagenhjelm, P. and Agrell, E. 1996. The Hadamard transform\u2014a tool for index assignment. IEEE Transaction on Information Theory, 42(4):1139\u20131151.","journal-title":"IEEE Transaction on Information Theory"},{"key":"354390_CR11","unstructured":"McEliece, R., Rodemich, E., and Cheng, J. 1995. The Turbo Decision Algorithm. In Proc. 33rd Allerton Conference on Communications, Control and Computing, pp. 366\u2013379."},{"issue":"6","key":"354390_CR12","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1109\/18.476331","volume":"41","author":"S.W. McLaughlin","year":"1995","unstructured":"McLaughlin, S.W., Neuhoff, D.L., and Ashley, J.J. 1995. Optimal binary index assignments for a class of equiprobable scalar and vector quantizers. IEEE Transactions on Information Theory, 41(6):2031\u20132037.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"354390_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/18.650990","volume":"44","author":"A. Mehes","year":"1998","unstructured":"Mehes, A. and Zeger, K. 1998. Binary lattice vector quantisation with linear block codes and affine index assignments. IEEE Transactions on Information Theory, 44(1):79\u201394.","journal-title":"IEEE Transactions on Information Theory"},{"key":"354390_CR14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(92)90065-6","volume":"56","author":"R.M. Neal","year":"1991","unstructured":"Neal, R.M. 1991. Connectionist learning of belief networks. Artificial Intelligence, 56:71\u2013113.","journal-title":"Artificial Intelligence"},{"key":"354390_CR15","first-page":"355","volume-title":"Learning in Graphical Models, chapter A view of the EM algorithm that justifies incremental, sparse, and other variants","author":"R.M. Neal","year":"1998","unstructured":"Neal, R.M. and Hinton, G.E. 1998. Learning in Graphical Models, chapter A view of the EM algorithm that justifies incremental, sparse, and other variants, Dordrecht, The Netherlands: Kluwer Academic Publishers, pp. 355\u2013368."},{"key":"354390_CR16","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1038\/381607a0","volume":"381","author":"B.A. Olshausen","year":"1996","unstructured":"Olshausen, B.A. and Field, D.J. 1996. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381:607\u2013609.","journal-title":"Nature"},{"key":"354390_CR17","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann Publishers."},{"key":"354390_CR18","volume-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"W.H. Press","year":"1992","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P. 1992. Numerical Recipes in C: The Art of Scientific Computing. 2nd ed. Cambridge, MA: Cambridge University Press.","edition":"2nd ed."},{"key":"354390_CR19","series-title":"NATO ASI Series","first-page":"269","volume-title":"Neural Networks and Machine Learning","author":"B. Sallans","year":"1998","unstructured":"Sallans, B., Hinton, G.E., and Ghahramani, Z. 1998. A hierarchical community of experts. In Neural Networks and Machine Learning, NATO ASI Series F, C.M. Bishop (Ed.). pp. 269\u2013284, Berlin: Springer-Verlag."},{"key":"354390_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.251","volume":"4","author":"L.K. Saul","year":"1996","unstructured":"Saul, L.K., Jaakkola, T., and Jordan, M.I. 1996. Mean field theory for sigmoid belief networks. Journal of Artificial Intelligence Research, 4:61\u201376.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"354390_CR21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1162\/neco.1995.7.1.51","volume":"7","author":"E. Saund","year":"1995","unstructured":"Saund, E. 1995. A multiple cause mixture model for unsupervised learning. Neural Computation, 7(1):51\u201371.","journal-title":"Neural Computation"},{"key":"354390_CR22","unstructured":"Weiss, Y. 1997. Belief propagation and revision in networks with loops. Technical Report, MIT-AILab, AIM-1616."},{"key":"354390_CR23","unstructured":"Zemel, R.S. 1994. A minimum description length framework for unsupervised learning. Technical Report, University of Toronto, CRG-TR-93-2."}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011405212443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011405212443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011405212443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:45:36Z","timestamp":1752461136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011405212443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["354390"],"URL":"https:\/\/doi.org\/10.1023\/a:1011405212443","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}