![]() |
CiteULike | ![]() |
mkis's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Self-organizing maps, vector quantization, and mixture modelingby: T. Heskes
Neural Networks, IEEE Transactions on In Neural Networks, IEEE Transactions on, Vol. 12, No. 6. (2001), pp. 1299-1305.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractSelf-organizing maps are popular algorithms for unsupervised learning and data visualization. Exploiting the link between vector quantization and mixture modeling, we derive expectation-maximization (EM) algorithms for self-organizing maps with and without missing values. We compare self-organizing maps with the elastic-net approach and explain why the former is better suited for the visualization of high-dimensional data. Several extensions and improvements are discussed. As an illustration we apply a self-organizing map based on a multinomial distribution to market basket analysis
BibTeX record
RIS record