An ideal similarity matrix, shown i

An ideal similarity matrix, shown in Figure 1(b), is characterized by ranges of off-blockdiagonal
similarity values [↵s,#s] for each cluster Cs such that if x 2 Cs·L and y 2 Cs·R
then ↵s  Axy  #s. Additionally, min{↵s·R,↵s·L} > #s.

Results (Indonesian) 1:

Matriks ideal kesamaan, ditunjukkan dalam gambar 1(b), dicirikan oleh rentang off blockdiagonalkesamaan nilai [↵s, #s] untuk setiap cluster Cs tersebut bahwa jika x 2 Cs· L dan y 2 Cs· Rkemudian ↵s  Axy  #s. Selain itu, min {↵s· R, ↵s· L} > #s.