In this paper, we compare performance of novel neural network based algorithm for Boolean factor analysis with 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 are well 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 these methods. Resulting images show that Boolean factor analysis is upmost suitable method for this kind of data. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Húsek, D., Moravec, P., Snášel, V., Frolov, A., Řezanková, H., & Polyakov, P. (2007). Comparison of neural network Boolean factor analysis method with some other dimension reduction methods on bars problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4815 LNCS, pp. 235–243). Springer Verlag. https://doi.org/10.1007/978-3-540-77046-6_29
Mendeley helps you to discover research relevant for your work.