A survey on nature inspired metaheuristic algorithms for partitional clustering
The partitional clustering concept started with K-means algorithm which was published in
1957. Since then many classical partitional clustering algorithms have been reported based …
1957. Since then many classical partitional clustering algorithms have been reported based …
On the analysis and interpretation of correlations in metabolomic data
R Steuer - Briefings in bioinformatics, 2006 - academic.oup.com
A remarkable inherent feature of cellular metabolism is that the concentrations of a small but
significant number of metabolites are strongly correlated when measurements of biological …
significant number of metabolites are strongly correlated when measurements of biological …
Data clustering: 50 years beyond K-means
AK Jain - Pattern recognition letters, 2010 - Elsevier
Organizing data into sensible groupings is one of the most fundamental modes of
understanding and learning. As an example, a common scheme of scientific classification …
understanding and learning. As an example, a common scheme of scientific classification …
[HTML][HTML] A lentiviral RNAi library for human and mouse genes applied to an arrayed viral high-content screen
To enable arrayed or pooled loss-of-function screens in a wide range of mammalian cell
types, including primary and nondividing cells, we are developing lentiviral short hairpin …
types, including primary and nondividing cells, we are developing lentiviral short hairpin …
Reverse engineering of regulatory networks in human B cells
K Basso, AA Margolin, G Stolovitzky, U Klein… - Nature …, 2005 - nature.com
Cellular phenotypes are determined by the differential activity of networks linking
coregulated genes. Available methods for the reverse engineering of such networks from …
coregulated genes. Available methods for the reverse engineering of such networks from …
An efficient k-means clustering filtering algorithm using density based initial cluster centers
KM Kumar, ARM Reddy - Information Sciences, 2017 - Elsevier
Abstract k-means is a preeminent partitional based clustering method that finds k clusters
from the given dataset by computing distances from each point to k cluster centers iteratively …
from the given dataset by computing distances from each point to k cluster centers iteratively …
[图书][B] Pattern discovery in bioinformatics: theory & algorithms
L Parida - 2007 - taylorfrancis.com
The computational methods of bioinformatics are being used more and more to process the
large volume of current biological data. Promoting an understanding of the underlying …
large volume of current biological data. Promoting an understanding of the underlying …
Network analysis of human glaucomatous optic nerve head astrocytes
T Nikolskaya, Y Nikolsky, T Serebryiskaya… - BMC medical …, 2009 - Springer
Background Astrocyte activation is a characteristic response to injury in the central nervous
system, and can be either neurotoxic or neuroprotective, while the regulation of both roles …
system, and can be either neurotoxic or neuroprotective, while the regulation of both roles …
Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning
Probabilistic logical rule learning has shown great strength in logical rule mining and
knowledge graph completion. It learns logical rules to predict missing edges by reasoning …
knowledge graph completion. It learns logical rules to predict missing edges by reasoning …
Structure learning of probabilistic graphical models: a comprehensive survey
Y Zhou - arXiv preprint arXiv:1111.6925, 2011 - arxiv.org
Probabilistic graphical models combine the graph theory and probability theory to give a
multivariate statistical modeling. They provide a unified description of uncertainty using …
multivariate statistical modeling. They provide a unified description of uncertainty using …