@prefix epid: .
@prefix dc: .
@prefix geo: .
@prefix bibo: .
@prefix epx: .
@prefix owl: .
@prefix void: .
@prefix event: .
@prefix skos: .
@prefix xsd: .
@prefix cc: .
@prefix ep: .
@prefix foaf: .
@prefix rdf: .
@prefix rdfs: .
@prefix eprel: .
@prefix dct: .
<>
foaf:primaryTopic ;
rdfs:comment "The repository administrator has not yet configured an RDF license."^^xsd:string .
rdfs:label "Berkes2005a-preprint.pdf"^^xsd:string .
rdfs:label "Berkes2005a-preprint.ps"^^xsd:string .
rdfs:label "preview.png"^^xsd:string .
rdfs:label "preview.png"^^xsd:string .
rdfs:label "indexcodes.txt"^^xsd:string .
dc:format "text/html";
dc:title "HTML Summary of #4104 \n\nPattern Recognition with Slow Feature Analysis\n\n";
foaf:primaryTopic .
dct:hasPart ;
ep:hasFile ;
eprel:hasIndexCodesVersion ;
eprel:hasVersion ,
;
eprel:hasVolatileVersion ,
;
eprel:haspreviewThumbnailVersion ;
rdf:type bibo:Document,
ep:Document;
rdfs:label "Pattern Recognition with Slow Feature Analysis (PDF)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:hasVersion ;
eprel:hasVolatileVersion ;
eprel:haspreviewThumbnailVersion ;
rdf:type bibo:Document,
ep:Document;
rdfs:label "Pattern Recognition with Slow Feature Analysis (Postscript)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:ispreviewThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "Pattern Recognition with Slow Feature Analysis (Image (PNG))"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:ispreviewThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "Pattern Recognition with Slow Feature Analysis (Image (PNG))"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isIndexCodesVersionOf ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
rdf:type ep:Document;
rdfs:label "Pattern Recognition with Slow Feature Analysis (Indexer Terms)"^^xsd:string .
rdf:_1 .
bibo:abstract "Slow feature analysis (SFA) is a new unsupervised algorithm to learn nonlinear functions that extract slowly varying signals out of the input data. In this paper we describe its application to pattern recognition. In this context in order to be slowly varying the functions learned by SFA need to respond similarly to the patterns belonging to the same class. We prove that, given input patterns belonging to C non-overlapping classes and a large enough function space, the optimal solution consists of C-1 output signals that are constant for each individual class. As a consequence, their output provides a feature space suitable to perform classification with simple methods, such as Gaussian classifiers. We then show as an example the application of SFA to the MNIST handwritten digits database. The performance of SFA is comparable to that of other established algorithms. Finally, we suggest some possible extensions to the proposed method. Our approach is in particular attractive because for a given input signal and a fixed function space it has no parameters, it is easy to implement and apply, and it has low memory requirements and high speed during recognition. SFA finds the global solution (within the considered function space) in a single iteration without convergence issues. Moreover, the proposed method is completely problem-independent.\n"^^xsd:string;
bibo:authorList ;
bibo:status ;
dct:creator ;
dct:date "2005-02";
dct:isPartOf ;
dct:subject ,
,
;
dct:title "Pattern Recognition with Slow Feature Analysis"^^xsd:string;
ep:hasDocument ,
,
,
,
;
rdf:type bibo:Article,
ep:EPrint,
ep:PreprintEPrint;
rdfs:seeAlso .
rdf:type skos:Concept;
skos:prefLabel "Computational Neuroscience" .
rdf:type skos:Concept;
skos:prefLabel "Machine Learning" .
rdf:type skos:Concept;
skos:prefLabel "Neural Nets" .
foaf:familyName "Berkes"^^xsd:string;
foaf:givenName "Pietro"^^xsd:string;
foaf:name "Pietro Berkes"^^xsd:string;
rdf:type foaf:Person .