sigmoid.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A social space for people researching, working with, or just interested in AI!

Server stats:

713
active users

#clustering

0 posts0 participants0 posts today

Exciting news, our paper is out!

"Behavioral Clusters and Lesion Distributions in Ischemic Stroke, Based on NIHSS Similarity Network" on Springer Journal of Healthcare Informatics Research rdcu.be/efgma

With my co-first-author Andrea Zanola and co-authors, we explore the relations between behavioral measures of impairment after stroke, and the underlying brain lesions.
Rather than focusing on covariances at the population level, we first cluster individual behavioral phenotypes, and then explore the typical and significant lesions of each cluster.

Our technique, Repeated Spectral Clustering is performed on a similarity network (derived from the General Distance Measure, handy for ordinal scales!), and the partitions are statistically robust thanks to the aggregation of results from multiple random initializations.

We end up with 5 clusters, 3 of which show reknown principal components of deficits (Left Motor, Righ Motor, Language), and their associate lesions.

Interestingly, this multi-item and multimodal approach allows to distinguish different etiologies for the same deficits, thanks to their different behavioral associations, and the different lesions characterizing each cluster. Even when the single NIHSS measure is a bit "vague"...

We hope that popularizing the General Distance Measure, Repeated Spectral Clustering and this clustering perspective aside of PCA / CCA studies can inspire multimodal approaches in other neuroscientific and biomedical domains!

Many thanks to our co-authors, Antonio Luigi Bisogno, Silvia Facchini, Lorenzo Pini, Manfredo Atzori and Maurizio Corbetta for data, analytic and medical insights, and their guidance throughout the whole process!

Two new publications in Computo in January 2025!

The first one, by Félix Laplante and Christophe Ambroise, introduces a new clustering algorithm called Spectral Bridges.

This algorithm detects high-density areas by merging (through spectral clustering) the cells of of a Voronoi tesselation (obtained through k-means) that exhibit a strong bridge affinity.

Bridge affinity is a geometric criterion introduced by the authors, which corresponds to a notion of margin between clusters.

The paper then benchmarks Spectral Bridges against state-of-the art hierarchical clustering, density-based clustering, and centroid-based clustering methods, on data of varying size and dimensions, and demonstrate its superiority in a variety of settings.

The paper is available here: doi.org/10.57750/1gr8-bk61

For once, the paper does not directly include code, as code is provided in two libraries, one in Python: pypi.org/project/spectral-brid and the other in R: github.com/cambroise/spectral-

¿Como trabajan con sus archivos de grabación de audio? si son archivos enormes a mi me gusta un poco de ayuda, normalmente analizo con algún algoritmo de trasients, beats, onsets para poder hacer cortes mas precisos, luego con un algoritmo de clustering eliminar esos segmentos de audio que se parecen demasiado, y organizarlos por similitudes. Hice una versión con GUI de esa herramienta para compartirla.

When you are reading up on deploying #databases the most frequent piece of drive-by advice is "don't use networked storage". Before you can ask the smart ass what they suggest instead in an age of #virtualization #clustering and #kubernetes they have already disappeared into the ether. Not an easy nut to crack, especially in a #homelab. This guy has an actual workable answer: medium.com/@camphul/cloudnativ using #longhorn and #cloundnativepg and some smart sheduling. #k8s #selfhosting

Medium · CloudNative-PG in the homelab with Longhorn - Luca Camphuisen - MediumBy Luca Camphuisen

Shared Nearest Neighbors (SNN) — A distance metric that can improve prediction, clustering, and outlier detection in datasets with many dimensions and with varying densities. Read more from W Brett Kennedy now!

#Clustering #AnomalyDetection

towardsdatascience.com/shared-

Towards Data Science · Shared Nearest Neighbors: A More Robust Distance MetricBy W Brett Kennedy

Exploring the power of Graph Based Clustering! This technique transforms point cloud data into structured, analyzable clusters by leveraging KD-Trees and connected component analysis. Read Florent Poux, Ph.D.'s latest article now.

@PouxPointCloud

#MachineLearning #Clustering

towardsdatascience.com/3d-clus

Towards Data Science · 3D Data Clustering with Graph Theory: Complete Guide | Towards Data ScienceBy Florent Poux, Ph.D.