Browse
Submit Data
Databases
API
Help

Dataset Information

19 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

An unsupervised neuromorphic clustering algorithm.

ABSTRACT: Brains perform complex tasks using a fraction of the power that would be required to do the same on a conventional computer. New neuromorphic hardware systems are now becoming widely available that are intended to emulate the more power efficient, highly parallel operation of brains. However, to use these systems in applications, we need "neuromorphic algorithms" that can run on them. Here we develop a spiking neural network model for neuromorphic hardware that uses spike timing-dependent plasticity and lateral inhibition to perform unsupervised clustering. With this model, time-invariant, rate-coded datasets can be mapped into a feature space with a specified resolution, i.e., number of clusters, using exclusively neuromorphic hardware. We developed and tested implementations on the SpiNNaker neuromorphic system and on GPUs using the GeNN framework. We show that our neuromorphic clustering algorithm achieves results comparable to those of conventional clustering algorithms such as self-organizing maps, neural gas or k-means clustering. We then combine it with a previously reported supervised neuromorphic classifier network to demonstrate its practical use as a neuromorphic preprocessing module.

SUBMITTER: Diamond A

PROVIDER: S-EPMC6658584 | biostudies-literature | 2019 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

CLAG: an unsupervised non hierarchical clustering algorithm handling biological data.

Project description:BackgroundSearching for similarities in a set of biological data is intrinsically difficult due to possible data points that should not be clustered, or that should group within several clusters. Under these hypotheses, hierarchical agglomerative clustering is not appropriate. Moreover, if the dataset is not known enough, like often is the case, supervised classification is not appropriate either.ResultsCLAG (for CLusters AGgregation) is an unsupervised non hierarchical clustering algorithm designed to cluster a large variety of biological data and to provide a clustered matrix and numerical values indicating cluster strength. CLAG clusterizes correlation matrices for residues in protein families, gene-expression and miRNA data related to various cancer types, sets of species described by multidimensional vectors of characters, binary matrices. It does not ask to all data points to cluster and it converges yielding the same result at each run. Its simplicity and speed allows it to run on reasonably large datasets.ConclusionsCLAG can be used to investigate the cluster structure present in biological datasets and to identify its underlying graph. It showed to be more informative and accurate than several known clustering methods, as hierarchical agglomerative clustering, k-means, fuzzy c-means, model-based clustering, affinity propagation clustering, and not to suffer of the convergence problem proper to this latter.

| S-EPMC3519615 | biostudies-literature

Unsupervised Cryo-EM Data Clustering through Adaptively Constrained K-Means Algorithm.

Project description:In single-particle cryo-electron microscopy (cryo-EM), K-means clustering algorithm is widely used in unsupervised 2D classification of projection images of biological macromolecules. 3D ab initio reconstruction requires accurate unsupervised classification in order to separate molecular projections of distinct orientations. Due to background noise in single-particle images and uncertainty of molecular orientations, traditional K-means clustering algorithm may classify images into wrong classes and produce classes with a large variation in membership. Overcoming these limitations requires further development on clustering algorithms for cryo-EM data analysis. We propose a novel unsupervised data clustering method building upon the traditional K-means algorithm. By introducing an adaptive constraint term in the objective function, our algorithm not only avoids a large variation in class sizes but also produces more accurate data clustering. Applications of this approach to both simulated and experimental cryo-EM data demonstrate that our algorithm is a significantly improved alterative to the traditional K-means algorithm in single-particle cryo-EM analysis.

| S-EPMC5154524 | biostudies-literature

Unsupervised clustering and epigenetic classification of single cells

Project description:96 scATAC-seq samples generated for the retinoic acid-induced mESC differentiation at day 4.

2018-04-20 | GSE107651 | GEO

Real time unsupervised learning of visual stimuli in neuromorphic VLSI systems.

Project description:Neuromorphic chips embody computational principles operating in the nervous system, into microelectronic devices. In this domain it is important to identify computational primitives that theory and experiments suggest as generic and reusable cognitive elements. One such element is provided by attractor dynamics in recurrent networks. Point attractors are equilibrium states of the dynamics (up to fluctuations), determined by the synaptic structure of the network; a 'basin' of attraction comprises all initial states leading to a given attractor upon relaxation, hence making attractor dynamics suitable to implement robust associative memory. The initial network state is dictated by the stimulus, and relaxation to the attractor state implements the retrieval of the corresponding memorized prototypical pattern. In a previous work we demonstrated that a neuromorphic recurrent network of spiking neurons and suitably chosen, fixed synapses supports attractor dynamics. Here we focus on learning: activating on-chip synaptic plasticity and using a theory-driven strategy for choosing network parameters, we show that autonomous learning, following repeated presentation of simple visual stimuli, shapes a synaptic connectivity supporting stimulus-selective attractors. Associative memory develops on chip as the result of the coupled stimulus-driven neural activity and ensuing synaptic dynamics, with no artificial separation between learning and retrieval phases.

| S-EPMC4604465 | biostudies-literature

