Pith. sign in

REVIEW

Reconstructing Self Organizing Maps as Spider Graphs for better visual interpretation of large unstructured datasets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1301.0289 v1 pith:74AN7VXX submitted 2012-12-24 cs.GR stat.ML

classification cs.GRstat.ML
keywords mapsmodelrepresentationanalysiscobwebdatadimensionsgraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Self-Organizing Maps (SOM) are popular unsupervised artificial neural network used to reduce dimensions and visualize data. Visual interpretation from Self-Organizing Maps (SOM) has been limited due to grid approach of data representation, which makes inter-scenario analysis impossible. The paper proposes a new way to structure SOM. This model reconstructs SOM to show strength between variables as the threads of a cobweb and illuminate inter-scenario analysis. While Radar Graphs are very crude representation of spider web, this model uses more lively and realistic cobweb representation to take into account the difference in strength and length of threads. This model allows for visualization of highly unstructured dataset with large number of dimensions, common in Bigdata sources.

Discussion (0). Continue with ORCID to comment.

Pith tools