Expected-time complexity results for hierarchic clustering algorithms which use cluster centres

F. Murtagh

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	237-241
Number of pages	5
Journal	Information Processing Letters
Volume	16
Issue number	5
DOIs	https://doi.org/10.1016/0020-0190(83)90095-9
Publication status	Published - 10 Jun 1983
Externally published	Yes

Access to Document

@article{5ba906f4ceab408f9c0bbd6b2c12017a,

title = "Expected-time complexity results for hierarchic clustering algorithms which use cluster centres",

keywords = "dynamic searching, nearest neighbours, Probabilistic algorithms",

author = "F. Murtagh",

year = "1983",

month = jun,

day = "10",

doi = "10.1016/0020-0190(83)90095-9",

language = "English",

volume = "16",

pages = "237--241",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Expected-time complexity results for hierarchic clustering algorithms which use cluster centres

AU - Murtagh, F.

PY - 1983/6/10

Y1 - 1983/6/10

KW - dynamic searching

KW - nearest neighbours

KW - Probabilistic algorithms

UR - http://www.scopus.com/inward/record.url?scp=0020765701&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(83)90095-9

DO - 10.1016/0020-0190(83)90095-9

M3 - Article

AN - SCOPUS:0020765701

VL - 16

SP - 237

EP - 241

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 5

ER -