To refer to this page use:
|Abstract:||Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such data, neither can the theories developed around such methods be directly applied. In this paper, we propose a new principled framework for estimating multi-attribute graphs. Instead of estimating the partial correlation as in current literature, our method estimates the partial canonical correlations that naturally accommodate complex nodal features. Computationally, we provide an efficient algorithm which utilizes the multi-attribute structure. Theoretically, we provide sufficient conditions which guarantee consistent graph recovery. Extensive simulation studies demonstrate performance of our method under various conditions.|
|Citation:||Kolar, Mladen, Han Liu, and Eric Xing. "Markov network estimation from multi-attribute data." Proceedings of the 30th International Conference on Machine Learning, PMLR 28(3), (2013): pp. 73-81.|
|Pages:||73 - 81|
|Type of Material:||Conference Article|
|Series/Report no.:||Proceedings of Machine Learning Research;|
|Journal/Proceeding Title:||Proceedings of the 30th International Conference on Machine Learning|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.