A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

Table 2

Correspondence between the original classes and the clusters constructed by the proposed algorithm (with outliers).

	1st cluster; 9 points	2nd cluster; 13 points	3rd cluster; 22 points	Unclustered; 11 points
ST1; 22 points	9 points	1 points	5 points	7 points
ST2; 17 points	0 points	12 points	3 points	2 points
ST3; 16 points	0 points	0 points	14 points	2 points