veganism.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
Veganism Social is a welcoming space on the internet for vegans to connect and engage with the broader decentralized social media community.

Administered by:

Server stats:

290
active users

#clustering

1 post1 participant0 posts today

#30DayChartChallenge Día 14: Kinship! 🌿 Hoy toca visualizar "parentescos" animales, pero basados en ¡similitud de rasgos! #RelationshipsWeek #Animals

Este dendrograma horizontal es el resultado de un clustering jerárquico (hclust Ward.D2) sobre ~170 especies, usando su Masa Corporal y Longevidad Máxima (log-transformadas y escaladas). ¡Muestra quién se agrupa con quién según su estrategia de vida!

Las ramas unen las especies más similares. La longitud horizontal hasta la unión indica cuán diferentes son. Se ven grandes grupos que separan, por ejemplo, animales muy grandes/longevos de otros más pequeños/rápidos. Es una forma de ver la estructura oculta en los datos de rasgos.

(Solo se muestra 1/3 de las etiquetas para no saturar!)

🛠 #rstats #ggplot2 #ggdendro #stats | Datos: Kaggle (S. Banerjee)
📂 Código/Viz: t.ly/Y_fwt

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.

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.

Federated link aggregators should not own individual topics. Topics should belong to the entire fedi.

Instance owned topics is just another form of centralization.

We should not only discourage topic diaspora (e.g., a "gaming" topic on beehaw is separate from a gaming topic on another instance) but engineer solutions to *allow* and default unification of content by topic across the fedi for link aggregation (but not force this).

(De)federation then becomes how we keep topics safe for our communities: blocking posts and comments from demonstrably unsafe instances.

This is a CAP distributed system problem. My instincts say that federated link aggregation is a different enough problem from federated blogging (mastodon) that we need federated instances to share content via a consensus algorithm and not the mastodon style of federation.

I wonder about the practicalities of making this work in the truly heterogenous system of the #fediverse.

Perhaps by having the federation members/instances themselves share capability and capacity metadata with the cluster so as to load balance intelligently? The alternative could be an unintentional DDOS due to a massive instance going offline, shedding traffic to instances too small to handle the load.

Ahhhh #Introduction
I'm a phd student in #hpc and #computationalscience.
Making computers go brrr for large scale data analytics (#clustering, nearest neighbors, #imageprocessing, #linearalgebra) & dabble in tools for task based #parallelism. Hope to see some of ya'll @ #SC22!

I listen to more #ska than is acceptable in 2022, and will lie about having better music tastes than the digimon movie soundtrack. @ me with loose leaf #tea and #book recs (always reading #fiction & #webserials)