Results 61 to 70 of about 33,631 (264)
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
Improved Epsilon-greedy Algorithm for Cold-start Problem of New Users [PDF]
When solving the cold-start problem of new users,fixed and invariant Epsilon parameters will slow the convergence of traditional Epsilon-greedy algorithm.Therefore,an improved Epsilon-greedy algorithm is proposed.Immune feedback model is used to ...
WANG Suqin,ZHANG Yang,JIANG Hao,ZHU Dengming
doaj +1 more source
Five‐Year Disease Progression in Synuclein Seeding Positive Sporadic Parkinson's Disease
ABSTRACT Objective To provide a comprehensive description of disease progression in synuclein seeding assay (SAA) positive sporadic Parkinson Disease participants, using Neuronal Synuclein Disease integrated biological and functional impairment staging framework.
Paulina Gonzalez‐Latapi +19 more
wiley +1 more source
Value of MRI Outcomes for Preventive and Early‐Stage Trials in Spinocerebellar Ataxias 1 and 3
ABSTRACT Objective To examine the value of MRI outcomes as endpoints for preventive and early‐stage trials of two polyglutamine spinocerebellar ataxias (SCAs). Methods A cohort of 100 participants (23 SCA1, 63 SCA3, median Scale for the Assessment and Rating of Ataxia (SARA) score = 5, 42% preataxic, and 14 gene‐negative controls) was scanned at 3T up ...
Thiago J. R. Rezende +26 more
wiley +1 more source
Publication in the conference proceedings of EUSIPCO, Barcelona, Spain ...
Chatterjee, Saikat +3 more
openaire +2 more sources
Noisy, Greedy and Not So Greedy k-means++
The k-means++ algorithm due to Arthur and Vassilvitskii has become the most popular seeding method for Lloyd's algorithm. It samples the first center uniformly at random from the data set and the other $k-1$ centers iteratively according to $D^2$-sampling where the probability that a data point becomes the next center is proportional to its squared ...
Bhattacharya, Anup +3 more
openaire +4 more sources
ABSTRACT Objective Onasemnogene abeparvovec (OA) is an AAV9‐based gene therapy for spinal muscular atrophy type I (SMA I). Real‐world outcomes show increased response variability compared to clinical trials, and follow‐up data beyond 12–18 months are limited.
Marika Pane +43 more
wiley +1 more source
Greedy algorithms: a review and open problems
Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms.
Andrea García
doaj +1 more source
Lebesgue constants for Chebyshev thresholding greedy algorithms
We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n-term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then
Chunfang Shao, Peixin Ye
doaj +1 more source
CSF Monoamine Metabolites and Cognitive Trajectory in Early Parkinson's Disease
ABSTRACT Background Imaging and postmortem studies indicate that abnormalities in monoaminergic neurotransmission contribute to cognitive impairment in Parkinson's disease (PD). However, it remains uncertain if cerebrospinal fluid (CSF) monoamine metabolites can serve as biomarkers of cognitive decline in early PD.
Jing‐Yu Shao +7 more
wiley +1 more source

