PixelSNE: Pixel-Aligned Stochastic Neighbor Embedding for Efficient 2D Visualization with Screen-Resolution Precision

Cited 2 time in webofscience Cited 1 time in scopus
  • Hit : 451
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKim, Minjeongko
dc.contributor.authorChoi, Minsukko
dc.contributor.authorLee, Sunwoongko
dc.contributor.authorTang, Jianko
dc.contributor.authorPark, Haesunko
dc.contributor.authorChoo, Jaegulko
dc.date.accessioned2020-03-24T06:20:12Z-
dc.date.available2020-03-24T06:20:12Z-
dc.date.created2020-03-24-
dc.date.created2020-03-24-
dc.date.created2020-03-24-
dc.date.issued2018-06-
dc.identifier.citationCOMPUTER GRAPHICS FORUM, v.37, no.3, pp.267 - 276-
dc.identifier.issn0167-7055-
dc.identifier.urihttp://hdl.handle.net/10203/273434-
dc.description.abstractEmbedding and visualizing large-scale high-dimensional data in a two-dimensional space is an important problem, because such visualization can reveal deep insights of complex data. However, most of the existing embedding approaches run on an excessively high precision, even when users want to obtain a brief insight from a visualization of large-scale datasets, ignoring the fact that in the end, the outputs are embedded onto a fixed-range pixel-based screen space. Motivated by this observation and directly considering the properties of screen space in an embedding algorithm, we propose Pixel-Aligned Stochastic Neighbor Embedding (PixelSNE), a highly efficient screen resolution-driven 2D embedding method which accelerates Barnes-Hut tree-based t-distributed stochastic neighbor embedding (BH-SNE), which is known to be a state-of-the-art 2D embedding method. Our experimental results show a significantly faster running time for PixelSNE compared to BH-SNE for various datasets while maintaining comparable embedding quality.-
dc.languageEnglish-
dc.publisherWILEY-
dc.titlePixelSNE: Pixel-Aligned Stochastic Neighbor Embedding for Efficient 2D Visualization with Screen-Resolution Precision-
dc.typeArticle-
dc.identifier.wosid000438024300025-
dc.identifier.scopusid2-s2.0-85050260868-
dc.type.rimsART-
dc.citation.volume37-
dc.citation.issue3-
dc.citation.beginningpage267-
dc.citation.endingpage276-
dc.citation.publicationnameCOMPUTER GRAPHICS FORUM-
dc.identifier.doi10.1111/cgf.13418-
dc.contributor.localauthorChoo, Jaegul-
dc.contributor.nonIdAuthorKim, Minjeong-
dc.contributor.nonIdAuthorChoi, Minsuk-
dc.contributor.nonIdAuthorLee, Sunwoong-
dc.contributor.nonIdAuthorTang, Jian-
dc.contributor.nonIdAuthorPark, Haesun-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle; Proceedings Paper-
dc.subject.keywordPlusDIMENSIONALITY REDUCTION-
Appears in Collection
AI-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0