Author of the publication

Attractor Neural Network Combined with Likelihood Maximization Algorithm for Boolean Factor Analysis.

, , and . ISNN (1), volume 7367 of Lecture Notes in Computer Science, page 1-10. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Attractor Neural Network Combined with Likelihood Maximization Algorithm for Boolean Factor Analysis., , and . ISNN (1), volume 7367 of Lecture Notes in Computer Science, page 1-10. Springer, (2012)Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain., , and . IEEE Trans. Neural Networks Learn. Syst., 27 (3): 538-550 (2016)Some Remarks on Binary Data Grouping., , , , and . DEXA Workshops, page 559-565. IEEE Computer Society, (2008)Recurrent-Neural-Network-Based Boolean Factor Analysis and Its Application to Word Clustering., , and . IEEE Trans. Neural Networks, 20 (7): 1073-1086 (2009)Learning and Unlearning in Hopfield-Like Neural Network Performing Boolean Factor Analysis., , , and . Advances in Machine Learning I, volume 262 of Studies in Computational Intelligence, Springer, (2010)New BFA method based on attractor neural network and likelihood maximization., , , and . Neurocomputing, (2014)New Measure of Boolean Factor Analysis Quality., , and . ICANNGA (1), volume 6593 of Lecture Notes in Computer Science, page 100-109. Springer, (2011)Boolean Factor Analysis by Expectation-Maximization Method., , and . IHCI, volume 179 of Advances in Intelligent Systems and Computing, page 243-254. Springer, (2011)Boolean Factor Analysis by Attractor Neural Network., , , and . IEEE Trans. Neural Networks, 18 (3): 698-707 (2007)BFA and BMF: What is the difference., , , , and . ISDA, page 890-896. IEEE, (2012)