8,146 research outputs found
An algebraic approach to ensemble clustering
International audienceIn clustering, consensus clustering aims at providing a single partition fitting a consensus from a set of independently generated. Common procedures, which are mainly statistical and graph-based, are recognized for their robustness and ability to scale-up. In this paper, we provide a complementary and original viewpoint over consensus clustering, by means of algebraic definitions which allow to ascertain the nature of available inferences in a systematic approach (e.g. a knowledge base). We found our approach on the lattice of partitions, for which we shall disclose how some operators can be added with the aim to express a formula representing the consensus. We show that adopting an incremental approach may assist to retain significant amount of aggregate data which fits well with the set of input clusterings. Beyond that ability to model formulae, we also note that its potential cannot be easily captured through such a logical system. It is due to the volatile nature of handling partitions which finally impacts on ability to draw some valuable conclusions
Partitioning Complex Networks via Size-constrained Clustering
The most commonly used method to tackle the graph partitioning problem in
practice is the multilevel approach. During a coarsening phase, a multilevel
graph partitioning algorithm reduces the graph size by iteratively contracting
nodes and edges until the graph is small enough to be partitioned by some other
algorithm. A partition of the input graph is then constructed by successively
transferring the solution to the next finer graph and applying a local search
algorithm to improve the current solution.
In this paper, we describe a novel approach to partition graphs effectively
especially if the networks have a highly irregular structure. More precisely,
our algorithm provides graph coarsening by iteratively contracting
size-constrained clusterings that are computed using a label propagation
algorithm. The same algorithm that provides the size-constrained clusterings
can also be used during uncoarsening as a fast and simple local search
algorithm.
Depending on the algorithm's configuration, we are able to compute partitions
of very high quality outperforming all competitors, or partitions that are
comparable to the best competitor in terms of quality, hMetis, while being
nearly an order of magnitude faster on average. The fastest configuration
partitions the largest graph available to us with 3.3 billion edges using a
single machine in about ten minutes while cutting less than half of the edges
than the fastest competitor, kMetis
Structural Properties of the Caenorhabditis elegans Neuronal Network
Despite recent interest in reconstructing neuronal networks, complete wiring
diagrams on the level of individual synapses remain scarce and the insights
into function they can provide remain unclear. Even for Caenorhabditis elegans,
whose neuronal network is relatively small and stereotypical from animal to
animal, published wiring diagrams are neither accurate nor complete and
self-consistent. Using materials from White et al. and new electron micrographs
we assemble whole, self-consistent gap junction and chemical synapse networks
of hermaphrodite C. elegans. We propose a method to visualize the wiring
diagram, which reflects network signal flow. We calculate statistical and
topological properties of the network, such as degree distributions, synaptic
multiplicities, and small-world properties, that help in understanding network
signal propagation. We identify neurons that may play central roles in
information processing and network motifs that could serve as functional
modules of the network. We explore propagation of neuronal activity in response
to sensory or artificial stimulation using linear systems theory and find
several activity patterns that could serve as substrates of previously
described behaviors. Finally, we analyze the interaction between the gap
junction and the chemical synapse networks. Since several statistical
properties of the C. elegans network, such as multiplicity and motif
distributions are similar to those found in mammalian neocortex, they likely
point to general principles of neuronal networks. The wiring diagram reported
here can help in understanding the mechanistic basis of behavior by generating
predictions about future experiments involving genetic perturbations, laser
ablations, or monitoring propagation of neuronal activity in response to
stimulation
- …