PixelSNE: Pixel-Aligned Stochastic Neighbor Embedding for Efficient 2D Visualization with Screen-Resolution Precision
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Minjeong | - |
dc.contributor.author | Choi, Minsuk | - |
dc.contributor.author | Lee, Sunwoong | - |
dc.contributor.author | Tang, Jian | - |
dc.contributor.author | Park, Haesun | - |
dc.contributor.author | Choo, Jaegul | - |
dc.date.accessioned | 2021-09-02T11:16:57Z | - |
dc.date.available | 2021-09-02T11:16:57Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2018-06 | - |
dc.identifier.issn | 0167-7055 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/75435 | - |
dc.description.abstract | Embedding 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.language | English | - |
dc.language.iso | en | - |
dc.publisher | WILEY | - |
dc.subject | DIMENSIONALITY REDUCTION | - |
dc.title | PixelSNE: Pixel-Aligned Stochastic Neighbor Embedding for Efficient 2D Visualization with Screen-Resolution Precision | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choo, Jaegul | - |
dc.identifier.doi | 10.1111/cgf.13418 | - |
dc.identifier.scopusid | 2-s2.0-85050260868 | - |
dc.identifier.wosid | 000438024300025 | - |
dc.identifier.bibliographicCitation | COMPUTER GRAPHICS FORUM, v.37, no.3, pp.267 - 276 | - |
dc.relation.isPartOf | COMPUTER GRAPHICS FORUM | - |
dc.citation.title | COMPUTER GRAPHICS FORUM | - |
dc.citation.volume | 37 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 267 | - |
dc.citation.endPage | 276 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordPlus | DIMENSIONALITY REDUCTION | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.