NDLI: Fast stochastic neighbor embedding: a trust-region algorithm

Content Provider	IEEE Xplore Digital Library
Author	Kijoeng Nam Hongmo Je Seungjin Choi
Copyright Year	2004
Description	Author affiliation: Dept. of Comput. Sci., POSTECH, Pohang, South Korea (Kijoeng Nam; Hongmo Je; Seungjin Choi)
Abstract	Stochastic neighbor embedding (SNE) is a probabilistic method of embedding objects, described by high-dimensional vectors or by pair wise dissimilarities, into a lower dimensional space in a way that neighbor identities are preserved. Despite of the useful behavior of SNE, it suffers from its slow convergence due to a gradient-based implementation. In this paper we present a fast SNE algorithm which is approximately 4-6 times faster than the gradient-based SNE algorithm. Our fast SNE algorithm, named TR-SNE employs a trust-region (TR) method which finds a direction and a step size in an efficient and reliable manner with the help of a quadratic model of the objective function. We confirm the high performance and the fast convergence of our TR-SNR through numerical experiments.
Starting Page	123
Ending Page	128
File Size	369184
Page Count	6
File Format	PDF
ISBN	0780383591
ISSN	10987576
DOI	10.1109/IJCNN.2004.1379883
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-07-25
Publisher Place	Hungary
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Stochastic processes Principal component analysis Euclidean distance Laplace equations Probability distribution Computer science Convergence of numerical methods Machine learning Data analysis Data visualization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

LA2SNE: A novel stochastic neighbor embedding approach for microbiome data visualization

Fast stochastic neighbor embedding: a trust-region algorithm.

An Improved Manifold Learning Algorithm for Data Visualization

Embedding via clustering: using spectral information to guide dimensionality reduction

Dimensionality reduction mappings

Optimal Learning Rates for Some Principal Component Analysis Algorithms

Visualizing graphs with Krylov subspaces

Subspace learning using consensus on the grassmannian manifold

Performance Comparison of Nonlinear Dimensionality Reduction Methods for Image Data Using Different Distance Measures

Fast stochastic neighbor embedding: a trust-region algorithm

Similar Documents

LA2SNE: A novel stochastic neighbor embedding approach for microbiome data visualization

Fast stochastic neighbor embedding: a trust-region algorithm.

An Improved Manifold Learning Algorithm for Data Visualization

Embedding via clustering: using spectral information to guide dimensionality reduction

Dimensionality reduction mappings

Optimal Learning Rates for Some Principal Component Analysis Algorithms

Visualizing graphs with Krylov subspaces

Subspace learning using consensus on the grassmannian manifold

Performance Comparison of Nonlinear Dimensionality Reduction Methods for Image Data Using Different Distance Measures

Fast stochastic neighbor embedding: a trust-region algorithm