Results 151 to 160 of about 178,314 (358)
Starling: Introducing a mesoscopic scale with Confluence for Graph Clustering. [PDF]
Gaume B.
europepmc +1 more source
ABSTRACT Objective Isolated rapid eye movement sleep behavior disorder (iRBD) is a prodromal state for Lewy body disorders and exhibits biological heterogeneity that may influence clinical expression and progression. We examined clinical features in individuals with iRBD and biomarker‐defined synucleinopathy.
Daniel Weintraub +24 more
wiley +1 more source
Comparative study of graph clustering algorithms
Basic idea of graph clustering is finding sets of “related” vertices in graphs. Graph clustering has many important applications in computing such as market research, pattern recognition, data analysis, image processing, etc., but due to growing sizes of
Shah, Nishita Divyakant
core
Dynamic Graph Clustering Learning for Unsupervised Diabetic Retinopathy Classification. [PDF]
Yu C, Pei H.
europepmc +1 more source
ABSTRACT Objective Variants in SLC6A1, encoding the GABA transporter 1 (GAT‐1), cause epilepsy, autism spectrum disorder, and developmental delay via loss of GABA uptake, impaired trafficking, and ER retention. We previously found that 4‐Phenylbutyrate (PBA), an FDA‐approved drug, restores GABA uptake and reduces seizures in SLC6A1‐related disorders ...
Melissa B. DeLeeuw +5 more
wiley +1 more source
Energy Models for Graph Clustering
Summary: The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software systems. Layouts can naturally represent the cluster structure of graphs by grouping densely connected nodes and separating sparsely connected nodes.
openaire +1 more source
ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach [PDF]
Eran Shaham, Honghai Yu, Xiaoli Li
openalex +1 more source
Multilayer Drawings of Clustered Graphs
Summary: The cluster adjacency graph of a flat clustered graph \(C(G,T)\) is the graph \(A\) whose vertices are the clusters in \(T\) and whose edges connect clusters containing vertices that are adjacent in \(G\). A multilayer drawing of a clustered graph \(C\) consists of a straight-line \(c\)-planar drawing of \(C\) in which the clusters are drawn ...
openaire +1 more source
AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering [PDF]
Pin‐Yu Chen +2 more
openalex +1 more source

