数据挖掘双语教学课件7class幻灯片.ppt

* * * * Data Mining: Concepts and Techniques * Locally Weighted Regression Construct an explicit approximation to f over a local region surrounding query instance xq. Locally weighted linear regression: The target function f is approximated near xq using the linear function: minimize the squared error: distance-decreasing weight K the gradient descent training rule: In most cases, the target function is approximated by a constant, linear, or quadratic function. * Data Mining: Concepts and Techniques * Prediction: Numerical Data * Data Mining: Concepts and Techniques * Prediction: Categorical Data * Data Mining: Concepts and Techniques * Chapter 7. Classification and Prediction What is classification? What is prediction? Issues regarding classification and prediction Classification by decision tree induction Bayesian Classification Classification by backpropagation Classification based on concepts from association rule mining Other Classification Methods Prediction Classification accuracy Summary * Data Mining: Concepts and Techniques * Classification Accuracy: Estimating Error Rates Partition: Training-and-testing use two independent data sets, e.g., training set (2/3), test set(1/3) used for data set with large number of samples Cross-validation divide the data set into k subsamples use k-1 subsamples as training data and one sub-sample as test data k-fold cross-validation for data set with moderate size Bootstrapping (leave-one-out) for small size data * Data Mining: Concepts and Techniques * Boosting and Bagging Boosting increases classification accuracy Applicable to decision trees or Bayesian classifier Learn a series of classifiers, where each classifier in the series pays more attention to the examples misclassified by its predecessor Boosting requires only linear time and constant space * Data Mining: Concepts and Techniques * Boosting Technique (II) — Algorithm Assign every example an equal weight 1/N For t = 1, 2, …, T Do Obtain a hypothesis (class