id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cet-4972		cet-4972		6	.pdf	application/pdf	3870	144	42	The number M of clusters of final ensemble clustering is selected according to the values of Silhouette for different numbers of clusters Ccandidate that span the interval [2,16], where the lower bound (2) is the minimum number of base clusters (see Table 1), whereas the upper bound (16) is the number of the largest combination of the three base clusters (i.e., 2x2x4): the optimum number of clusters C* in the final ensemble clustering is the value at which the Silhouette value is maximized, i.e., C* =6 (star in Figure 4 (left)). Vega-Pons S., Ruiz-Shulcloper J., 2011, A survey of clustering ensemble algorithms, International Journal of Pattern Recognition and Artificial Intelligence, 25(03), 337-372.	cache/cet-4972.pdf	txt/cet-4972.txt