Incorporating SAT solvers into hierarchical clustering algorithms

摘要: The area of constrained clustering has been actively pursued for the last decade. A more recent extension that will be focus this paper is hierarchical which allows building user-constrained dendrograms/trees. Like all forms clustering, previous work on uses simple constraints are typically implemented in a procedural language. However, there exists mature results and packages fields constraint satisfaction languages solvers field yet to explore. This marks first steps towards introducing languages/solvers into clustering. We make several significant contributions. show how many existing new can modeled as Horn-SAT problem easily solvable polynomial time their implementation any number declarative or efficient solvers. implement our own solver efficiency reasons. then formulate flexible manner so algorithms, whose output dendrogram, use constraints.