Graph learning with Laplacian constraints: Modeling attractive Gaussian Markov random fields

Hilmi E. Egilmez, Eduardo Pavez, Antonio Ortega. Graph learning with Laplacian constraints: Modeling attractive Gaussian Markov random fields. In Michael B. Matthews, editor, 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016, Pacific Grove, CA, USA, November 6-9, 2016. pages 1470-1474, IEEE, 2016. [doi]

@inproceedings{EgilmezPO16,
  title = {Graph learning with Laplacian constraints: Modeling attractive Gaussian Markov random fields},
  author = {Hilmi E. Egilmez and Eduardo Pavez and Antonio Ortega},
  year = {2016},
  doi = {10.1109/ACSSC.2016.7869621},
  url = {http://dx.doi.org/10.1109/ACSSC.2016.7869621},
  researchr = {https://researchr.org/publication/EgilmezPO16},
  cites = {0},
  citedby = {0},
  pages = {1470-1474},
  booktitle = {50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016, Pacific Grove, CA, USA, November 6-9, 2016},
  editor = {Michael B. Matthews},
  publisher = {IEEE},
  isbn = {978-1-5386-3954-2},
}