2008
DOI: 10.1007/978-3-540-85984-0_73
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Spike Sorting Method Based on Semi-supervised Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Spike sorting algorithms can learn supervised [40,41], semi-supervised [42,43], and unsupervised [19,44,45]. Most unsupervised approaches cannot compete with supervised algorithms in their performance and many still need manual interventions.…”
Section: Limited Prior Informationmentioning
confidence: 99%
“…Spike sorting algorithms can learn supervised [40,41], semi-supervised [42,43], and unsupervised [19,44,45]. Most unsupervised approaches cannot compete with supervised algorithms in their performance and many still need manual interventions.…”
Section: Limited Prior Informationmentioning
confidence: 99%
“…To obtain action potentials of each neuron, spikes have to be classified by some techniques. Wen et al [6] proposed a semi-supervised spike sorting framework with three learning components working cooperatively. Yang et al [7] presented a spike sorting method using a simplified feature set with a nonparametric.…”
Section: Introductionmentioning
confidence: 99%