Computational Methods for Intelligent Information Access
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Algorithm 805: computation and uses of the semidiscrete matrix decomposition
ACM Transactions on Mathematical Software (TOMS)
Learning Image Components for Object Recognition
The Journal of Machine Learning Research
Journal of Cognitive Neuroscience
Document clustering using nonnegative matrix factorization
Information Processing and Management: an International Journal
Boolean Factor Analysis by Attractor Neural Network
IEEE Transactions on Neural Networks
Implementing Boolean Matrix Factorization
ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
Hi-index | 0.00 |
In this paper, we compare performance of novel neural network based algorithmfor Boolean factor analysiswith several dimension reduction techniques as a tool for feature extraction. Compared are namely singular value decomposition, semi-discrete decomposition and non-negative matrix factorization algorithms, including some cluster analysis methods as well. Even if the mainly mentioned methods are linear, it is interesting to compare them with neural network based Boolean factor analysis, because they arewell elaborated. Second reason for this is to show basic differences between Boolean and linear case. So called bars problem is used as the benchmark. Set of artificial signals generated as a Boolean sum of given number of bars is analyzed by thesemethods. Resulting images show that Boolean factor analysis is upmost suitable method for this kind of data.