Neighborhood Property–Based Pattern Selection for Support Vector Machines (Q3591521): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q45965495, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning changing concepts by exploiting the structure of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast nearest neighbor search of entropy-constrained vector quantization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible direction decomposition algorithms for training support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal distance measure for nearest neighbor classification / rank
 
Normal rank

Latest revision as of 14:18, 26 June 2024

scientific article
Language Label Description Also known as
English
Neighborhood Property–Based Pattern Selection for Support Vector Machines
scientific article

    Statements

    Identifiers