An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers (Q780930): 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 / describes a project that uses
 
Property / describes a project that uses: k-means++ / 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.ins.2017.07.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2740426009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / 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: Q3969900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast minimum spanning tree algorithm based on \(K\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4271995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement of the \(k\)-means clustering filtering algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of a simple <i>k</i> -means clustering algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point clustering via voting maximization / rank
 
Normal rank

Latest revision as of 02:26, 23 July 2024

scientific article
Language Label Description Also known as
English
An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
scientific article

    Statements

    An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers (English)
    0 references
    0 references
    0 references
    16 July 2020
    0 references
    \(k\)-means clustering
    0 references
    \(kd\)-tree
    0 references
    initial cluster centers
    0 references
    knowledge discovery
    0 references

    Identifiers