modern data analysis involves large sets of structured data, where the structure carries critical information about the nature of the data. these relationships between entities, such as features or data samples, are usually described by a graph structure. while many real-world data are intrinsically graph-structured, e.g. social and traffic networks, there is still a large number of applications, where the graph topology is not readily available. for instance, gene regulations in biological applications or neuronal connections in the brain are not known. in these applications, the graphs need to be learned since they reveal the relational structure and may assist in a variety of learning tasks. graph learning (gl) deals with the inference of a topological structure among entities from a set of observations on these entities, i.e., graph signals. most of the existing work on graph learning focuses on learning a single graph structure, assuming that the relations between the observed data samples are homogeneous. however, in many real-world applications, there are different forms of interactions between data samples, such as single-cell rna sequencing (scrna-seq) across multiple cell types. this talk will present a new framework for multiview graph learning in two settings: i) multiple views of the same data and ii) heterogeneous data with unknown cluster information. in the first case, a joint learning approach where both individual graphs and a consensus graph are learned will be developed. in the second case, a unified framework that merges classical spectral clustering with graph signal smoothness will be developed for joint clustering and multiview graph learning. 
this is joint work with abdullah karaaslanli, satabdi saha and taps maiti.