Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.Cataloged from PDF version of thesis.Includes bibliographical references (pages 45-46).Finding low dimensional latent variable models is a useful technique in inferring unobserved affinity between unobserved co-occurrences. We explore using maximal correlation and the alternating conditional expectation algorithm to construct embeddings one dimensional at a time to maximally preserve the linear correlation in the embedding space. Each dimension is enforced to be orthogonal to all other dimensions to not encode redundant information. Intuitively, we want to map objects that frequently co-occur to be close in the embedding spac...
We study the problem of multimodal dimensionality reduction assuming that data samples can be missin...
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embe...
In many scientific tasks we are interested in discovering whether there exist any correlations in ou...
Strickert M, Bunte K, Schleif F-M, Huellermeier E. Correlation-based embedding of pairwise score dat...
Recently a number of unsupervised approaches have been proposed for learning vectors that capture th...
Embedding algorithms search for a low dimensional continuous representation of data, but most algori...
© 2017 IEEE. We introduce Network Maximal Correlation (NMC) as a multivariate measure of nonlinear a...
We introduce a method to learn a hierarchy of successively more abstract represen-tations of complex...
This paper addresses the task of analyzing the correlation between two related domains X and Y . Our...
Many research proposals involve collecting multiple sources of information from a set of common samp...
Abstract. To mine databases in which examples are tagged with class labels, the minimum correlation ...
We consider estimation in a high-dimensional linear model with strongly corre-lated variables. We pr...
This paper studies how to incorporate the ex-ternal word correlation knowledge to improve the cohere...
© 2016 IEEE. Today, modern databases with 'Big Dimensionality' are experiencing a growing trend. Exi...
Latent Gaussian copula models provide a powerful means to perform multi-view data integration since ...
We study the problem of multimodal dimensionality reduction assuming that data samples can be missin...
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embe...
In many scientific tasks we are interested in discovering whether there exist any correlations in ou...
Strickert M, Bunte K, Schleif F-M, Huellermeier E. Correlation-based embedding of pairwise score dat...
Recently a number of unsupervised approaches have been proposed for learning vectors that capture th...
Embedding algorithms search for a low dimensional continuous representation of data, but most algori...
© 2017 IEEE. We introduce Network Maximal Correlation (NMC) as a multivariate measure of nonlinear a...
We introduce a method to learn a hierarchy of successively more abstract represen-tations of complex...
This paper addresses the task of analyzing the correlation between two related domains X and Y . Our...
Many research proposals involve collecting multiple sources of information from a set of common samp...
Abstract. To mine databases in which examples are tagged with class labels, the minimum correlation ...
We consider estimation in a high-dimensional linear model with strongly corre-lated variables. We pr...
This paper studies how to incorporate the ex-ternal word correlation knowledge to improve the cohere...
© 2016 IEEE. Today, modern databases with 'Big Dimensionality' are experiencing a growing trend. Exi...
Latent Gaussian copula models provide a powerful means to perform multi-view data integration since ...
We study the problem of multimodal dimensionality reduction assuming that data samples can be missin...
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embe...
In many scientific tasks we are interested in discovering whether there exist any correlations in ou...