{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T23:46:05Z","timestamp":1720395965375},"reference-count":33,"publisher":"Elsevier BV","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1016\/j.neucom.2012.02.055","type":"journal-article","created":{"date-parts":[[2013,7,31]],"date-time":"2013-07-31T17:04:17Z","timestamp":1375290257000},"page":"83-97","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Two Expectation-Maximization algorithms for Boolean Factor Analysis"],"prefix":"10.1016","volume":"130","author":[{"given":"Alexander A.","family":"Frolov","sequence":"first","affiliation":[]},{"given":"Dusan","family":"Husek","sequence":"additional","affiliation":[]},{"given":"Pavel Y.","family":"Polyakov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2012.02.055_bib1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1162\/neco.1995.7.1.51","article-title":"A multiple cause mixture model for unsupervised learning","volume":"7","author":"Saund","year":"1995","journal-title":"Neural Computation"},{"key":"10.1016\/j.neucom.2012.02.055_bib2","first-page":"1227","article-title":"Maximal causes for non-linear component extraction","volume":"9","author":"L\u00fccke","year":"2008","journal-title":"The Journal of Machine Learning Research"},{"key":"10.1016\/j.neucom.2012.02.055_bib3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0033291700003585","article-title":"The syndrome concept","volume":"14","author":"Weber","year":"1984","journal-title":"Psychological Medicine"},{"key":"10.1016\/j.neucom.2012.02.055_bib4","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1017\/S0033291700031470","article-title":"Psychopathology and boolean factor analysis","volume":"15","author":"Veiel","year":"1985","journal-title":"Psychological Medicine"},{"key":"10.1016\/j.neucom.2012.02.055_bib5","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TNN.2009.2016090","article-title":"Recurrent neural network based Boolean factor analysis and its application to automatic terms and documents categorization","volume":"20","author":"Frolov","year":"2009","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/j.neucom.2012.02.055_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"10.1016\/j.neucom.2012.02.055_bib7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","article-title":"A view of the EM algorithm that justifies incremental, sparse, and other variants","volume":"89","author":"Neal","year":"1998","journal-title":"Learning in Graphical Models"},{"key":"10.1016\/j.neucom.2012.02.055_bib8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02331346","article-title":"Forming sparse representations by local anti-Hebbian learning","volume":"64","author":"Foldiak","year":"1990","journal-title":"Biological Cybernetics"},{"key":"10.1016\/j.neucom.2012.02.055_bib9","first-page":"793","article-title":"Learning image components for object recognition","volume":"7","author":"Spratling","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"10.1016\/j.neucom.2012.02.055_bib10","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1162\/089976602320264033","article-title":"Preintegration lateral inhibition enhances unsupervised learning","volume":"14","author":"Spratling","year":"2002","journal-title":"Neural Computation"},{"key":"10.1016\/j.neucom.2012.02.055_bib11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0925-2312(02)00847-0","article-title":"Exploring the functional significance of dendritic inhibition in cortical pyramidal cells","volume":"52","author":"Spratling","year":"2003","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","article-title":"Discovery of optimal factors in binary data via a novel method of matrix decomposition","volume":"76","author":"Belohlavek","year":"2010","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.neucom.2012.02.055_bib13","series-title":"Models of the Visual Cortex","first-page":"37","article-title":"Cerebral cortex as model builder","author":"Barlow","year":"1985"},{"key":"10.1016\/j.neucom.2012.02.055_bib14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1088\/0954-898X\/12\/3\/301","article-title":"Redundancy reduction revisited","volume":"12","author":"Barlow","year":"2001","journal-title":"Network"},{"key":"10.1016\/j.neucom.2012.02.055_bib15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1098\/rspb.1970.0040","article-title":"A theory for cerebral neocortex","volume":"176","author":"Marr","year":"1970","journal-title":"Proceedings of the Royal Society of London. Series B, Biological Sciences (1934\u20131990)"},{"key":"10.1016\/j.neucom.2012.02.055_bib16","series-title":"Associative Neuron-like Structures","author":"Kussul","year":"1992"},{"key":"10.1016\/j.neucom.2012.02.055_bib17","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","article-title":"The discrete basis problem","volume":"20","author":"Miettinen","year":"2008","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.neucom.2012.02.055_bib18","series-title":"Formal Concept Analysis","author":"Ganter","year":"1999"},{"key":"10.1016\/j.neucom.2012.02.055_bib19","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constrains","volume":"5","author":"Hoyer","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"10.1016\/j.neucom.2012.02.055_bib20","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"Lee","year":"1999","journal-title":"Nature"},{"key":"10.1016\/j.neucom.2012.02.055_bib21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1098\/rstb.1971.0078","article-title":"Simple memory","volume":"262","author":"Marr","year":"1971","journal-title":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences (1934\u20131990)"},{"key":"10.1016\/j.neucom.2012.02.055_bib22","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1016\/S0893-6080(99)00046-5","article-title":"What are the computations of the cerebellum, the basal ganglia and the cerebral cortex?","volume":"12","author":"Doya","year":"1999","journal-title":"Neural Networks"},{"key":"10.1016\/j.neucom.2012.02.055_bib23","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/S0925-2312(01)00675-0","article-title":"Hierarchical word clustering \u2013 automatic thesaurus generation","volume":"48","author":"Hodge","year":"2002","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib24","article-title":"Design of k-means clustering-based polynomial radial basis function neural networks (pRBF NNs) realized with the aid of particle swarm optimization and differential evolution","author":"Oh","year":"2011","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib25","unstructured":"A.A. Frolov, D. Husek, H. Rezankova, V. Snasel, P. Polyakov, Clustering variables by classical approaches and neural network Boolean factor analysis, in: IEEE International Joint Conference on Neural Networks, IJCNN '08, pp. 3742\u20133746."},{"key":"10.1016\/j.neucom.2012.02.055_bib26","first-page":"675","article-title":"On the road to genetic Boolean matrix factorization","volume":"17","author":"Snasel","year":"2007","journal-title":"Neural Network World"},{"key":"10.1016\/j.neucom.2012.02.055_bib27","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2011.05.011","article-title":"Rank-two residue iteration method for nonnegative matrix factorization","author":"Liu","year":"2011","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib28","doi-asserted-by":"crossref","unstructured":"D. Husek, P. Moravec, V. Snasel, A. Frolov, H. Rezankova, P. Polyakov, Comparison of neural network boolean factor analysis method with some other dimension reduction methods on bars problem, in: Second International Conference on Pattern Recognition and Machine Intelligence, Lecture Notes in Computer Science, vol. 4815, Springer, 2007, pp. 235\u2013243.","DOI":"10.1007\/978-3-540-77046-6_29"},{"key":"10.1016\/j.neucom.2012.02.055_bib29","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/TNN.2007.891664","article-title":"Boolean factor analysis by attractor neural network","volume":"18","author":"Frolov","year":"2007","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/j.neucom.2012.02.055_bib30","doi-asserted-by":"crossref","first-page":"2356","DOI":"10.1016\/j.neucom.2007.09.017","article-title":"Hybridizing sparse component analysis with genetic algorithms for microarray analysis","volume":"71","author":"Stadlthanner","year":"2008","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib31","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.neucom.2008.11.033","article-title":"An associative sparse coding neural network and applications","volume":"73","author":"Zeng","year":"2010","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib32","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0925-2312(02)00512-X","article-title":"Imposing sparsity on the mixing matrix in independent component analysis","volume":"49","author":"Hyvarinen","year":"2002","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2012.02.055_bib33","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1016\/j.neucom.2007.07.038","article-title":"Factorisation and denoising of 0-1 data","volume":"71","author":"Kab\u00e1n","year":"2008","journal-title":"Neurocomputing"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231213006954?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231213006954?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T03:44:45Z","timestamp":1563594285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231213006954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":33,"alternative-id":["S0925231213006954"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2012.02.055","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Two Expectation-Maximization algorithms for Boolean Factor Analysis","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2012.02.055","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}