Exactly Solving Minimum Dominating Set and Its Generalization

Abstract

Multiple clustering approaches aim to partition complex data in different ways. These methods often exhibit a one-to-many relationship in their results, and relying solely on the data context may be insufficient to capture the patterns relevant to the user. User’s expectation is key for the multiple clustering task. Two main challenges exist: identifying the significant features to represent user interests and aligning those interests with the clustering results. To address this issue, we propose Contrastive Multiple Clusterings (CMClusts), which extends contrastive learning to multiple clustering by elevating traditional instance-level contrast to clustering-level contrast. Furthermore, CMClusts integrates user expectations or interests by extracting desired features through tailored data augmentations, enabling the model to effectively capture user-relevant clustering features. Experimental results on benchmark datasets show that CMClusts can generate interpretable and high-quality clusterings, which reflect different user interests.

Cite

Text

Xiong and Xiao. "Exactly Solving Minimum Dominating Set and Its Generalization." International Joint Conference on Artificial Intelligence, 2024. doi:10.24963/ijcai.2024/780

Markdown

[Xiong and Xiao. "Exactly Solving Minimum Dominating Set and Its Generalization." International Joint Conference on Artificial Intelligence, 2024.](https://mlanthology.org/ijcai/2024/xiong2024ijcai-exactly/) doi:10.24963/ijcai.2024/780

BibTeX

@inproceedings{xiong2024ijcai-exactly,
  title     = {{Exactly Solving Minimum Dominating Set and Its Generalization}},
  author    = {Xiong, Ziliang and Xiao, Mingyu},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {7056-7064},
  doi       = {10.24963/ijcai.2024/780},
  url       = {https://mlanthology.org/ijcai/2024/xiong2024ijcai-exactly/}
}