Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimizing t-SNE using random sampling techniques
Linnaeus University, Faculty of Technology, Department of Mathematics.
2019 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The main topic of this thesis concerns t-SNE, a dimensionality reduction technique that has gained much popularity for showing great capability of preserving well-separated clusters from a high-dimensional space. Our goal with this thesis is twofold. Firstly we give an introduction to the use of dimensionality reduction techniques in visualization and, following recent research, show that t-SNE in particular is successful at preserving well-separated clusters. Secondly, we perform a thorough series of experiments that give us the ability to draw conclusions about the quality of embeddings from running t-SNE on samples of data using different sampling techniques. We are comparing pure random sampling, random walk sampling and so-called hubness sampling on a dataset, attempting to find a sampling method that is consistently better at preserving local information than simple random sampling. Throughout our testing, a specific variant of random walk sampling distinguished itself as a better alternative to pure random sampling.

Place, publisher, year, edition, pages
2019. , p. 38
Keywords [en]
Machine learning, t-SNE, visualization, sampling
National Category
Mathematics
Identifiers
URN: urn:nbn:se:lnu:diva-88585OAI: oai:DiVA.org:lnu-88585DiVA, id: diva2:1345416
Subject / course
Mathematics
Educational program
Applied Mahtematics Programme, 180 credits
Presentation
2019-06-05, D1072, P G Vejdes väg 29, Växjö, 08:00 (English)
Supervisors
Examiners
Available from: 2019-08-26 Created: 2019-08-23 Last updated: 2019-08-26Bibliographically approved

Open Access in DiVA

fulltext(5179 kB)1372 downloads
File information
File name FULLTEXT01.pdfFile size 5179 kBChecksum SHA-512
5d9683fa55e26555afa465df5f178f446d4680ef9ed7a4cf652e4838f7a004cb4ec5ab20c50971dce9eebae2790eb727427972c32b26f69f7e4d9d4c0629ce9d
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Buljan, Matej
By organisation
Department of Mathematics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1372 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 704 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf