The van Rossum metric measures the distance between two spike trains. Measuring a single van Rossum distance between one pair of spike trains is not a computationally expensive task, however, many applications require a matrix of distances between all the spike trains in a set or the calculation of a multi-neuron distance between two populations of spike trains. Moreover, often these calculations need to be repeated for many different parameter values. An algorithm is presented here to render these calculation less computationally expensive, making the complexity linear in the number of spikes rather than quadratic.
On the efficient calculation of van Rossum distances
Thomas Kreuz
2012
Abstract
The van Rossum metric measures the distance between two spike trains. Measuring a single van Rossum distance between one pair of spike trains is not a computationally expensive task, however, many applications require a matrix of distances between all the spike trains in a set or the calculation of a multi-neuron distance between two populations of spike trains. Moreover, often these calculations need to be repeated for many different parameter values. An algorithm is presented here to render these calculation less computationally expensive, making the complexity linear in the number of spikes rather than quadratic.| Campo DC | Valore | Lingua |
|---|---|---|
| dc.authority.ancejournal | NETWORK | en |
| dc.authority.orgunit | Istituto dei Sistemi Complessi - ISC | en |
| dc.authority.people | Conor Houghton | en |
| dc.authority.people | Thomas Kreuz | en |
| dc.collection.id.s | b3f88f24-048a-4e43-8ab1-6697b90e068e | * |
| dc.collection.name | 01.01 Articolo in rivista | * |
| dc.contributor.appartenenza | Istituto dei Sistemi Complessi - ISC | * |
| dc.contributor.appartenenza.mi | 1036 | * |
| dc.date.accessioned | 2024/02/16 03:50:18 | - |
| dc.date.available | 2024/02/16 03:50:18 | - |
| dc.date.issued | 2012 | - |
| dc.description.abstracteng | The van Rossum metric measures the distance between two spike trains. Measuring a single van Rossum distance between one pair of spike trains is not a computationally expensive task, however, many applications require a matrix of distances between all the spike trains in a set or the calculation of a multi-neuron distance between two populations of spike trains. Moreover, often these calculations need to be repeated for many different parameter values. An algorithm is presented here to render these calculation less computationally expensive, making the complexity linear in the number of spikes rather than quadratic. | - |
| dc.description.affiliations | 1) School of Mathematics, Trinity College Dublin, Ireland; 2) Department of Computer Science, University of Bristol, England; 3) Institute for complex systems - CNR, Sesto Fiorentino, Italy | - |
| dc.description.allpeople | Houghton, Conor; Kreuz, Thomas | - |
| dc.description.allpeopleoriginal | Conor Houghton; Thomas Kreuz | en |
| dc.description.fulltext | open | en |
| dc.description.numberofauthors | 2 | - |
| dc.identifier.doi | 10.3109/0954898X.2012.673048 | en |
| dc.identifier.isi | WOS:000304800300003 | en |
| dc.identifier.scopus | 2-s2.0-84861849096 | en |
| dc.identifier.uri | https://hdl.handle.net/20.500.14243/238195 | - |
| dc.identifier.url | http://informahealthcare.com/doi/abs/10.3109/0954898X.2012.673048 | en |
| dc.language.iso | eng | en |
| dc.relation.firstpage | 48 | en |
| dc.relation.issue | 1-2 | en |
| dc.relation.lastpage | 58 | en |
| dc.relation.numberofpages | 11 | en |
| dc.relation.volume | 23 | en |
| dc.subject.keywords | Spiking neurons | - |
| dc.subject.keywords | information theory | - |
| dc.subject.keywords | auditory system | - |
| dc.subject.singlekeyword | Spiking neurons | * |
| dc.subject.singlekeyword | information theory | * |
| dc.subject.singlekeyword | auditory system | * |
| dc.title | On the efficient calculation of van Rossum distances | en |
| dc.type.driver | info:eu-repo/semantics/article | - |
| dc.type.full | 01 Contributo su Rivista::01.01 Articolo in rivista | it |
| dc.type.miur | 262 | - |
| dc.type.referee | Sì, ma tipo non specificato | en |
| dc.ugov.descaux1 | 194198 | - |
| iris.isi.extIssued | 2012 | - |
| iris.isi.extTitle | On the efficient calculation of van Rossum distances | - |
| iris.mediafilter.data | 2025/04/04 04:14:30 | * |
| iris.orcid.lastModifiedDate | 2024/06/14 08:31:14 | * |
| iris.orcid.lastModifiedMillisecond | 1718346674379 | * |
| iris.scopus.extIssued | 2012 | - |
| iris.scopus.extTitle | On the efficient calculation of van Rossum distances | - |
| iris.sitodocente.maxattempts | 3 | - |
| iris.unpaywall.doi | 10.3109/0954898x.2012.673048 | * |
| iris.unpaywall.isoa | false | * |
| iris.unpaywall.journalisindoaj | false | * |
| iris.unpaywall.metadataCallLastModified | 17/04/2026 05:18:22 | - |
| iris.unpaywall.metadataCallLastModifiedMillisecond | 1776395902476 | - |
| iris.unpaywall.oastatus | closed | * |
| isi.authority.ancejournal | NETWORK###0954-898X | * |
| isi.category | RU | * |
| isi.category | IQ | * |
| isi.category | EP | * |
| isi.contributor.affiliation | Trinity College Dublin | - |
| isi.contributor.affiliation | Consiglio Nazionale delle Ricerche (CNR) | - |
| isi.contributor.country | Ireland | - |
| isi.contributor.country | Italy | - |
| isi.contributor.name | Conor | - |
| isi.contributor.name | Thomas | - |
| isi.contributor.researcherId | DYH-2122-2022 | - |
| isi.contributor.researcherId | B-8435-2015 | - |
| isi.contributor.subaffiliation | Sch Math | - |
| isi.contributor.subaffiliation | - | |
| isi.contributor.surname | Houghton | - |
| isi.contributor.surname | Kreuz | - |
| isi.date.issued | 2012 | * |
| isi.description.abstracteng | The van Rossum metric measures the distance between two spike trains. Measuring a single van Rossum distance between one pair of spike trains is not a computationally expensive task, however, many applications require a matrix of distances between all the spike trains in a set or the calculation of a multi-neuron distance between two populations of spike trains. Moreover, often these calculations need to be repeated for many different parameter values. An algorithm is presented here to render these calculation less computationally expensive, making the complexity linear in the number of spikes rather than quadratic. | * |
| isi.description.allpeopleoriginal | Houghton, C; Kreuz, T; | * |
| isi.document.sourcetype | WOS.SCI | * |
| isi.document.type | Article | * |
| isi.document.types | Article | * |
| isi.identifier.doi | 10.3109/0954898X.2012.673048 | * |
| isi.identifier.isi | WOS:000304800300003 | * |
| isi.journal.journaltitle | NETWORK-COMPUTATION IN NEURAL SYSTEMS | * |
| isi.journal.journaltitleabbrev | NETWORK-COMP NEURAL | * |
| isi.language.original | English | * |
| isi.publisher.place | 52 VANDERBILT AVE, NEW YORK, NY 10017 USA | * |
| isi.relation.firstpage | 48 | * |
| isi.relation.issue | 1-2 | * |
| isi.relation.lastpage | 58 | * |
| isi.relation.volume | 23 | * |
| isi.title | On the efficient calculation of van Rossum distances | * |
| scopus.authority.ancejournal | NETWORK###0954-898X | * |
| scopus.category | 2801 | * |
| scopus.contributor.affiliation | University of Bristol | - |
| scopus.contributor.affiliation | Institute for Complex Systems-CNR | - |
| scopus.contributor.afid | 60020650 | - |
| scopus.contributor.afid | 112863847 | - |
| scopus.contributor.auid | 7004388816 | - |
| scopus.contributor.auid | 6603800934 | - |
| scopus.contributor.country | United Kingdom | - |
| scopus.contributor.country | Italy | - |
| scopus.contributor.dptid | 109833277 | - |
| scopus.contributor.dptid | - | |
| scopus.contributor.name | Conor | - |
| scopus.contributor.name | Thomas | - |
| scopus.contributor.subaffiliation | Department of Computer Science; | - |
| scopus.contributor.subaffiliation | - | |
| scopus.contributor.surname | Houghton | - |
| scopus.contributor.surname | Kreuz | - |
| scopus.date.issued | 2012 | * |
| scopus.description.abstracteng | The van Rossum metric measures the distance between two spike trains. Measuring a single van Rossum distance between one pair of spike trains is not a computationally expensive task, however, many applications require a matrix of distances between all the spike trains in a set or the calculation of a multi-neuron distance between two populations of spike trains. Moreover, often these calculations need to be repeated for many different parameter values. An algorithm is presented here to render these calculation less computationally expensive, making the complexity linear in the number of spikes rather than quadratic. © 2012 Informa Healthcare Ltd. | * |
| scopus.description.allpeopleoriginal | Houghton C.; Kreuz T. | * |
| scopus.differences | scopus.subject.keywords | * |
| scopus.differences | scopus.description.allpeopleoriginal | * |
| scopus.differences | scopus.description.abstracteng | * |
| scopus.document.type | ar | * |
| scopus.document.types | ar | * |
| scopus.funding.funders | 100000913 - James S. McDonnell Foundation; | * |
| scopus.identifier.doi | 10.3109/0954898X.2012.673048 | * |
| scopus.identifier.eissn | 1361-6536 | * |
| scopus.identifier.pmid | 22568695 | * |
| scopus.identifier.pui | 364949209 | * |
| scopus.identifier.scopus | 2-s2.0-84861849096 | * |
| scopus.journal.sourceid | 27318 | * |
| scopus.language.iso | eng | * |
| scopus.relation.firstpage | 48 | * |
| scopus.relation.issue | 1-2 | * |
| scopus.relation.lastpage | 58 | * |
| scopus.relation.volume | 23 | * |
| scopus.subject.keywords | Auditory system; Information theory; Spiking neurons; | * |
| scopus.title | On the efficient calculation of van Rossum distances | * |
| scopus.titleeng | On the efficient calculation of van Rossum distances | * |
| Appare nelle tipologie: | 01.01 Articolo in rivista | |
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_194198-doc_41950.pdf
accesso aperto
Descrizione: Articolo preprint
Tipologia:
Versione Editoriale (PDF)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
102.56 kB
Formato
Adobe PDF
|
102.56 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
