An efficient algorithm for computing the distance between close partitions (Q617900): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Daniel Cosmin Porumbel / rank
Normal rank
 
Property / author
 
Property / author: Daniel Cosmin Porumbel / 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.dam.2010.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109950620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing an optimal consensus clustering from multiple clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum transfer distance between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5318347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing metric distances between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfer distance between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition-distance: A problem and class of perfect graphs arising in clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-time dynamic storage allocator for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339952 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:11, 3 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for computing the distance between close partitions
scientific article

    Statements

    An efficient algorithm for computing the distance between close partitions (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2011
    0 references
    0 references
    partition distance
    0 references
    partition metric
    0 references
    similarity between partitions
    0 references
    clustering comparison
    0 references
    similarity measure
    0 references
    0 references