Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jens Nilsson 0002

dblp:17/4624-2 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 67% Learning theory · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.112007
Regression on manifolds using kernel dimension reduction · ICML 2007
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
kernel dimension reduction
0.112007
Regression on manifolds using kernel dimension reduction · ICML 2007
Machine learning › Learning theory › nonparametric regression
manifold regression
0.112007
Regression on manifolds using kernel dimension reduction · ICML 2007
Bioinformatics and computational biology
gene expression analysis
0.012004
Approximate geodesic distances reveal biologically relevant structures in microarray data · Bioinform. 2004
Bioinformatics and computational biology › gene expression analysis
microarray data analysis
0.012004
Approximate geodesic distances reveal biologically relevant structures in microarray data · Bioinform. 2004

Methods — techniques the papers use, named apart from their topics

laplacian eigenmaps · 0.1kernel dimension reduction · 0.1cross-covariance operator · 0.1multidimensional scaling · 0.0isomap · 0.0geodesic distance · 0.0
YearPublicationVenuePosition
2007 Regression on manifolds using kernel dimension reduction
abstract
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads of research. On the one hand, the literature on sufficient dimension reduction has focused on methods for finding the best linear subspace for nonlinear regression; we extend this to manifolds. On the other hand, the literature on manifold learning has focused on unsupervised dimensionality reduction; we extend this to the supervised setting. Our approach to solving the problem involves combining the machinery of kernel dimension reduction with Laplacian eigenmaps. Specifically, we optimize cross-covariance operators in kernel feature spaces that are induced by the normalized graph Laplacian. The result is a highly flexible method in which no strong assumptions are made on the regression function or on the distribution of the covariates. We illustrate our methodology on the analysis of global temperature data and image manifolds.
Jens Nilsson 0002, Fei Sha, Michael I. Jordan
ICML1
2007 A circuit framework for robust manifold learning
Jens Nilsson 0002, Fredrik Andersson
Neurocomputing1
2004 Approximate geodesic distances reveal biologically relevant structures in microarray data
abstract
MOTIVATION: Genome-wide gene expression measurements, as currently determined by the microarray technology, can be represented mathematically as points in a high-dimensional gene expression space. Genes interact with each other in regulatory networks, restricting the cellular gene expression profiles to a certain manifold, or surface, in gene expression space. To obtain knowledge about this manifold, various dimensionality reduction methods and distance metrics are used. For data points distributed on curved manifolds, a sensible distance measure would be the geodesic distance along the manifold. In this work, we examine whether an approximate geodesic distance measure captures biological similarities better than the traditionally used Euclidean distance. RESULTS: We computed approximate geodesic distances, determined by the Isomap algorithm, for one set of lymphoma and one set of lung cancer microarray samples. Compared with the ordinary Euclidean distance metric, this distance measure produced more instructive, biologically relevant, visualizations when applying multidimensional scaling. This suggests the Isomap algorithm as a promising tool for the interpretation of microarray data. Furthermore, the results demonstrate the benefit and importance of taking nonlinearities in gene expression data into account.
Jens Nilsson 0002, Thoas Fioretos, Mattias Höglund, Magnus Fontes
Bioinform.1