Abstract
AbstractPattern discovery in multidimensional data sets has been the subject of research for decades. There exists a wide spectrum of clustering algorithms that can be used for this purpose. However, their practical applications share a common post-clustering phase, which concerns expert-based interpretation and analysis of the obtained results. We argue that this can be the bottleneck in the process, especially in cases where domain knowledge exists prior to clustering. Such a situation requires not only a proper analysis of automatically discovered clusters but also conformance checking with existing knowledge. In this work, we present Knowledge Augmented Clustering (KnAC). Its main goal is to confront expert-based labelling with automated clustering for the sake of updating and refining the former. Our solution is not restricted to any existing clustering algorithm. Instead, KnAC can serve as an augmentation of an arbitrary clustering algorithm, making the approach robust and a model-agnostic improvement of any state-of-the-art clustering method. We demonstrate the feasibility of our method on artificially, reproducible examples and in a real life use case scenario. In both cases, we achieved better results than classic clustering algorithms without augmentation.
Funder
Narodowe Centrum Nauki
Uniwersytet Jagielloński w Krakowie
Publisher
Springer Science and Business Media LLC
Reference56 articles.
1. Acharya A, Hruschka ER, Ghosh J, Acharyya S (2011) C3e: A framework for combining ensembles of classifiers and clusterers. In: Sansone C, Kittler J, Roli F (eds) Multiple classifier systems, pp 269–278. Springer Berlin Heidelberg
2. Ali M, Jones MW, Xie X, Williams M (2019) TimeCluster: Dimension reduction applied to temporal data for visual analytics. Visual Comput 35(6–8):1013–1026. https://doi.org/10.1007/s00371-019-01673-y
3. Ali M, Jones MW, Xie X, Williams M (2019) TimeCluster: dimension reduction applied to temporal data for visual analytics. Vis Comput 35(6–8):1013–1026. https://doi.org/10.1007/s00371-019-01673-y
4. Bae J, Helldin T, Riveiro M, Nowaczyk S, Bouguelia MR, Falkman G (2020) Interactive clustering: A comprehensive review. ACM Comput Surv 53(1):1–39. https://doi.org/10.1145/3340960
5. Blockeel H, Raedt LD, Ramon J (1998) Top-down induction of clustering trees. In: Proceedings of the fifteenth international conference on machine learning, ICML ’98, pp 55–63. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献