Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters (Q1017654): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122218279 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0912.3408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based estimator of the number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial methods in density estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of Single Linkage for High-Density Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Identification in Nearest-Neighbor Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330303 / rank
 
Normal rank

Latest revision as of 14:12, 1 July 2024

scientific article
Language Label Description Also known as
English
Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
scientific article

    Statements

    Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    clustering
    0 references
    neighborhood graph
    0 references
    random geometric graph
    0 references
    connected component
    0 references
    0 references
    0 references