2019
DOI: 10.1007/978-3-030-16469-0_8
|View full text |Cite
|
Sign up to set email alerts
|

Adapting Self-Organizing Map Algorithm to Sparse Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…Additionally, these methods can reflect data category density, that is, less frequently occurring items in data are represented by smaller clusters and those occurring more frequentlyby larger clusters. Thanks to such an ability to maintain the topology, visualization methods utilizing neural networks, and in particular modifications of these methods specially created for the analysis of this type of data, are perfect also for visual analysis of sparse datasets [33][34][35][36][37][38]. Sparse data are characterized by that although vectors occurring in such data have very large dimensions, only a small percent of coordinates of these vectors is nonzero.…”
Section: Possibilities Of Visualizations Based On Autoassociative Neumentioning
confidence: 99%
“…Additionally, these methods can reflect data category density, that is, less frequently occurring items in data are represented by smaller clusters and those occurring more frequentlyby larger clusters. Thanks to such an ability to maintain the topology, visualization methods utilizing neural networks, and in particular modifications of these methods specially created for the analysis of this type of data, are perfect also for visual analysis of sparse datasets [33][34][35][36][37][38]. Sparse data are characterized by that although vectors occurring in such data have very large dimensions, only a small percent of coordinates of these vectors is nonzero.…”
Section: Possibilities Of Visualizations Based On Autoassociative Neumentioning
confidence: 99%