An efficient algorithm for computing the distance between close partitions期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

An efficient algorithm for computing the distance between close partitions

Authors:	Daniel Cosmin Porumbel Jin Kao Hao

Institution:	^a Univ. Lille-Nord de France, UArtois, LGI2A, Technoparc Futura 62400, Béthune, France ^b LERIA, Université d’Angers, 2 Bd Lavoisier, 49045 Angers, France ^c LINA, Polytech’Nantes, rue Christian Pauc, 44306 Nantes, France

Abstract:

Keywords:	Partition distance Partition metric Similarity between partitions Clustering comparison Similarity measure
本文献已被 ScienceDirect 等数据库收录！