A Rank-Constrained Matrix Representation for Hypergraph-Based Subspace Clustering

<div>Subspace clustering accuracy of LRR and RMR versus the percentage corruption <svg height="9.4034pt" id="M271" style="vertical-align:-3.40335pt" version="1.1" viewbox="-0.0498162 -6.00005 10.7679 9.4034" width="10.7679pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M525 275C525 381 464 451 380 451C338 451 289 439 241 405C158 347 127 277 106 152C51 -168 37 -216 24 -242L28 -257C42 -256 92 -247 117 -222C126 -213 134 -193 150 -69L166 32C184 10 211 -12 245 -12C276 -12 332 8 384 46C458 100 525 176 525 275ZM436 260C436 131 366 41 267 41C246 41 208 51 175 82C181 125 187 162 195 200C220 322 257 400 328 400C398 400 436 338 436 260Z" id="g50-239"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="549" vert-adv-y="549"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,6.292,3.001)"><path d="M398 365C398 411 356 451 297 451C250 451 198 430 151 397C65 336 24 230 24 139C24 14 97 -12 148 -12C198 -12 284 7 373 104L355 130C306 84 246 53 198 53C132 53 111 109 111 163V189C209 211 398 261 398 365ZM317 351C317 308 273 262 117 225C134 338 189 383 221 399C230 404 249 407 263 407C295 407 317 389 317 351Z" id="g50-102"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="422" vert-adv-y="422"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: A Rank-Constrained Matrix Representation for Hypergraph-Based Subspace Clustering 