Name
Abstract | ||
|---|---|---|
Binary Factor Analysis (BFA) aims to discover latent binary structures in high dimensional data. Parameter learning in BFA suffers from exponential complexity and a large number of local optima. Model selection in BFA is therefore difficult. The traditional approach for model selection is implemented in a two phase procedure. On a prefixed range of model scales, maximum likelihood (ML) learning is performed for each candidate scale. After this enumeration, the optimum scale is selected according to some criterion. In contrast, the Bayesian Ying-Yang (BYY) learning starts from a high dimensional model and automatically deducts the dimension during parameter learning. The enumeration overhead in the two phase approach is saved. This paper investigates a subclass of BFA called Orthogonal Binary Factor Analysis (OBFA). A BYY machine for OBFA is constructed. The harmony measure, which serves as the objective function in the BYY harmony learning, is more accurately estimated by recovering a term that was missing in the previous studies on BYY learning based BFA. Comparison with traditional two phase implementations shows good performance of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87536-9_27 | ICANN (1) |
Keywords | Field | DocType |
phase implementation,model scale,bayesian ying-yang learning,orthogonal binary factor analysis,phase approach,byy machine,parameter learning,phase procedure,byy harmony learning,high dimensional model,model selection,objective function,maximum likelihood,high dimensional data,factor analysis | Clustering high-dimensional data,Pattern recognition,Local optimum,Computer science,Enumeration,Model selection,Parameter learning,Dimensional modeling,Artificial intelligence,Machine learning,Binary number,Bayesian probability | Conference |
Volume | Issue | ISSN |
19 | SP5 | 1210-0552 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||