[HTML][HTML] Explainable AI for operational research: A defining framework, methods, applications, and a research agenda

KW De Bock, K Coussement, A De Caigny… - European Journal of …, 2024 - Elsevier
The ability to understand and explain the outcomes of data analysis methods, with regard to
aiding decision-making, has become a critical requirement for many applications. For …

A comprehensive survey of clustering algorithms

D Xu, Y Tian - Annals of data science, 2015 - Springer
Data analysis is used as a common method in modern science research, which is across
communication science, computer science and biology science. Clustering, as the basic …

Clustering trees: a visualization for evaluating clusterings at multiple resolutions

L Zappia, A Oshlack - Gigascience, 2018 - academic.oup.com
Clustering techniques are widely used in the analysis of large datasets to group together
samples with similar properties. For example, clustering is often used in the field of single …

Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms

E Schubert, PJ Rousseeuw - … Conference, SISAP 2019, Newark, NJ, USA …, 2019 - Springer
Clustering non-Euclidean data is difficult, and one of the most used algorithms besides
hierarchical clustering is the popular algorithm Partitioning Around Medoids (PAM), also …

Deep learning-based clustering approaches for bioinformatics

MR Karim, O Beyan, A Zappa, IG Costa… - Briefings in …, 2021 - academic.oup.com
Clustering is central to many data-driven bioinformatics research and serves a powerful
computational method. In particular, clustering helps at analyzing unstructured and high …

Atlas of clinically distinct cell states and ecosystems across human solid tumors

BA Luca, CB Steen, M Matusiak, A Azizi, S Varma… - Cell, 2021 - cell.com
Determining how cells vary with their local signaling environment and organize into distinct
cellular communities is critical for understanding processes as diverse as development …

[HTML][HTML] Fast and eager k-medoids clustering: O (k) runtime improvement of the PAM, CLARA, and CLARANS algorithms

E Schubert, PJ Rousseeuw - Information Systems, 2021 - Elsevier
Clustering non-Euclidean data is difficult, and one of the most used algorithms besides
hierarchical clustering is the popular algorithm Partitioning Around Medoids (PAM), also …

Forecasting across time series databases using recurrent neural networks on groups of similar series: A clustering approach

K Bandara, C Bergmeir, S Smyl - Expert systems with applications, 2020 - Elsevier
With the advent of Big Data, nowadays in many applications databases containing large
quantities of similar time series are available. Forecasting time series in these domains with …

Stop using the elbow criterion for k-means and how to choose the number of clusters instead

E Schubert - ACM SIGKDD Explorations Newsletter, 2023 - dl.acm.org
A major challenge when using k-means clustering often is how to choose the parameter k,
the number of clusters. In this letter, we want to point out that it is very easy to draw poor …

Correlation and association analyses in microbiome study integrating multiomics in health and disease

Y Xia - Progress in molecular biology and translational …, 2020 - Elsevier
Correlation and association analyses are one of the most widely used statistical methods in
research fields, including microbiome and integrative multiomics studies. Correlation and …