Mikael Vejdemo-Johansson

Dr. Mikael Vejdemo-Johansson

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 February 2013 in Scientific Reports
Verified
Journal Article
Open access
PDF file
PLP. Y. Lum
P. Y. Lum
GSG. Singh
G. Singh
ALA. Lehman
A. Lehman
TIT. Ishkanov
T. Ishkanov
MVMikael Vejdemo-Johansson
Mikael Vejdemo-Johansson
GCG. Carlsson
G. Carlsson
This paper applies topological methods to study complex high dimensional data sets by extracting shapes (patterns) and obtaining insights about them. Our method combines the best features of existing standard methodologies such as principal component and cluster analyses to provide a geometric representation of complex data sets. Through this hybrid method, we often find subgroups in data sets that traditional methodologies fail to find. Our method also permits the analysis of individual data sets as well as the analysis of relationships between related data sets. We illustrate the use of our method by applying it to three very different kinds of data, namely gene expression from breast tumors, voting data from the United States House of Representatives and player performance data from the NBA, in each case finding stratifications of the data which are more refined than those produced by standard methods.

30 March 2011 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
VSVin de Silva
Vin de Silva
DMDmitriy Morozov
Dmitriy Morozov
MVMikael Vejdemo-Johansson
Mikael Vejdemo-Johansson
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE, and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of low-dimensional coordinates which represent the intrinsic structure of the data. This paradigm incorporates the assumption that real-valued coordinates provide a rich enough class of functions to represent the data faithfully and efficiently. On the other hand, there are simple structures which challenge this assumption: the circle, for example, is one-dimensional, but its faithful representation requires two real coordinates. In this work, we present a strategy for constructing circle-valued functions on a statistical data set. We develop a machinery of persistent cohomology to identify candidates for significant circle-structures in the data, and we use harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves. We suggest that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets.

10 November 2011 in Inverse Problems
Verified
Journal Article
Closed access
VSVin de Silva
Vin de Silva
DMDmitriy Morozov
Dmitriy Morozov
MVMikael Vejdemo-Johansson
Mikael Vejdemo-Johansson

1 January 2014
Verified
Book Chapter
Closed access
PDF file
HAHenry Adams
Henry Adams
ATAndrew Tausz
Andrew Tausz
MVMikael Vejdemo-Johansson
Mikael Vejdemo-Johansson

3 November 2011 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
BWBei Wang
Bei Wang
BSBrian Summa
Brian Summa
VPValerio Pascucci
Valerio Pascucci
MVMikael Vejdemo-Johansson
Mikael Vejdemo-Johansson
Large observations and simulations in scientific research give rise to high-dimensional data sets that present many challenges and opportunities in data analysis and visualization. Researchers in application domains such as engineering, computational biology, climate study, imaging and motion capture are faced with the problem of how to discover compact representations of highdimensional data while preserving their intrinsic structure. In many applications, the original data is projected onto low-dimensional space via dimensionality reduction techniques prior to modeling. One problem with this approach is that the projection step in the process can fail to preserve structure in the data that is only apparent in high dimensions. Conversely, such techniques may create structural illusions in the projection, implying structure not present in the original high-dimensional data. Our solution is to utilize topological techniques to recover important structures in high-dimensional data that contains non-trivial topology. Specifically, we are interested in high-dimensional branching structures. We construct local circle-valued coordinate functions to represent such features. Subsequently, we perform dimensionality reduction on the data while ensuring such structures are visually preserved. Additionally, we study the effects of global circular structures on visualizations. Our results reveal never-before-seen structures on real-world data sets from a variety of applications.

1 December 2014 in The Interdisciplinary Journal of Discontinuity, Nonlinearity, and Complexity
Verified
Journal Article
Closed access
JBJesse J. Berwald
Jesse J. Berwald
MGMarian Gidea
Marian Gidea
MVMikael Vejdemo-Johansson
Mikael Vejdemo-Johansson