P. Cénac

activity

20082016

most citedA fast and recursive algorithm for clustering large datasets with

k

-medians

6 citations · 7 across the 5 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.PR2011

Uncommon Suffix Tries

Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut +1

Common assumptions on the source producing the words inserted in a suffix trie with $n$ leaves lead to a $lo g n$ height and saturation level. We provide an example of a suffix tri…

stat.CO2011★ 6 cited

A fast and recursive algorithm for clustering large datasets with $k$ -medians

Hervé Cardot, Peggy Cénac, Jean-Marie Monnez

Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a…

Uncommon Suffix Tries

A fast and recursive algorithm for clustering large datasets with k-medians

A fast and recursive algorithm for clustering large datasets with $k$ -medians