mastouille.fr est l'un des nombreux serveurs Mastodon indépendants que vous pouvez utiliser pour participer au fédiverse.
Mastouille est une instance Mastodon durable, ouverte, et hébergée en France.

Administré par :

Statistiques du serveur :

582
comptes actifs

#clustering

0 message0 participant0 message aujourd’hui

Summer ☀️ read: a new paper on model-based clustering just appeared in Computo!

Julien Jacques and Brendan Thomas Murphy publish a new method for clustering multivariate count data. The method combines feature selection and clustering, and is based on conditionally independent Poisson mixture models and Poisson generalized linear models.

On simulations, the Adjusted Rand Index (ARI) of the model with selected variables is close to the optimal ARI obtained with the true clustering variables.

The paper and accompanying R code are available at computo-journal.org/published-

👋 Hi all #Rstats enthusiasts!
I'm looking for someone who has time now to conduct a review of a piece of software for Journal of Open Source Software (JOSS). Details are here:
github.com/openjournals/joss-r

The review process is quite simple - you get a checklist and you run some tests. It's all open, on GitHub.

GitHub[REVIEW]: corrp: An R package for multiple correlation-like analysis and clustering in mixed data · Issue #7319 · openjournals/joss-reviewsPar editorialbot

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 - MediumPar Luca Camphuisen
Suite du fil

I’ve also gone deep into #clustering algorithms. I’m coming to the conclusion that K-Means has assumptions that don’t work well for me, and probably usually don’t work. Some big ones:

- clusters are the same size
- the number of clusters is known

I’m clustering posts by embedding (text content/meaning). Most of the time I don’t know how many posts there are, and my feed is too dynamic for these assumptions to hold.

I’m learning about other algorithms, like DBSCAN

Suite du fil

5/5

Our dataset comprises also CT and MRI scans with patients lesions segmented by an expert.
This allowed us to look at the distribution of lesions cluster-wise, and validate the associations between symptoms and lesions.

Check our pre-print and comment, make questions, offer suggestions!
Although it is not simple to share data, we will release code soon, as a means to replicate the approach on similar data and more.
The link is already in the paper!
And let us know if you have data you'd like to share and analyse with our developing methods👨🏾‍💻

We are deciding on the best match for a journal to review and possibly publish this work, of which I am super proud and thankful to co-authors Andrea Zanola, Antonio Bisogno, Silvia Facchini, Lorenzo Pini, Manfredo Atzori, and Maurizio Corbetta!

Suite du fil

4/n

Reverting our General Distance matrix into the General Similarity matrix yields an ambiguous spectrum, whose eigenvalues do not help to determine the number of clusters in the data.
But repeating clustering and tracing which subjects consistently get clustered together, actually yields the right information, encoded in a co-occurrence matrix.
This latter is quite evidently composed of 5 main clusters.
Our second approach, affinity propagation, found autonomously 7 clusters, that are mainly finer grained partitions of the former 5.

Suite du fil

3/n

We thus decided to use the General Distance Measure to compute pairwise similarities between our 172 subjects, and obtained a matrix, which as math savy people know, is also the description of a network (an "adjacency matrix" for a "weighted undirected graph").
The problem was then to find cliques, communities or clusters of similar patients in such a network, and we used spectral clustering.
Spectral clustering is a family of techniques that use spectra of matrices describing networks, i.e. use eigenvalues of matrices to understand the structure of those networks.

1/n
Our pre-print is finally out!
Here's my first #paperthread 🧵
In this work, co-authors and I clustered ischaemic stroke patients profiles, and recovered common patterns of cognitive, sensorimotor damage.

...Historically many focal lesions to specific cortical areas were associated with specific distinction, but most strokes involve subcortical regions and bring multivariate patterns of deficits.
To characterize those patterns, many studies have turned to correlation analysis, factor analysis, PCA, focusing on the relations among variables==domains of impairments...

medrxiv.org/content/10.1101/20

