MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm
From MaRDI portal
Publication:6097141
DOI10.1007/s10994-022-06275-9MaRDI QIDQ6097141
Hiroyuki Toda, Hideaki Kim, Yasunori Akagi, Naoki Marumo, Takeshi Kurashima
Publication date: 12 June 2023
Published in: Machine Learning (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A framework of discrete DC programming by discrete convex analysis
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- A strongly polynomial minimum cost circulation algorithm
- Discrete convex analysis
- DC programming and DCA: thirty years of developments
- Continuous relaxation for discrete DC programming
- The Concave-Convex Procedure
This page was built for publication: MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm