Abstract
Constrained clustering has received much attention since its inception as the ability to add weak supervision into clustering has many uses. Most existing work is algorithm-specific, limited to simple together and apart constraints and does not attempt to satisfy all constraints. This limits applications including where satisfying all constraints is required such as fairness. In this work, we take the novel direction of post-processing the results of a clustering algorithm (constrained or unconstrained) as a combinatorial optimization problem to find the best allocation of instances to clusters whilst enforcing constraints. Experiments show that when evaluated on a ground truth, our method is competitive in terms of clustering quality with the more recent approaches while being more computationally efficient. Finally, since all constraints are satisfied, our work can be applied to areas such as fairness including both group level and individual level fairness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: ICML 2000, pp. 1103–1110 (2000)
Basu, S., Davidson, I., Wagstaff, K.: Constrained Clustering: Advances in Algorithms, Theory, and Applications, 1 edn. Chapman & Hall/CRC, London (2008)
Wang, X., Davidson, I.: Flexible constrained spectral clustering. In: KDD 2010, pp. 563–572 (2010)
Walker, P.B., Davidson, I.N.: Exploring new methodologies for the analysis of functional magnetic resonance imaging (fMRI) following closed-head injuries. In: Schmorrow, D.D., Fidopiastis, C.M. (eds.) FAC 2011. LNCS (LNAI), vol. 6780, pp. 120–128. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21852-1_15
Harley, J.M., et al.: Clustering and profiling students according to their interactions with an intelligent tutoring system fostering self-regulated learning. JEDM| J. Edu. Data Min. 5(1), 104–146 (2013)
Wagstaff, K., Cardie, C., Rogers, S., Schrödl, S.: Constrained K-means clustering with background knowledge. In: ICML 2001, pp. 577–584 (2001)
Davidson, I., Ravi, S.S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: SDM 2005, pp. 138–149 (2005)
Davidson, I., Ravi, S.S., Shamis, L.: A SAT-based framework for efficient constrained clustering. In: ICDM 2010, pp. 94–105 (2010)
Zhang, H., Basu, S., Davidson, I.: Deep constrained clustering - algorithms and advances. In: ECML 2019 (2019)
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)
Schubert, E., Sander, J., Ester, M., Kriegel, H.P., Xu, X.: DDSCAN revisited, revisited: why and how you should (still) use DBSCAN. ACM Trans. Database Syst. (TODS) 42(3), 19 (2017)
Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: ICML 2004, pp. 11–18 (2004)
Bradley, P., Bennett, K., Demiriz, A.: Constrained k-means clustering, Technical report. MSR-TR-2000-65, Microsoft Research (2000)
Ge, R., Ester, M., Jin, W., Davidson, I.: Constraint-driven clustering. In: KDD 2007, pp. 320–329 (2007)
Tang, W., Yang, Y., Zeng, L., Zhan, Y.: Optimizing MSE for clustering with balanced size constraints. Symmetry 11(3) (2019)
Babaki, B., Guns, T., Nijssen, S.: Constrained clustering using column generation. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 438–454. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07046-9_31
Mueller, M., Kramer, S.: Integer linear programming models for constrained clustering. In: DS 2010, pp. 159–173 (2010)
Ouali, A., Loudni, S., Lebbah, Y., Boizumault, P., Zimmermann, A., Loukil, L.: Efficiently finding conceptual clustering models with integer linear programming. In: IJCAI 2016, pp. 647–654 (2016)
Métivier, J.-P., Boizumault, P., Crémilleux, B., Khiari, M., Loudni, S.: Constrained clustering using SAT. In: Hollmén, J., Klawonn, F., Tucker, A. (eds.) IDA 2012. LNCS, vol. 7619, pp. 207–218. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34156-4_20
Dao, T.-B.-H., Vrain, C., Duong, K.-C., Davidson, I.: A Framework for actionable clustering using constraint programming. In: ECAI 2016, pp. 453–461 (2016)
Dao, T.-B.-H., Duong, K.-C., Vrain, C.: Constrained clustering by constraint programming. Artif. Intell. 244, 70–94 (2017)
Xie, J., Girshick, R., Farhadi, A.: Unsupervised deep embedding for clustering analysis. In: ICML 2016, pp. 478–487 (2016)
Liu, E.Y., Zhang, Z., Wang, W.: Clustering with relative constraints. In: KDD 2011, pp. 947–955 (2011)
Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Advances in Neural Information Processing Systems, pp. 5029–5037 (2017)
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.S.: Fairness through awareness. In: Innovations in Theoretical Computer Science 2012, pp. 214–226 (2012)
Lewis, D.D., Yang, Y., Rose, T.G., Li, F.: RCV1: a new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361–397 (2004)
Guo, X., Gao, L., Liu, X., Yin, J.: Improved deep embedded clustering with local structure preservation. In: IJCAI 2017, pp. 1753–1759 (2017)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Quart. 2(1–2), 83–97 (1955)
Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: ICML 2019, pp. 405–413 (2019)
Kearns, M.J., Roth, A., Sharifi-Malvajerdi, S.: Average individual fairness: algorithms, generalization and experiments, CoRR, vol. abs/1905.10607 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Nghiem, NVD., Vrain, C., Dao, TBH., Davidson, I. (2020). Constrained Clustering via Post-processing. In: Appice, A., Tsoumakas, G., Manolopoulos, Y., Matwin, S. (eds) Discovery Science. DS 2020. Lecture Notes in Computer Science(), vol 12323. Springer, Cham. https://doi.org/10.1007/978-3-030-61527-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-61527-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61526-0
Online ISBN: 978-3-030-61527-7
eBook Packages: Computer ScienceComputer Science (R0)