Počet záznamů: 1
New Measure of Boolean Factor Analysis Quality
- 1.
SYSNO ASEP 0359156 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV D - Článek ve sborníku Název New Measure of Boolean Factor Analysis Quality Tvůrce(i) Frolov, A. A. (RU)
Húsek, Dušan (UIVT-O) RID, SAI, ORCID
Polyakov, P.Y. (RU)Zdroj.dok. Adaptive and Natural Computing Algorithms. Part I, 1. - Heidelberg : Springer, 2011 / Dobnikar A. ; Lotrič U. ; Šter B. - ISSN 0302-9743 - ISBN 978-3-642-20281-0 Rozsah stran s. 100-109 Poč.str. 10 s. Akce ICANNGA'2011. International Conference /10./ Datum konání 14.04.2011-16.04.2011 Místo konání Ljubljana Země SI - Slovinsko Typ akce WRD Jazyk dok. eng - angličtina Země vyd. DE - Německo Klíč. slova Boolean factor analysis ; information gain ; expectation-maximization ; associative memory ; neural network application ; Boolean matrix factorization ; bars problem ; Hopfield neural network Vědní obor RIV IN - Informatika CEP GAP202/10/0262 GA ČR - Grantová agentura ČR GA205/09/1079 GA ČR - Grantová agentura ČR CEZ AV0Z10300504 - UIVT-O (2005-2011) UT WOS 000302389300011 EID SCOPUS 79955094881 DOI 10.1007/978-3-642-20282-7_11 Anotace 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. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2012
Počet záznamů: 1