Relationship Matrix Nonnegative Decomposition for Clustering

<table>The pairwise similarity matrix <svg height="11.175" id="M204" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 13.5875 11.175" width="13.5875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M775 650l-6 -28q-60 -6 -81.5 -16t-61.5 -54l-175 -191l125 -243q30 -58 48.5 -71t82.5 -19l-5 -28h-275l7 28l35 4q31 4 37 12t-6 34l-108 216q-140 -165 -177 -219q-16 -22 -10.5 -30.5t41.5 -13.5l22 -3l-7 -28h-244l8 28q52 4 75 15.5t67 52.5q48 46 206 231
l-110 215q-26 51 -44 63t-72 17l6 28h250l-6 -28l-27 -4q-30 -5 -35 -10t3 -27q17 -43 95 -190q70 78 154 185q15 21 10 29.5t-33 12.5l-30 4l5 28h236z" id="x1D44B"></path></g>
</svg> obtained from the <i>JAFFE</i> dataset.</table>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: Relationship Matrix Nonnegative Decomposition for Clustering 