Subspace Clustering of High-Dimensional Data: An Evolutionary Approach

<table><tr><td><table class="algorithm" id="alg2"><tr><td colspan="2">begin</td></tr><tr><td colspan="2"> for <svg height="11.4625" id="M221" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 32.349998 11.4625" width="32.349998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.2)"><path d="M244 607q0 -25 -15.5 -43t-37.5 -18q-19 0 -32 13t-13 35q0 21 15 41t39 20q20 0 32 -14t12 -34zM222 91q-29 -33 -79 -68t-75 -35q-13 0 -19 7.5t-6 31t10 65.5l62 253q5 26 -1 26q-21 0 -72 -43l-13 24q43 40 91 68t71 28q30 0 10 -78l-71 -274q-8 -30 3 -30
q16 0 76 48z" id="x1D456"></path></g><g transform="matrix(.017,-0,0,-.017,9.412,11.2)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,24.116,11.2)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg> to <svg height="18.112499" id="M222" style="vertical-align:-5.56921pt" version="1.1" viewbox="0 0 30.075001 18.112499" width="30.075001" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M169 380l92 53q26 16 49 16q80 0 128.5 -56t48.5 -133q0 -108 -72.5 -180.5t-176.5 -91.5q-38 1 -69 18v-131q0 -57 13 -70t71 -18v-27h-236v27q49 5 61 17t12 61v452q0 48 -9.5 58.5t-56.5 16.5v24q66 11 145 43v-79zM169 346v-270q37 -39 94 -39q63 0 101.5 50
t38.5 134q0 78 -38.5 123t-95.5 45q-45 0 -100 -43z" id="x70"></path></g><g transform="matrix(.012,-0,0,-.012,17.205,15.187)"><path d="M257 449q92 0 154 -65t62 -158q0 -112 -67 -175t-150 -63q-98 0 -158.5 66.5t-60.5 154.5q0 59 21 106.5t54.5 75.5t71 43t73.5 15zM244 416q-48 0 -81 -47t-33 -128q0 -96 38 -158t99 -62q51 0 82 43.5t31 139.5q0 91 -36 151.5t-100 60.5z" id="x6F"></path></g><g transform="matrix(.012,-0,0,-.012,23.155,15.187)"><path d="M169 380l92 53q26 16 49 16q80 0 128.5 -56t48.5 -133q0 -108 -72.5 -180.5t-176.5 -91.5q-38 1 -69 18v-131q0 -57 13 -70t71 -18v-27h-236v27q49 5 61 17t12 61v452q0 48 -9.5 58.5t-56.5 16.5v24q66 11 145 43v-79zM169 346v-270q37 -39 94 -39q63 0 101.5 50
t38.5 134q0 78 -38.5 123t-95.5 45q-45 0 -100 -43z" id="x70"></path></g>
</svg> do</td></tr><tr><td colspan="2">   <svg height="17.7125" id="M223" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 15.0875 17.7125" width="15.0875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,17.65)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,9.488)"><path d="M227 744l-123 -338l-31 15l73 368q12 3 41.5 -8t36.5 -20z" id="x2032"></path></g>
</svg> best fitted item among <i>N</i> tour elements randomly</td></tr><tr><td colspan="2">  selected from <i>P</i>;</td></tr><tr><td colspan="2"> return <svg height="17.7125" id="M224" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 15.0875 17.7125" width="15.0875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,17.65)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,9.488)"><path d="M227 744l-123 -338l-31 15l73 368q12 3 41.5 -8t36.5 -20z" id="x2032"></path></g>
</svg></td></tr><tr><td colspan="2">end</td></tr></table></td></tr></table>

Procedure of tournament selection method.

Applied Computational Intelligence and Soft Computing

alg2

Procedure 2

Procedure 2: Subspace Clustering of High-Dimensional Data: An Evolutionary Approach 