- Page 2:
Data MiningPractical Machine Learni
- Page 5 and 6:
Publisher:Publishing Services Manag
- Page 7 and 8:
viFOREWORDThis book presents this n
- Page 10 and 11:
CONTENTSix4 Algorithms: The basic m
- Page 12 and 13:
CONTENTSxiGenerating good rules 202
- Page 14 and 15:
CONTENTSxiii8 Moving on: Extensions
- Page 16:
CONTENTSxv13 The command-line inter
- Page 19 and 20:
xviiiLIST OF FIGURESFigure 4.10 The
- Page 21 and 22:
xxLIST OF FIGURESFigure 10.13 Worki
- Page 23 and 24:
xxiiLIST OF TABLESTable 5.2 Confide
- Page 25 and 26:
xxivPREFACEalchemy. Instead, there
- Page 27 and 28:
xxviPREFACEwho interprets them, and
- Page 29 and 30:
xxviiiPREFACEin Section 6.3. We hav
- Page 31 and 32:
xxxPREFACEration. All who have work
- Page 34:
partIMachine Learning Toolsand Tech
- Page 37 and 38:
4 CHAPTER 1 | WHAT’S IT ALL ABOUT
- Page 39 and 40:
6 CHAPTER 1 | WHAT’S IT ALL ABOUT
- Page 41 and 42:
8 CHAPTER 1 | WHAT’S IT ALL ABOUT
- Page 43 and 44:
10 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 45 and 46:
12 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 47 and 48:
14 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 49 and 50:
16 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 51 and 52:
18 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 53 and 54:
20 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 55 and 56:
22 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 57 and 58:
24 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 59 and 60:
26 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 61 and 62:
28 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 63 and 64:
30 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 65 and 66:
32 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 67 and 68:
34 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 69 and 70:
36 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 71 and 72:
38 CHAPTER 1 | WHAT’S IT ALL ABOU
- Page 74 and 75:
chapter 2Input:Concepts, Instances,
- Page 76 and 77:
2.1 WHAT’S A CONCEPT? 43increase
- Page 78 and 79:
2.2 WHAT’S IN AN EXAMPLE? 45data
- Page 80 and 81:
2.2 WHAT’S IN AN EXAMPLE? 47Table
- Page 82 and 83:
2.3 WHAT’S IN AN ATTRIBUTE? 49Tab
- Page 84 and 85:
2.3 WHAT’S IN AN ATTRIBUTE? 51Not
- Page 86 and 87:
2.4 PREPARING THE INPUT 53cleaned u
- Page 88 and 89:
missing values in this dataset). Th
- Page 90 and 91:
dividing by the range between the m
- Page 92 and 93:
2.4 PREPARING THE INPUT 59a record
- Page 94 and 95:
chapter 3Output:Knowledge Represent
- Page 96 and 97:
3.2 DECISION TREES 63Alternatively,
- Page 98 and 99:
3.3 CLASSIFICATION RULES 65nated by
- Page 100 and 101:
3.3 CLASSIFICATION RULES 671abx = 1
- Page 102 and 103:
3.4 ASSOCIATION RULES 69yes, then i
- Page 104 and 105:
3.5 RULES WITH EXCEPTIONS 71If peta
- Page 106 and 107:
3.6 RULES INVOLVING RELATIONS 73ica
- Page 108 and 109:
Standard relations include equality
- Page 110 and 111:
PRP =-56.1+0.049 MYCT+0.015 MMIN+0.
- Page 112 and 113:
3.8 INSTANCE-BASED REPRESENTATION 7
- Page 114 and 115:
3.9 Clusters3.9 CLUSTERS 81When clu
- Page 116 and 117:
chapter 4Algorithms:The Basic Metho
- Page 118 and 119:
4.1 INFERRING RUDIMENTARY RULES 85F
- Page 120 and 121:
described overfitting-avoidance bia
- Page 122 and 123:
4.2 STATISTICAL MODELING 89Table 4.
- Page 124 and 125:
just as we calculated previously. A
- Page 126 and 127:
4.2 STATISTICAL MODELING 93Table 4.
- Page 128 and 129:
of a document. Instead, a document
- Page 130 and 131:
4.3 DIVIDE-AND-CONQUER: CONSTRUCTIN
- Page 132 and 133:
4.3 DIVIDE-AND-CONQUER: CONSTRUCTIN
- Page 134 and 135:
4.3 DIVIDE-AND-CONQUER: CONSTRUCTIN
- Page 136 and 137:
4.3 DIVIDE-AND-CONQUER: CONSTRUCTIN
- Page 138 and 139:
4.4 COVERING ALGORITHMS: CONSTRUCTI
- Page 140 and 141:
4.4 COVERING ALGORITHMS: CONSTRUCTI
- Page 142 and 143:
4.4 COVERING ALGORITHMS: CONSTRUCTI
- Page 144 and 145:
4.4 COVERING ALGORITHMS: CONSTRUCTI
- Page 146 and 147:
4.5 MINING ASSOCIATION RULES 113acc
- Page 148 and 149:
4.5 MINING ASSOCIATION RULES 115Tab
- Page 150 and 151:
4.5 MINING ASSOCIATION RULES 117whi
- Page 152 and 153:
4.6 LINEAR MODELS 119through the da
- Page 154 and 155:
4.6 LINEAR MODELS 121However, linea
- Page 156 and 157:
4.6 LINEAR MODELS 123n( i)i i 1-x
- Page 158 and 159:
4.6 LINEAR MODELS 125Set all weight
- Page 160 and 161:
4.6 LINEAR MODELS 127While some ins
- Page 162 and 163:
4.7 INSTANCE-BASED LEARNING 129When
- Page 164 and 165:
4.7 INSTANCE-BASED LEARNING 131Figu
- Page 166 and 167:
4.7 INSTANCE-BASED LEARNING 133Figu
- Page 168 and 169:
4.7 INSTANCE-BASED LEARNING 135Figu
- Page 170 and 171:
4.8 CLUSTERING 137As we saw in Sect
- Page 172 and 173:
4.9 FURTHER READING 139can be updat
- Page 174 and 175:
4.9 FURTHER READING 141Bayes was an
- Page 176 and 177:
chapter 5Credibility:Evaluating Wha
- Page 178 and 179:
5.1 TRAINING AND TESTING 145of each
- Page 180 and 181:
ather than error rate, so this corr
- Page 182 and 183:
5.3 CROSS-VALIDATION 149mediate con
- Page 184 and 185:
5.4 OTHER ESTIMATES 151A single 10-
- Page 186 and 187:
90% used in 10-fold cross-validatio
- Page 188 and 189:
5.5 COMPARING DATA MINING METHODS 1
- Page 190 and 191:
5.6 PREDICTING PROBABILITIES 157In
- Page 192 and 193:
5.6 PREDICTING PROBABILITIES 159whe
- Page 194 and 195:
mental job expected of a loss funct
- Page 196 and 197:
y the total number of positives, wh
- Page 198 and 199:
5.7 COUNTING THE COST 165different
- Page 200 and 201:
5.7 COUNTING THE COST 167Table 5.6D
- Page 202 and 203:
5.7 COUNTING THE COST 169100%80%tru
- Page 204 and 205:
5.7 COUNTING THE COST 171should cho
- Page 206 and 207:
Different terms are used in differe
- Page 208 and 209:
5.7 COUNTING THE COST 1750.5Anormal
- Page 210 and 211:
5.8 EVALUATING NUMERIC PREDICTION 1
- Page 212 and 213:
5.9 THE MINIMUM DESCRIPTION LENGTH
- Page 214 and 215:
5.9 THE MINIMUM DESCRIPTION LENGTH
- Page 216 and 217:
5.10 APPLYING THE MDL PRINCIPLE TO
- Page 218:
5.11 FURTHER READING 185tion theory
- Page 221 and 222:
188 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 223 and 224:
190 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 225 and 226:
192 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 227 and 228:
194 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 229 and 230:
196 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 231 and 232:
198 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 233 and 234:
200 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 235 and 236:
202 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 237 and 238:
204 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 239:
206 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 243 and 244:
210 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 245 and 246:
212 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 247 and 248:
214 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 249 and 250:
216 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 251 and 252:
218 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 253 and 254:
220 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 255 and 256:
222 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 257 and 258:
224 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 259 and 260:
226 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 261 and 262:
228 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 263 and 264:
230 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 265 and 266:
232 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 267 and 268:
234 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 269 and 270:
236 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 271 and 272:
238 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 273 and 274:
240 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 275 and 276:
242 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 277 and 278:
244 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 279 and 280:
246 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 281 and 282:
248 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 283 and 284:
250 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 285 and 286:
252 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 287 and 288:
254 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 289 and 290:
256 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 291 and 292:
258 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 293 and 294:
260 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 295 and 296:
262 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 297 and 298:
264 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 299 and 300:
266 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 301 and 302:
268 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 303 and 304:
270 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 305 and 306:
272 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 307 and 308:
274 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 309 and 310:
276 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 311 and 312:
278 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 313 and 314:
280 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 315 and 316:
282 CHAPTER 6 | IMPLEMENTATIONS: RE
- Page 318 and 319:
chapter 7Transformations:Engineerin
- Page 320 and 321:
7.1 ATTRIBUTE SELECTION 287attribut
- Page 322 and 323:
7.1 ATTRIBUTE SELECTION 289and less
- Page 324 and 325:
tion—and it is much easier to und
- Page 326 and 327: 7.1 ATTRIBUTE SELECTION 293outlook
- Page 328 and 329: 7.1 ATTRIBUTE SELECTION 295the t-te
- Page 330 and 331: 7.2 DISCRETIZING NUMERIC ATTRIBUTES
- Page 332 and 333: 7.2 DISCRETIZING NUMERIC ATTRIBUTES
- Page 334 and 335: 7.2 DISCRETIZING NUMERIC ATTRIBUTES
- Page 336 and 337: 7.2 DISCRETIZING NUMERIC ATTRIBUTES
- Page 338 and 339: 7.3 SOME USEFUL TRANSFORMATIONS 305
- Page 340 and 341: 7.3 SOME USEFUL TRANSFORMATIONS 307
- Page 342 and 343: 7.3 SOME USEFUL TRANSFORMATIONS 309
- Page 344 and 345: 7.3 SOME USEFUL TRANSFORMATIONS 311
- Page 346 and 347: 7.4 AUTOMATIC DATA CLEANSING 313Int
- Page 348 and 349: 7.5 COMBINING MULTIPLE MODELS 315da
- Page 350 and 351: 7.5 COMBINING MULTIPLE MODELS 317pa
- Page 352 and 353: 7.5 COMBINING MULTIPLE MODELS 319mo
- Page 354 and 355: 7.5 COMBINING MULTIPLE MODELS 321Ra
- Page 356 and 357: 7.5 COMBINING MULTIPLE MODELS 323Ho
- Page 358 and 359: 7.5 COMBINING MULTIPLE MODELS 325Th
- Page 360 and 361: 7.5 COMBINING MULTIPLE MODELS 327of
- Page 362 and 363: 7.5 COMBINING MULTIPLE MODELS 329ou
- Page 364 and 365: 7.5 COMBINING MULTIPLE MODELS 331ev
- Page 366 and 367: 7.5 COMBINING MULTIPLE MODELS 333be
- Page 368 and 369: 7.5 COMBINING MULTIPLE MODELS 335Ta
- Page 370 and 371: 7.6 Using unlabeled data7.6 USING U
- Page 372 and 373: 7.6 USING UNLABELED DATA 339automat
- Page 374 and 375: 7.7 FURTHER READING 341deal with we
- Page 378 and 379: chapter 8Moving on:Extensions and A
- Page 380 and 381: 8.1 LEARNING FROM MASSIVE DATASETS
- Page 382 and 383: 8.2 INCORPORATING DOMAIN KNOWLEDGE
- Page 384 and 385: 8.3 TEXT AND WEB MINING 351fact pre
- Page 386 and 387: 8.3 TEXT AND WEB MINING 353frequent
- Page 388 and 389: 8.3 TEXT AND WEB MINING 355markup i
- Page 390 and 391: 8.4 ADVERSARIAL SITUATIONS 357stati
- Page 392 and 393: 8.5 UBIQUITOUS DATA MINING 359ing p
- Page 394 and 395: 8.6 FURTHER READING 361to contain a
- Page 396: partIIThe Weka Machine LearningWork
- Page 399 and 400: 366 CHAPTER 9 | INTRODUCTION TO WEK
- Page 401 and 402: 368 CHAPTER 9 | INTRODUCTION TO WEK
- Page 403 and 404: 370 CHAPTER 10 | THE EXPLORERFigure
- Page 405 and 406: 372 CHAPTER 10 | THE EXPLORER(a)(b)
- Page 407 and 408: 374 CHAPTER 10 | THE EXPLORER(a)(b)
- Page 409 and 410: 376 CHAPTER 10 | THE EXPLORER=== De
- Page 411 and 412: 378 CHAPTER 10 | THE EXPLORERright-
- Page 413 and 414: 380 CHAPTER 10 | THE EXPLORER10.2 E
- Page 415 and 416: 382 CHAPTER 10 | THE EXPLORERFiles
- Page 417 and 418: 384 CHAPTER 10 | THE EXPLORERFigure
- Page 419 and 420: === Run information ===Scheme: weka
- Page 421 and 422: 388 CHAPTER 10 | THE EXPLORER(a)(b)
- Page 423 and 424: 390 CHAPTER 10 | THE EXPLORER(a)(b)
- Page 425 and 426: 392 CHAPTER 10 | THE EXPLORERmethod
- Page 427 and 428:
394 CHAPTER 10 | THE EXPLORER(a)Fig
- Page 429 and 430:
396 CHAPTER 10 | THE EXPLORERNameTa
- Page 431 and 432:
398 CHAPTER 10 | THE EXPLOREROne pa
- Page 433 and 434:
400 CHAPTER 10 | THE EXPLORERin som
- Page 435 and 436:
402 CHAPTER 10 | THE EXPLORER(a)Fig
- Page 437 and 438:
404 CHAPTER 10 | THE EXPLORERTable
- Page 439 and 440:
406 CHAPTER 10 | THE EXPLORER(a)(b)
- Page 441 and 442:
408 CHAPTER 10 | THE EXPLORER(Secti
- Page 443 and 444:
410 CHAPTER 10 | THE EXPLORERregres
- Page 445 and 446:
412 CHAPTER 10 | THE EXPLORERattrib
- Page 447 and 448:
414 CHAPTER 10 | THE EXPLORERLBR (f
- Page 449 and 450:
416 CHAPTER 10 | THE EXPLORERBoosti
- Page 451 and 452:
418 CHAPTER 10 | THE EXPLORERThe th
- Page 453 and 454:
420 CHAPTER 10 | THE EXPLORERreache
- Page 455 and 456:
422 CHAPTER 10 | THE EXPLORERnation
- Page 457 and 458:
424 CHAPTER 10 | THE EXPLORERdeleti
- Page 460 and 461:
chapter 11The Knowledge Flow Interf
- Page 462 and 463:
11.1 GETTING STARTED 429(a)(b)Figur
- Page 464 and 465:
11.3 CONFIGURING AND CONNECTING THE
- Page 466 and 467:
11.4 INCREMENTAL LEARNING 433pervis
- Page 468:
11.4 INCREMENTAL LEARNING 435When t
- Page 471 and 472:
438 CHAPTER 12 | THE EXPERIMENTER12
- Page 473 and 474:
440 CHAPTER 12 | THE EXPERIMENTERsc
- Page 475 and 476:
442 CHAPTER 12 | THE EXPERIMENTERal
- Page 477 and 478:
444 CHAPTER 12 | THE EXPERIMENTER(a
- Page 479 and 480:
446 CHAPTER 12 | THE EXPERIMENTERIt
- Page 482 and 483:
chapter 13The Command-line Interfac
- Page 484 and 485:
13.2 THE STRUCTURE OF WEKA 451Large
- Page 486 and 487:
The weka.classifiers packageThe cla
- Page 488 and 489:
13.2 THE STRUCTURE OF WEKA 455Figur
- Page 490 and 491:
13.3 COMMAND-LINE OPTIONS 457Table
- Page 492:
13.3 COMMAND-LINE OPTIONS 459proced
- Page 495 and 496:
462 CHAPTER 14 | EMBEDDED MACHINE L
- Page 497 and 498:
464 CHAPTER 14 | EMBEDDED MACHINE L
- Page 499 and 500:
466 CHAPTER 14 | EMBEDDED MACHINE L
- Page 501 and 502:
468 CHAPTER 14 | EMBEDDED MACHINE L
- Page 504 and 505:
chapter 15Writing New Learning Sche
- Page 506 and 507:
15.1 AN EXAMPLE CLASSIFIER 473packa
- Page 508 and 509:
15.1 AN EXAMPLE CLASSIFIER 475m_Cla
- Page 510 and 511:
15.1 AN EXAMPLE CLASSIFIER 477* @re
- Page 512 and 513:
15.1 AN EXAMPLE CLASSIFIER 479** @p
- Page 514 and 515:
15.1 AN EXAMPLE CLASSIFIER 481for b
- Page 516:
15.2 CONVENTIONS FOR IMPLEMENTING C
- Page 519 and 520:
486 REFERENCESAsmis, E. 1984. Epicu
- Page 521 and 522:
488 REFERENCESCavnar, W. B., and J.
- Page 523 and 524:
490 REFERENCESDrucker, H. 1997. Imp
- Page 525 and 526:
492 REFERENCESFreund, Y., and L. Ma
- Page 527 and 528:
494 REFERENCESHall, M., G. Holmes,
- Page 529 and 530:
496 REFERENCESKohavi, R. 1995a. A s
- Page 531 and 532:
498 REFERENCESMann, T. 1993. Librar
- Page 533 and 534:
500 REFERENCESHeckerman, H. Mannila
- Page 535 and 536:
502 REFERENCESStone, P., and M. Vel
- Page 538 and 539:
IndexAactivation function, 234acuit
- Page 540 and 541:
INDEX 507automatic filtering, 315av
- Page 542 and 543:
INDEX 509randomization, 320-321stac
- Page 544 and 545:
INDEX 511document classification, 9
- Page 546 and 547:
INDEX 513Fisher, R. A., 15flat file
- Page 548 and 549:
INDEX 515KK2, 278Kappa statistic, 1
- Page 550 and 551:
INDEX 517multiclass alternating dec
- Page 552 and 553:
INDEX 519predicting performance, 14
- Page 554 and 555:
INDEX 521sigmoid kernel, 219Simple
- Page 556 and 557:
INDEX 523unlabeled data, 337-341clu
- Page 558:
About the AuthorsIan H. Witten is a