DocumentCode
3438875
Title
Optimal Correlation Clustering via MaxSAT
Author
Berg, Jeremias ; Jarvisalo, Matti
Author_Institution
Dept. of Comput. Sci., Univ. of Helsinki, Helsinki, Finland
fYear
2013
fDate
7-10 Dec. 2013
Firstpage
750
Lastpage
757
Abstract
We introduce an extensible framework for correlation clustering by harnessing the Maximum satisfiability (MaxSAT) Boolean optimization paradigm. The approach is based on formulating the correlation clustering task in an exact fashion as MaxSAT, and then using a state-of-the-art MaxSAT solver for finding clusterings by solving the MaxSAT formulation. Our approach allows for finding optimal clusterings wrt the objective function of the problem, extends to constrained correlation clustering-by allowing for easy integration of user-defined domain knowledge in terms of hard constraints over the clusterings of interest-as well as overlapping correlation clustering. First experiments on the scalability of the approach are presented.
Keywords
Boolean algebra; computability; computational complexity; optimisation; pattern clustering; MaxSAT; NP-hard task; constrained correlation clustering; hard constraints; maximum satisfiability Boolean optimization paradigm; optimal correlation clustering; overlapping correlation clustering; user-defined domain knowledge; Clustering algorithms; Correlation; Encoding; Linear programming; Optimization; Proteins; Scalability; correlation clustering; maximum satisfiability;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining Workshops (ICDMW), 2013 IEEE 13th International Conference on
Conference_Location
Dallas, TX
Print_ISBN
978-1-4799-3143-9
Type
conf
DOI
10.1109/ICDMW.2013.99
Filename
6753996
Link To Document