medRxiv · Behavior Clusters in Ischemic Stroke using NIHSSBACKGROUND Stroke is one of the leading causes of death and disability. The resulting behavioral deficits can be measured with clinical scales of motor, sensory, and cognitive impairment. The most common of such scales is the National Institutes of Health Stroke Scale, or NIHSS. Computerized tomography (CT) and magnetic resonance imaging (MRI) scans show predominantly subcortical or subcortical-cortical lesions, with pure cortical lesions occurring less frequently. While many experimental studies have correlated specific deficits (e.g. motor or language impairment) with stroke lesion locations, the mapping between symptoms and lesions is not straightforward in clinical practice. The advancement of machine learning and data science in recent years has shown unprecedented opportunities even in the biomedical domain. Nevertheless, their application to medicine is not simple, and the development of data driven methods to learn general mathematical models of diseases from healthcare data is still an unsolved challenge. METHODS In this paper we measure statistical similarities of stroke patients based on their NIHSS scores, and we aggregate symptoms profiles through two different unsupervised machine learning techniques: spectral clustering and affinity propagation. RESULTS We identify clusters of patients with largely overlapping, coherent lesions, based on the similarity of behavioral profiles. CONCLUSIONS Overall, we show that an unsupervised learning workflow, open source and transferable to other conditions, can identify coherent mathematical representations of stroke lesions based only on NIHSS data. ### Competing Interest Statement The authors have declared no competing interest. ### Funding Statement This work was supported by the Department of excellence 2018-2022 initiative of the Italian Ministry of education (MIUR) awarded to the Department of Neuroscience-University of Padua. ### Author Declarations I confirm all relevant ethical guidelines have been followed, and any necessary IRB and/or ethics committee approvals have been obtained. Yes The details of the IRB/oversight body that provided approval or exemption for the research described are given below: For data of patients of the Saint Louis cohort: the Internal Review Board of Washington University School of Medicine (WUSM) gave ethical approval for this work. For data of patients of the Padua cohort: the Ethics Committee of the Azienda Ospedale Universit&agrave Padova (AOUP) gave ethical approval for this work. I confirm that all necessary patient/participant consent has been obtained and the appropriate institutional forms have been archived, and that any patient/participant/sample identifiers included were not known to anyone (e.g., hospital staff, patients or participants themselves) outside the research group so cannot be used to identify individuals. Yes I understand that all clinical trials and any other prospective interventional studies must be registered with an ICMJE-approved registry, such as ClinicalTrials.gov. I confirm that any such study reported in the manuscript has been registered and the trial registration ID is provided (note: if posting a prospective study registered retrospectively, please provide a statement in the trial ID field explaining why the study was not registered in advance). Yes I have followed all appropriate research reporting guidelines, such as any relevant EQUATOR Network research reporting checklist(s) and other pertinent material, if applicable. Yes Data can be made available upon reasonable request to Maurizio Corbettta at maurizio.corbetta{at}unipd.it. * AP : Affinity Propagation. GDM : General Distance Measure. GSM : General Similarity Measure. NIHSS : National Institutes of Health Stroke Scale. RSC : Repeated Spectral Clustering.

#HowToThing #006 - Clustering arbitrary n-dimensional data using thi.ng/k-means and customizable distance functions and/or centroid strategies. For example, here to cluster 20 world cities into 5 groups based on their latitude/longitude...

Snippet source code:
gist.github.com/postspectacula

For a visual example (also fully commented) using thousands of items and SVG output, check out:

Demo:
demo.thi.ng/umbrella/kmeans-vi

Source code:
github.com/thi-ng/umbrella/blo

Weak supervision - Strong results! 💪

Smith and team introduce Perturbational Metric Learning (PeML) to extract biological relationships from noisy high-throughput perturbational datasets.

Team effort from preLighters Benjamin Dominik Maier & Anna Foix Romero – read their preLight! 👀

#preLight 👉 prelights.biologists.com/highl