Creating sessions in scientific conferences consists in grouping papers with common topics taking into account the size restrictions imposed by the conference schedule. Therefore, this problem can be considered as semi-supervised clustering of documents based on their content. This paper aims to propose modifications in traditional clustering algorithms to incorporate size constraints in each cluster. Specifically, two new algorithms are proposed to semi-supervised clustering, based on: binary integer linear programming with cannot-link constraints and a variation of the K-Medoids algorithm, respectively. The applicability of the proposed semi-supervised clustering methods is illustrated by addressing the problem of automatic configuration of conference schedules by clustering articles by similarity. We include experiments, applying the new techniques, over real conferences datasets: ICMLA-2014, AAAI-2013 and AAAI-2014. The results of these experiments show that the new methods are able to solve practical and real problems.
|Number of pages||10|
|Journal||Procedia Computer Science|
|State||Published - 2017|
|Event||International Conference on Computational Science ICCS 2017 - Zurich, Switzerland|
Duration: 12 Jun 2017 → 14 Jun 2017
Bibliographical notePublisher Copyright:
© 2017 The Authors. Published by Elsevier B.V.
- Clustering with constraints
- Linear programming
- Size constraint