• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 515
Next 10 →

Príncipe. Spectral clustering of synchronous spike trains

by António R. C. Paiva, Sudhir Rao, Il Park, José C. Príncipe - In Proc. IEEE Int. Joint Conf. on Neural Networks, IJCNN-2007 , 2007
"... Abstract — In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of synchronous neural activity is of high relevance in neurophysiological studies. In this context such activity is tho ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
Abstract — In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of synchronous neural activity is of high relevance in neurophysiological studies. In this context such activity

A Mixture Model for Spike Train Ensemble Analysis Using Spectral Clustering

by Rong Jin, Yasir Suhail - in Proc. of ICASSP , 2006
"... Identifying clusters of neurons with correlated spiking activity in large-size neuronal ensembles recorded with highdensity multielectrode array is an emerging problem in computational neuroscience. We propose a nonparametric approach that represents multiple neural spike trains by a mixed point pro ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Identifying clusters of neurons with correlated spiking activity in large-size neuronal ensembles recorded with highdensity multielectrode array is an emerging problem in computational neuroscience. We propose a nonparametric approach that represents multiple neural spike trains by a mixed point

Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering

by Yoshua Bengio, Jean-François Paiement, Pascal Vincent, Olivier Delalleau, Nicolas Le Roux, Marie Ouimet - In Advances in Neural Information Processing Systems , 2004
"... Several unsupervised learning algorithms based on an eigendecomposition provide either an embedding or a clustering only for given training points, with no straightforward extension for out-of-sample examples short of recomputing eigenvectors. This paper provides a unified framework for extending Lo ..."
Abstract - Cited by 139 (3 self) - Add to MetaCart
Several unsupervised learning algorithms based on an eigendecomposition provide either an embedding or a clustering only for given training points, with no straightforward extension for out-of-sample examples short of recomputing eigenvectors. This paper provides a unified framework for extending

Maximum margin clustering

by Linli Xu, James Neufeld, Bryce Larson, Dale Schuurmans - Advances in Neural Information Processing Systems 17 , 2005
"... We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, we can pose the problem as a convex integer program. Although this still yields a difficult computational problem, the ha ..."
Abstract - Cited by 136 (4 self) - Add to MetaCart
, the hard-clustering constraints can be relaxed to a soft-clustering formulation which can be feasibly solved with a semidefinite program. Since our clustering technique only depends on the data through the kernel matrix, we can easily achieve nonlinear clusterings in the same manner as spectral clustering

Spectral learning

by Sepandar D. Kamvar, Dan Klein, Christopher D. Manning - In IJCAI , 2003
"... We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled examples. In the unsupervised case, it performs consistently with other spectral clustering algorithms. In the supervised case, ..."
Abstract - Cited by 106 (6 self) - Add to MetaCart
We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled examples. In the unsupervised case, it performs consistently with other spectral clustering algorithms. In the supervised case

Statistical Identification of Synchronous Spiking

by Matthew T. Harrison, Asohan Amarasingham, E. Kass
"... 3 Spike trains and firing rate 5 3.1 Point processes, conditional intensities, and firing rates.............. 7 ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
3 Spike trains and firing rate 5 3.1 Point processes, conditional intensities, and firing rates.............. 7

Simultaneous Modeling Of Spectrum, Pitch And Duration In HMM-Based Speech Synthesis

by Takayoshi Yoshimura , Keiichi Tokuda , Takao Kobayashi , Takashi Masuko , Tadashi Kitamura , 1999
"... In this paper, we describe an HMM-based speech synthesis system in which spectrum, pitch and state duration are modeled simultaneously in a unified framework of HMM. In the system, pitch and state duration are modeled by multi-space probability distribution HMMs and multi -dimensional Gaussian distr ..."
Abstract - Cited by 172 (37 self) - Add to MetaCart
distributions, respectively. The distributions for spectral parameter, pitch parameter and the state duration are clustered independently by using a decision-tree based context clustering technique. Synthetic speech is generated by using an speech parameter generation algorithm from HMM and a mel-cepstrum based

Spike train clustering using a Lempel-Ziv distance measure

by unknown authors
"... Abstract—Multi-electrode array recordings reveal com-plex structures in the firing of spatially distributed neurons. The analysis of this neuronal network activity demands a classification of neurons according to similarities in their firing behavior. If similar spike patterns do not occur syn-chron ..."
Abstract - Add to MetaCart
, but have unknown delays within spike trains, this processing step is difficult. To solve this problem, we introduce a Lempel-Ziv complexity-based distance mea-sure. Using our distance measure as the input for a super-paramagnetic clustering algorithm, we achieve an efficient classification of spike trains

Spike train metrics Theoretical background

by Jonathan D Victor
"... Quantifying similarity and dissimilarity of spike trains is an important requisite for understanding neural codes. Spike metrics constitute a class of approaches to this problem. In contrast to most signal-processing methods, spike metrics operate on time series of all-or-none events, and are, thus ..."
Abstract - Add to MetaCart
Quantifying similarity and dissimilarity of spike trains is an important requisite for understanding neural codes. Spike metrics constitute a class of approaches to this problem. In contrast to most signal-processing methods, spike metrics operate on time series of all-or-none events, and are

Temporal structure in neuronal activity during working memory in macaque parietal cortex,”

by Bijan Pesaran , John S Pezaris , Maneesh Sahani , Partha P Mitra , Richard A Andersen - Nature Neuroscience, , 2002
"... The neural basis of working memory is typically studied in non-human primates by recording activity during delayed response tasks 1 . Cue-selective elevations in mean firing rates are found during the delay period in many brain areas using different versions of these tasks Temporally correlated ne ..."
Abstract - Cited by 145 (6 self) - Add to MetaCart
from area LIP in two awake macaques during a memory-saccade task. Using spectral analysis, we found spatially tuned elevated power in the gamma band (25-90 Hz) in LFP and spiking activity during the memory period. Spiking and LFP activity were also coherent in the gamma band but not at lower
Next 10 →
Results 1 - 10 of 515
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University