Adaptive density-based clustering algorithm with shared KNN conflict game (Q6086287): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ins.2021.02.017 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2021.02.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3133223208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Passing Messages Between Data Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECM: An evidential version of the fuzzy \(c\)-means algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: CECM: constrained evidential \(C\)-means algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cure: An efficient clustering algorithm for large databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2021.02.017 / rank
 
Normal rank

Latest revision as of 08:55, 31 December 2024

scientific article; zbMATH DE number 7763304
Language Label Description Also known as
English
Adaptive density-based clustering algorithm with shared KNN conflict game
scientific article; zbMATH DE number 7763304

    Statements

    Adaptive density-based clustering algorithm with shared KNN conflict game (English)
    0 references
    9 November 2023
    0 references
    density peak clustering
    0 references
    DBSCAN
    0 references
    shared k-nearest-neighbour
    0 references
    conflict game
    0 references

    Identifiers