New Measure of Boolean Factor Analysis Quality

0359156 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
Frolov, A. A. - Húsek, Dušan - Polyakov, P.Y.
New Measure of Boolean Factor Analysis Quality.
Adaptive and Natural Computing Algorithms. Part I. Vol. 1. Heidelberg: Springer, 2011 - (Dobnikar, A.; Lotrič, U.; Šter, B.), s. 100-109. Lecture Notes in Computer Science, 6593. ISBN 978-3-642-20281-0. ISSN 0302-9743.
[ICANNGA'2011. International Conference /10./. Ljubljana (SI), 14.04.2011-16.04.2011]
R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079
Institutional research plan: CEZ:AV0Z10300504
Keywords : Boolean factor analysis * information gain * expectation-maximization * associative memory * neural network application * Boolean matrix factorization * bars problem * Hopfield neural network
Subject RIV: IN - Informatics, Computer Science

Learning of objects from complex patterns is a long-term challenge in philosophy, neuroscience, machine learning, data mining, and in statistics. There are some approaches in literature trying to solve this difficult task consisting in discovering hidden structure of high-dimensional binary data and one of them is Boolean factor analysis. However there is no expert independent measure for evaluating this method in terms of the quality of solutions obtained, when analyzing unknown data. Here we propose information gain, model-based measure of the rate of success of individual methods. This measure presupposes that observed signals arise as Boolean superposition of base signals with noise. For the case whereby a method does not provide parameters necessary for information gain calculation we introduce the procedure for their estimation. Using an extended version of the ”Bars Problem” generation of typical synthetics data for such a task, we show that our measure is sensitive to all types of data model parameters and attains its maximum, when best fit is achieved.
Permanent Link: http://hdl.handle.net/11104/0196992