Learning Latent Features With Infinite Nonnegative Binary Matrix Trifactorization

Nonnegative matrix factorization (NMF) has been widely exploited in many computational intelligence and pattern recognition problems. In particular, it can be used to extract latent features from data. However, previous NMF models often assume a fixed number of features, which are normally tuned and...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on emerging topics in computational intelligence Ročník 2; číslo 6; s. 450 - 463
Hlavní autoři:	Yang, Xi, Huang, Kaizhu, Zhang, Rui, Hussain, Amir
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.12.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Artificial intelligence Bayes methods Bayesian analysis Benchmarks Clustering Clustering methods Complexity theory Computational intelligence Computational modeling Computer simulation Feature extraction Gaussian distribution Indian Buffet Process prior Infinite latent feature model Infinite non-negative binary matrix tri-factori-zation Iterative methods Learning Matrix decomposition Normal distribution Optimization Pattern recognition Simulation
ISSN:	2471-285X, 2471-285X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!