Exact Clustering via Integer Programming and Maximum Satisfiability
Authors: Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa
AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Computational experiments using well-known realworld datasets demonstrate that our ILP-based approaches and their Max SAT counterparts are highly effective in terms of both memory efficiency and computation time. |
| Researcher Affiliation | Academia | Atsushi Miyauchi,1 Tomohiro Sonobe,2, 3 Noriyoshi Sukegawa4 1RIKEN AIP, Tokyo, Japan 2National Institute of Informatics, Tokyo, Japan 3JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan 4Chuo University, Tokyo, Japan |
| Pseudocode | No | The paper describes a post-processing step verbally ('simple post-processing, which we refer to as pp') but does not include a formal pseudocode block or algorithm listing. |
| Open Source Code | No | The paper does not provide any statement or link indicating that the source code for the methodology described is publicly available. |
| Open Datasets | Yes | Correlation clustering instances... were generated from protein sequence datasets on http://www.paccanarolab.org/scps. Group technology... generated from manufacturing cell formation datasets on http://mauricio.resende.info/data. Community detection... generated from network datasets on http://vlado.fmf.uni-lj.si/pub/networks/data. A detailed description of the datasets can be found in Gonc alves and Resende (2004). |
| Dataset Splits | No | The paper mentions using specific real-world datasets but does not explicitly provide details on how the data was split into training, validation, or test sets, nor does it refer to standard predefined splits for the purpose of reproducibility. |
| Hardware Specification | Yes | The experiments were conducted on a Linux machine with Intel Xeon Processor E5-2650 v2 2.60 GHz CPU and 96 GB RAM. |
| Software Dependencies | Yes | All ILP formulations were solved using Gurobi Optimizer 7.0.2 with default parameters. Max SAT-Binary was solved using Max HS 2.9, as recommended in Berg and J arvisalo (2017). |
| Experiment Setup | Yes | The time limit was set to 4 hours and the memory limit was set to 96 GB. As for RP( G), we set the parameter ϵ as follows: ϵ = 1 n2 and 2 n2 , both of which are less than 1/ n 2 . As for Max SAT-Binary, we employed the preprocessing and symmetry-breaking operations mentioned in Berg and J arvisalo (2017). The preprocessing was simulated using Coprocessor 3.0 and the symmetry-breaking procedure called REMOVESLACK was applied. |