Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: José Francisco Martínez-Trinidad / rank
Normal rank
 
Property / author
 
Property / author: José Francisco Martínez-Trinidad / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2009.08.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044931470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest neighbor pattern classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and versatile algorithm for nearest neighbor search based on a lower bound tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Space Reductions for Nearest-Neighbor Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm Finding Nearest Neighbor Using Kd-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dissimilarity Representation for Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiscale clustering and manifold identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the information and representation of non-Euclidean pairwise data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors / rank
 
Normal rank
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: On the Least Cost for Proximity Searching in Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data Structure and an Algorithm for the Nearest Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some approaches to improve tree-based nearest neighbour search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCA-based branch and bound search algorithms for computing K nearest neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction techniques for instance-based learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386961 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:47, 2 July 2024

scientific article
Language Label Description Also known as
English
Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
scientific article

    Statements

    Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (English)
    0 references
    15 January 2010
    0 references
    0 references
    nearest neighbor rule
    0 references
    fast \(k\) nearest neighbor search
    0 references
    mixed data
    0 references
    non-metric comparison functions
    0 references
    0 references
    0 references