Minimum Error Tree Decomposition

2013-03-27 · L. Liu, Y. Ma, D. Wilkins, Z. Bian, X. Ying

This paper describes a generalization of previous methods for constructing tree-structured belief network with hidden variables. The major new feature of the described method is the ability to produce a tree decomposition even when there are errors in the correlation data among the input variables. This is an important extension of existing methods since the correlational coefficients usually cannot be measured with precision. The technique involves using a greedy search algorithm that locally minimizes an error function.

📄 PDF Abstract BibTeX arXiv:1304.1103

Code (0)

등록된 구현이 없습니다.

Tasks

Tree Decomposition

2-Slave Dual Decomposition for Generalized Higher Order CRFs

2014-01-01 · TACL 2014 1 · Xian Qian, Yang Liu

We show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming;…

named-entity-recognition Named Entity Recognition Named Entity Recognition (NER)Part-Of-Speech Tagging+1

Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems

2023-06-06 · NeurIPS 2023 11

We study the multi-objective minimum weight base problem, an abstraction of classical NP-hard combinatorial problems such as the multi-objective minimum spanning tree problem. We prove some important properties of the co…

Accelerating Dynamic Programs via Nested Benders Decomposition with Application to Multi-Person Pose Estimation

2018-09-01 · ECCV 2018 9 · Shaofei Wang, Alexander Ihler, Konrad Kording, Julian Yarkony

We present a novel approach to solve dynamic programs (DP), which are frequent in computer vision, on tree-structured graphs with exponential node state space. Typical DP approaches have to enumerate the joint state spa…

Multi-Person Pose Estimation Pose Estimation

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

2021-04-02 · Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun

This paper presents new parallel algorithms for generating Euclidean minimum spanning trees and spatial clustering hierarchies (known as HDBSCAN$^*$). Our approach is based on generating a well-separated pair decompositi…

Clustering

Guaranteed Scalable Learning of Latent Tree Models

2014-06-18 · Furong Huang, Niranjan U. N., Ioakeim Perros, Robert Chen 외

We present an integrated approach for structure and parameter estimation in latent tree graphical models. Our overall approach follows a "divide-and-conquer" strategy that learns models over small groups of variables and…

parameter estimation