5,373 research outputs found
One-class classifiers based on entropic spanning graphs
One-class classifiers offer valuable tools to assess the presence of outliers
in data. In this paper, we propose a design methodology for one-class
classifiers based on entropic spanning graphs. Our approach takes into account
the possibility to process also non-numeric data by means of an embedding
procedure. The spanning graph is learned on the embedded input data and the
outcoming partition of vertices defines the classifier. The final partition is
derived by exploiting a criterion based on mutual information minimization.
Here, we compute the mutual information by using a convenient formulation
provided in terms of the -Jensen difference. Once training is
completed, in order to associate a confidence level with the classifier
decision, a graph-based fuzzy model is constructed. The fuzzification process
is based only on topological information of the vertices of the entropic
spanning graph. As such, the proposed one-class classifier is suitable also for
data characterized by complex geometric structures. We provide experiments on
well-known benchmarks containing both feature vectors and labeled graphs. In
addition, we apply the method to the protein solubility recognition problem by
considering several representations for the input samples. Experimental results
demonstrate the effectiveness and versatility of the proposed method with
respect to other state-of-the-art approaches.Comment: Extended and revised version of the paper "One-Class Classification
Through Mutual Information Minimization" presented at the 2016 IEEE IJCNN,
Vancouver, Canad
Measuring spike train synchrony
Estimating the degree of synchrony or reliability between two or more spike
trains is a frequent task in both experimental and computational neuroscience.
In recent years, many different methods have been proposed that typically
compare the timing of spikes on a certain time scale to be fixed beforehand.
Here, we propose the ISI-distance, a simple complementary approach that
extracts information from the interspike intervals by evaluating the ratio of
the instantaneous frequencies. The method is parameter free, time scale
independent and easy to visualize as illustrated by an application to real
neuronal spike trains obtained in vitro from rat slices. In a comparison with
existing approaches on spike trains extracted from a simulated Hindemarsh-Rose
network, the ISI-distance performs as well as the best time-scale-optimized
measure based on spike timing.Comment: 11 pages, 13 figures; v2: minor modifications; v3: minor
modifications, added link to webpage that includes the Matlab Source Code for
the method (http://inls.ucsd.edu/~kreuz/Source-Code/Spike-Sync.html
'Part'ly first among equals: Semantic part-based benchmarking for state-of-the-art object recognition systems
An examination of object recognition challenge leaderboards (ILSVRC,
PASCAL-VOC) reveals that the top-performing classifiers typically exhibit small
differences amongst themselves in terms of error rate/mAP. To better
differentiate the top performers, additional criteria are required. Moreover,
the (test) images, on which the performance scores are based, predominantly
contain fully visible objects. Therefore, `harder' test images, mimicking the
challenging conditions (e.g. occlusion) in which humans routinely recognize
objects, need to be utilized for benchmarking. To address the concerns
mentioned above, we make two contributions. First, we systematically vary the
level of local object-part content, global detail and spatial context in images
from PASCAL VOC 2010 to create a new benchmarking dataset dubbed PPSS-12.
Second, we propose an object-part based benchmarking procedure which quantifies
classifiers' robustness to a range of visibility and contextual settings. The
benchmarking procedure relies on a semantic similarity measure that naturally
addresses potential semantic granularity differences between the category
labels in training and test datasets, thus eliminating manual mapping. We use
our procedure on the PPSS-12 dataset to benchmark top-performing classifiers
trained on the ILSVRC-2012 dataset. Our results show that the proposed
benchmarking procedure enables additional differentiation among
state-of-the-art object classifiers in terms of their ability to handle missing
content and insufficient object detail. Given this capability for additional
differentiation, our approach can potentially supplement existing benchmarking
procedures used in object recognition challenge leaderboards.Comment: Extended version of our ACCV-2016 paper. Author formatting modifie
Cell assembly dynamics of sparsely-connected inhibitory networks: a simple model for the collective activity of striatal projection neurons
Striatal projection neurons form a sparsely-connected inhibitory network, and
this arrangement may be essential for the appropriate temporal organization of
behavior. Here we show that a simplified, sparse inhibitory network of
Leaky-Integrate-and-Fire neurons can reproduce some key features of striatal
population activity, as observed in brain slices [Carrillo-Reid et al., J.
Neurophysiology 99 (2008) 1435{1450]. In particular we develop a new metric to
determine the conditions under which sparse inhibitory networks form
anti-correlated cell assemblies with time-varying activity of individual cells.
We found that under these conditions the network displays an input-specific
sequence of cell assembly switching, that effectively discriminates similar
inputs. Our results support the proposal [Ponzi and Wickens, PLoS Comp Biol 9
(2013) e1002954] that GABAergic connections between striatal projection neurons
allow stimulus-selective, temporally-extended sequential activation of cell
assemblies. Furthermore, we help to show how altered intrastriatal GABAergic
signaling may produce aberrant network-level information processing in
disorders such as Parkinson's and Huntington's diseases.Comment: 22 pages, 9 figure
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (Extended Version)
Although the ``scale-free'' literature is large and growing, it gives neither
a precise definition of scale-free graphs nor rigorous proofs of many of their
claimed properties. In fact, it is easily shown that the existing theory has
many inherent contradictions and verifiably false claims. In this paper, we
propose a new, mathematically precise, and structural definition of the extent
to which a graph is scale-free, and prove a series of results that recover many
of the claimed properties while suggesting the potential for a rich and
interesting theory. With this definition, scale-free (or its opposite,
scale-rich) is closely related to other structural graph properties such as
various notions of self-similarity (or respectively, self-dissimilarity).
Scale-free graphs are also shown to be the likely outcome of random
construction processes, consistent with the heuristic definitions implicit in
existing random graph approaches. Our approach clarifies much of the confusion
surrounding the sensational qualitative claims in the scale-free literature,
and offers rigorous and quantitative alternatives.Comment: 44 pages, 16 figures. The primary version is to appear in Internet
Mathematics (2005
- …