Unsupervised hierarchical clustering of iHPCs induced by 9 or 10 TFs

2011-06-07 | GSE29730 | GEO

Unsupervised hierarchical clustering of iNPCs induced by 6 or 5 TFs

2011-06-07 | GSE29724 | GEO

Unsupervised statistical clustering of environmental shotgun sequences.

Project description:BACKGROUND: The development of effective environmental shotgun sequence binning methods remains an ongoing challenge in algorithmic analysis of metagenomic data. While previous methods have focused primarily on supervised learning involving extrinsic data, a first-principles statistical model combined with a self-training fitting method has not yet been developed. RESULTS: We derive an unsupervised, maximum-likelihood formalism for clustering short sequences by their taxonomic origin on the basis of their k-mer distributions. The formalism is implemented using a Markov Chain Monte Carlo approach in a k-mer feature space. We introduce a space transformation that reduces the dimensionality of the feature space and a genomic fragment divergence measure that strongly correlates with the method's performance. Pairwise analysis of over 1000 completely sequenced genomes reveals that the vast majority of genomes have sufficient genomic fragment divergence to be amenable for binning using the present formalism. Using a high-performance implementation, the binner is able to classify fragments as short as 400 nt with accuracy over 90% in simulations of low-complexity communities of 2 to 10 species, given sufficient genomic fragment divergence. The method is available as an open source package called LikelyBin. CONCLUSION: An unsupervised binning method based on statistical signatures of short environmental sequences is a viable stand-alone binning method for low complexity samples. For medium and high complexity samples, we discuss the possibility of combining the current method with other methods as part of an iterative process to enhance the resolving power of sorting reads into taxonomic and/or functional bins.

| S-EPMC2765972 | biostudies-literature

Unsupervised ranking of clustering algorithms by INFOMAX.

Project description:Clustering and community detection provide a concise way of extracting meaningful information from large datasets. An ever growing plethora of data clustering and community detection algorithms have been proposed. In this paper, we address the question of ranking the performance of clustering algorithms for a given dataset. We show that, for hard clustering and community detection, Linsker's Infomax principle can be used to rank clustering algorithms. In brief, the algorithm that yields the highest value of the entropy of the partition, for a given number of clusters, is the best one. We show indeed, on a wide range of datasets of various sizes and topological structures, that the ranking provided by the entropy of the partition over a variety of partitioning algorithms is strongly correlated with the overlap with a ground truth partition The codes related to the project are available in https://github.com/Sandipan99/Ranking_cluster_algorithms.

| S-EPMC7588117 | biostudies-literature

Unsupervised hierarchical clustering of iHPCs induced by 9 or 10 TFs

Project description:To clarify the gene expression profile of iHep, microarray analysis was performed using iHeps induced by 10 TFs (Foxg1, Lcor, Hnf3b, Hnf4a, Foxo6, Cdx2, Tcf1, Foxa3 ,Tcf2, Onecut1) and 9 TFs (Onecut1 was omitted from 10 TFs). Unsupervised hierarchical clustering indicated that iHep is expressing a global transcriptional profile more similar to that of HPCs rather than that of NPCs, and suggested that TFs present in the pool acted as inducing TFs. HPC (HB1 and HNG2) were established from fetal liver (E13.5) of C57BL6J and STOCK Tg(Nanog-GFP, Puro)1 Yam, respectively. iHeps were induced from NPC (NSBAg2, established from an ES cell line BAg73C2 carrying beta-geo knock-in allele in Afp) using retroviral vectors (pMXs without drug-selection markers) of 9 or 10 transcription factors. Three weeks after the infection, G418 was added and cultured for 1 week before the harvest. NSBAg2 and NSEB5-2C were used for the data of NPC. GSM396240 and GSM336010 were used for the data of ESC.

2011-06-07 | E-GEOD-29730 | biostudies-arrayexpress

Unsupervised hierarchical clustering of iNPCs induced by 6 or 5 TFs

Project description:To clarify the gene expression profile of iNPC, microarray analysis was performed using iNPCs induced by 6 TFs (Pax6, Hmga2, Etv6, Gatad2b, Nfxl1, and Esx1) and 5 TFs (Esx1 was omitted from 6 TFs). Unsupervised hierarchical clustering indicated that iNPC is expressing a global transcriptional profile more similar to that of NPCs rather than that of MEFs, and suggested that the TFs present in the pool acted as inducing TFs. iNPCs were induced from MEF using 6 or 5 transcription factors. iNPCs were induced from MEF (MEFSH, derived from mice carrying IRES-Hygro in Sox allele) using retroviral vectors (pMXs-IRESNeo) of 6 or 5 transcription factors. Four weeks after the infection, Hygromycin was added and cultured for 1 week before the harvest. NSBAg2 and NSEB5-2C were used for the data of NPC. GSM396240 and GSM336010 were used for the data of ESC.GSM651349 and GSM336011 were used for the data of MEF.

2011-06-07 | E-GEOD-29724 | biostudies-arrayexpress

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data