scientific article; zbMATH DE number 6378173

MaRDI QIDQ2934137zbMATH OpenFDO

Authors

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v15/vandermaaten14a.html

zbMATH Keywords

\(t\)-SNEBarnes-Hut algorithmdual-tree algorithmembeddingmultidimensional scalingspace-partitioning trees

Mathematics Subject Classification ID

Graphical methods in statistics (62A09) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• scientific article; zbMATH DE number 7204478
• Efficient tree decomposition of high-rank tensors
• Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
• Fast computation in adaptive tree approximation
• Spectral neighbor joining for reconstruction of latent tree models

Cited in

(73)

• Parallelization of eigenvalue-based dimensional reductions via homotopy continuation
• A manifold-based approach to sparse global constraint satisfaction problems
• Conditional t-SNE: more informative t-SNE embeddings
• Interpretable machine learning: fundamental principles and 10 grand challenges
• Stochastic cluster embedding
• A deep multi-task representation learning method for time series classification and retrieval
• A comprehensive study of domain-specific emoji meanings in sentiment classification
• Clustering methods for single-cell RNA-sequencing expression data: performance evaluation with varying sample sizes and cell compositions
• Study on text representation method based on deep learning and topic information
• Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
• Kernel dynamic policy programming: applicable reinforcement learning to robot systems with high dimensional states
• Multi-manifold discriminant Isomap for visualization and classification
• A graph-based N-body approximation with application to stochastic neighbor embedding
• Relation constrained attributed network embedding
• A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems
• Study of phase transition of Potts model with domain adversarial neural network
• Plug-and-play dual-tree algorithm runtime analysis
• Tapkee: an efficient dimension reduction library
• Visualizing data using t-SNE
• On the role and impact of the metaparameters in t-distributed stochastic neighbor embedding
• Randomized near-neighbor graphs, giant components and applications in data science
• Dimensionality Reduction via Dynamical Systems: The Case of t-SNE
• Clustering with t-SNE, provably
• Parametric UMAP Embeddings for Representation and Semisupervised Learning
• Unsupervised classification of eclipsing binary light curves through \(k\)-medoids clustering
• scientific article; zbMATH DE number 7626716 (Why is no real title available?)
• A tractable latent variable model for nonlinear dimensionality reduction
• Improving the effectiveness and efficiency of stochastic neighbour embedding with isolation kernel
• t-SNE visualization of large-scale neural recordings
• IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation
• SLISEMAP: supervised dimensionality reduction through local explanations
• Embedding to reference t-SNE space addresses batch effects in single-cell classification
• Neural manifold analysis of brain circuit dynamics in health and disease
• Statistical embedding: beyond principal components
• Uncovering smartphone usage patterns with multi-view mixed membership models
• Better together: extending JMP\(^{\circledR}\) with open-source software
• Kernel two-sample tests for manifold data
• A method of improving initial partition of Fiduccia-Mattheyses algorithm
• Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Discussion of: ``Statistical exploration of the manifold hypothesis
• Reply to the discussion of: ``Statistical exploration of the manifold hypothesis
• Soft-constrained distance preserving t-SNE
• NNP-net: accelerating t-SNT graph drawing for very large graphs by neural networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934137)