The relative neighborhood graph for mixed feature variables (Q1057662): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/0031-3203(85)90040-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069345916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonparametric Multiclass Pattern Classifier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient worst-case data structures for range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Trained Piecewise Linear Classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Some Graph Theoretical Cluster Techniques / rank
 
Normal rank

Latest revision as of 17:35, 14 June 2024

scientific article
Language Label Description Also known as
English
The relative neighborhood graph for mixed feature variables
scientific article

    Statements

    The relative neighborhood graph for mixed feature variables (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Given a set of finite dimensional feature vectors (datapoints), the relative neighborhood graph (RNG) defined on this set connects relatively close neighbors. The RNG proves itself an efficient tool for analyzing the clustering of multidimensional feature vectors when all features are quantitative. In this paper, the rectangular influence graph (RIG) is presented as an extension of the RNG to sets of multidimensional feature vectors composed of mixed (quantitative as well as qualitative) feature variables. It is shown that the RIG is a superset of the Gabriel graph with respect to any Minkowski metric. The interclass RIG and the mutual neighborhood graph (MNG) are presented as tools to analyze interclass structures. These graphs can be used to reduce the training set in the design of piecewise linear classifiers. The MNG leads also to a sufficient condition for the linear separability between classes.
    0 references
    0 references
    pattern recognition
    0 references
    feature vectors
    0 references
    relative neighborhood graph
    0 references
    clustering
    0 references
    rectangular influence graph
    0 references
    Gabriel graph
    0 references
    Minkowski metric
    0 references
    mutual neighborhood graph
    0 references
    interclass structures
    0 references
    design of piecewise linear classifiers
    0 references
    linear separability
    0 references
    0 references