On the hardness of labeled correlation clustering problem: A parameterized complexity view.
Xianmin LiuJianzhong LiHong GaoPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- correlation clustering
- parameterized complexity
- fixed parameter tractable
- computational problems
- hierarchical clustering
- np hard
- np complete
- supervised learning
- phase transition
- global constraints
- bounded treewidth
- hard constraints
- conjunctive queries
- map inference
- data management
- graphical models
- query language
- database