演示文稿(第十次课) 机器学习 幻灯片课件.pptVIP

Choose initial “seed” events from E Determine a star for each seed against the other seed events By appropriately modifying and selecting complexes from stars, construct a disjoint cover of E that optimizes the criterion LEF Is the termination Criterion satisfied? END a Given: E-a set of data events k-the number of clusters LEF-the clustering quality criterion Y N Is the clustering quality improving? Choose k new seeds which Are central events Choose k new seeds which are “border” events a Y N a b c e3 a e4 b c e5 a e6 b e7 e8 c e9 e10 0 1 2 0 1 2 0 1 2 e1 e2 X1 X2 0 1 2 X4 X3 0 1 2 Event X1 X2 X3 X4 e1 0 a 0 1 e2 0 b 0 0 e3 0 c 1 2 e4 1 a 0 2 e5 1 c 1 1 e6 2 a 1 0 e7 2 b 0 1 e8 2 b 1 2 e9 2 c 0 0 e10 2 c 2 2 d f a b c K=2 ; LEF-sparseness, Complexity; Termination criterion:base=2,probe=2 Iteration 1 Step 1: Select seed: e1,e2 Step 2: Produce Stars: RG(e1|e2,m) RG(e2|e1,m) m=5 RG(e1|e2,m)={[x2=a][x3=0∨1],[X4=1 ∨2]} RG(e2|e1,m)={[x2=b ∨c],[x4=0 ∨2]} sparseness Complexity Complex 1: [x1≤1][x3≤1] 31 2 Complex 2: [x1=2] 22 1 53 3 Step 4: Termination criterion is tested (the last of the base iterations) Step 5: {e1,e2,e3,e4,e5} {e6,e7,e8,e9,e10} New seeds: e1,e8 Iteration 3 The iteration produces the same clustering as iteration1 Step 4: Termination criterion is tested (the first of the two probe Stp 5: not better than the previous one, border events are selected New seeds e2,e6 Iteration 4 Produces a new clustering: Sparseness Complexity Complex 1: [x3≥1] 49 1 Complex 2: [x3=0] 22 1