Conference item icon

Conference item

Clustering redemption–beyond the impossibility of Kleinberg’s axioms

Abstract:

Kleinberg (2002) stated three axioms that any clustering procedure should satisfy and showed there is no clustering procedure that simultaneously satisfies all three. One of these, called the consistency axiom, requires that when the data is modified in a helpful way, i.e. if points in the same cluster are made more similar and those in different ones made less similar, the algorithm should output the same clustering. To circumvent this impossibility result, research has focused on considerin...

Expand abstract
Publication status:
Accepted
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:

Authors


Cohen-Addad, V More by this author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Mallmann-Trenn, F More by this author
Publisher:
Neural Information Processing Systems Foundation Publisher's website
Acceptance date:
2018-09-04
Pubs id:
pubs:920367
URN:
uri:77268a5c-2b63-462b-b847-712c84beafc3
UUID:
uuid:77268a5c-2b63-462b-b847-712c84beafc3
Local pid:
pubs:920367

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP