Name
Abstract | ||
|---|---|---|
M-Modes for graphical models is the problem of finding top M label configurations of highest probability in their local neighborhoods. The state-of-the-art method for solving M-Modes is a dynamic programming algorithm which computes global modes by first computing local modes of each subgraph and then search through all their consistent combinations. A drawback of the algorithm is that most of its time is wasted on computing local modes that are never used in global modes. This paper introduces new algorithms that directly search the space of consistent local modes in finding the global modes, which is enabled by a novel search operator designed to search a subgraph of variables at each time. As a result, the search algorithms only need to generate and verify a small number of local modes and can hence lead to significant improvement in efficiency and scalability. |
Year | Venue | Field |
|---|---|---|
2016 | IJCAI | Dynamic programming,Heuristic,Search algorithm,Guided Local Search,Computer science,Beam search,Theoretical computer science,Artificial intelligence,Local search (optimization),Graphical model,Machine learning,Scalability |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cong Chen | 1 | 38 | 12.03 |
| Changhe Yuan | 2 | 366 | 25.47 |
| Chao Chen | 3 | 2032 | 185.26 |