Download INFS 6510 – Competitive Intelligence Systems

yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Nonlinear dimensionality reduction wikipedia, lookup

Expectation–maximization algorithm wikipedia, lookup

K-nearest neighbors algorithm wikipedia, lookup

Cluster analysis wikipedia, lookup

K-means clustering wikipedia, lookup

INFS 6720 – Data Mining
Chapter Discussion Questions
Chapter 3 – Basic Data Mining Techniques
1. How do association rules differ from traditional production rules? How are they the
2. What is the usual definition of an optimal clustering of the K-Means algorithm?
3. Using the attribute age, draw an expanded version of the decision tree in Figure 3.4
that correctly classifies all training data instances.
4. Use the information in Table 3.5 to list three, two-item set rules. Use the data in
Table 3.3 to compute confidence and support values for each rule.
5. Perform the third iteration of the K-Means algorithm for the example given in the
section titled “An Example Using K-Means.” What are the new cluster centers?