Search results for "Clusterin"

Estimating Missing Information by Cluster Analysis and Normalized Convolution

2018

International audience; Smart city deals with the improvement of their citizens' quality of life. Numerous ad-hoc sensors need to be deployed to know humans' activities as well as the conditions in which these actions take place. Even if these sensors are cheaper and cheaper, their installation and maintenance cost increases rapidly with their number. We propose a methodology to limit the number of sensors to deploy by using a standard clustering technique and the normalized convolution to estimate environmental information whereas sensors are actually missing. In spite of its simplicity, our methodology lets us provide accurate assesses.

Hierarchical networks of food exchange in the black garden ant Lasius niger

2020

In most eusocial insects, the division of labour results in relatively few individuals foraging for the entire colony. Thus, the survival of the colony depends on its efficiency in meeting the nutritional needs of all its members. Here, we characterise the network topology of a eusocial insect to understand the role and centrality of each caste in this network during the process of food dissemination. We constructed trophallaxis networks from 34 food-exchange experiments in black garden ants (Lasius niger). We tested the influence of brood and colony size on (i) global indices at the network level (i.e. efficiency, resilience, centralisation and modularity) and (ii) individual values (i.e. …

How challenging RADseq data turned out to favor coalescent-based species tree inference. A case study in Aichryson (Crassulaceae)

2022

Analysing multiple genomic regions while incorporating detection and qualification of discordance among regions has become standard for understanding phylogenetic relationships. In plants, which usually have comparatively large genomes, this is feasible by the combination of reduced-representation library (RRL) methods and high-throughput sequencing enabling the cost effective acquisition of genomic data for thousands of loci from hundreds of samples. One popular RRL method is RADseq. A major disadvantage of established RADseq approaches is the rather short fragment and sequencing range, leading to loci of little individual phylogenetic information. This issue hampers the application of coa…

Fuzzy quantification of common and rare species in ecological communities (FuzzyQ)

2021

International audience; Most species in ecological communities are rare, whereas only a few are common. This distributional paradox has intrigued ecologists for decades but the interpretation of species abundance distributions remains elusive.We present Fuzzy Quantification of Common and Rare Species in Ecological Communities (FuzzyQ) as an R package. FuzzyQ shifts the focus from the prevailing species-categorization approach to develop a quantitative framework that seeks to place each species along a rarity-commonness gradient. Given a community surveyed over a number of sites, quadrats, or any other convenient sampling unit, FuzzyQ uses a fuzzy clustering algorithm that estimates a probab…

gllvm: Fast analysis of multivariate abundance data with generalized linear latent variable models inr

2019

The work of J.N. was supported by the Wihuri Foundation. The work of S.T. was supported by the CRoNoS COST Action IC1408.F.K.C.H. was also supported by an ANU cross disciplinary grant.

A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems

2021

The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…

2016

Focal demyelinated lesions, diffuse white matter (WM) damage and grey matter (GM) atrophy influence directly the disease progression in patients with multiple sclerosis. The aim of this study was to identify specific characteristics of GM and WM structural networks in subjects with clinically isolated syndrome (CIS) in comparison to patients with early relapsing-remitting multiple sclerosis (RRMS). Twenty patients with CIS, thirty three with RRMS and forty healthy subjects were investigated using 3 T-MRI. Diffusion tensor imaging was applied, together with probabilistic tractography and fractional anisotropy (FA) maps for WM and cortical thickness correlation analysis for GM, to determine t…

Quantum clustering in non-spherical data distributions: Finding a suitable number of clusters

2017

Quantum Clustering (QC) provides an alternative approach to clustering algorithms, several of which are based on geometric relationships between data points. Instead, QC makes use of quantum mechanics concepts to find structures (clusters) in data sets by finding the minima of a quantum potential. The starting point of QC is a Parzen estimator with a fixed length scale, which significantly affects the final cluster allocation. This dependence on an adjustable parameter is common to other methods. We propose a framework to find suitable values of the length parameter σ by optimising twin measures of cluster separation and consistency for a given cluster number. This is an extension of the Se…

Application of Graph Clustering and Visualisation Methods to Analysis of Biomolecular Data

2018

In this paper we present an approach based on integrated use of graph clustering and visualisation methods for semi-supervised discovery of biologically significant features in biomolecular data sets. We describe several clustering algorithms that have been custom designed for analysis of biomolecular data and feature an iterated two step approach involving initial computation of thresholds and other parameters used in clustering algorithms, which is followed by identification of connected graph components, and, if needed, by adjustment of clustering parameters for processing of individual subgraphs.

Revealing community structures by ensemble clustering using group diffusion

2018

We propose an ensemble clustering approach using group diffusion to reveal community structures in data. We represent data points as a directed graph and assume each data point belong to single cluster membership instead of multiple memberships. The method is based on the concept of ensemble group diffusion with a parameter to represent diffusion depth in clustering. The ability to modulate the diffusion-depth parameter by varying it within a certain interval allows for more accurate construction of clusters. Depending on the value of the diffusion-depth parameter, the presented approach can determine very well both local clusters and global structure of data. At the same time, the ability …