2007
DOI: 10.1007/978-3-540-77046-6_29
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Neural Network Boolean Factor Analysis Method with Some Other Dimension Reduction Methods on Bars Problem

Abstract: 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 wel… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 9 publications
0
8
0
Order By: Relevance
“…There are several well known methods and algorithms for factorization of real data but many application areas including information retrieval, pattern recognition and data mining require processing of binary rather than real data (see [13,25,42]). …”
Section: Matrix Factorization For Feature Selection and Classificationmentioning
confidence: 99%
“…There are several well known methods and algorithms for factorization of real data but many application areas including information retrieval, pattern recognition and data mining require processing of binary rather than real data (see [13,25,42]). …”
Section: Matrix Factorization For Feature Selection and Classificationmentioning
confidence: 99%
“…All the elements in X, A, and B are either 0 or 1. n is defined to be the number of underlying factors and is assumed to be considerably smaller than the number of objects T . BFA methods aim to find a feasible decomposition minimizing n. Frolov et al study the problem of factoring a binary matrix in a series of papers [20], [21], [22] using Hopfield neural networks. This approaches are based on heuristics and do not provide much theoretical insight regarding the properties of the resulting decomposition.…”
Section: Related Workmentioning
confidence: 99%
“…Zero Error Case: If X is perfectly observed, containing no noise, we have p e = 0 and α i = x i − X i = 0, or equivalently, x i = X i . The integer programming problem in (13) can now be simplified as:…”
Section: The Inverse Problemmentioning
confidence: 99%
“…All the elements in X, A, and B are either 0 or 1. n is defined to be the number of underlying factors and is assumed to be considerably smaller than the number of objects T . BFA methods aim to find a feasible decomposition minimizing n. neural networks [12], [10], [13]. This approach is based on heuristic and do not provide much theoretical insight regarding the properties of the resulting decomposition.…”
Section: Related Workmentioning
confidence: 99%