Which of the following is not associated with the architecture of a typical Data Mining system?

Data Warehouse Server Microsoft Excel Apache Server Business Analyst Q2. Which of the following is not considered to be a Data Mining functionality? Classification Data Cleaning Association Cluster Analysis Q3. Which of the following would Data Mining not be commonly used for? Credit Card Fraud Auto Insurance Ordering Dinner DNA Analysis Q4. Which choice best fits the BLANK SPACE in the following Data Mining definition?

"Data Mining is a process which uses a variety of data analysis tools to discover BLANK SPACE in data that may be used to make valid predictions"
Irrelivant Outputs Data Servers Oil Patterns & Relationships Q5. Which of the following can Data Mining NOT do? Replace skilled data/analysts/manages Assit with the discovery of patterns in data Offer a powerful tool to analyse large amounts of data Determine associations amongst data Q6. What does KDD stand for?

KnowleDge Discovery Knowledge Discovery in Databases Keep Databases Down Kentucy Derby Drivers Q7. Which of the following is not a step in the KDD process? Data Cleaning Pattern Evaluation Database Destruction Data Mining Q8. It is not uncommon for modern databases to range in sizes up to? 10 Bytes 20 Kilabytes 4 MegaBytes Gigabytes to Terabytes Q9. Which of the following tasks is not part of the Predictive Model? Concession Classification Prediction Regression Q10. Sequence Analysis can also be known as? Apriori's Algorithm Sequence Discovery Association Rule Integration
Q1. Which of the following is not an example of an application of Assocition Mining?

Time Series Analysis Basket Analysis Cross Marketing

Classification Q2. What are the two basic rule measures for Association Mining? Confidence & Standard Deviation Support & Confidence Standard Deviation & Support All Of The Above Q3. Which algorithm is most commonly used when carrying out Association Rule mining? Pythagoras K-Means Apriori PAM Algorithm Q4. What does FP stand for when talking about an FP-tree? Frequency Particulars Fraud Pattern Foreign Protection Frequency Pattern Q5. Which of the following is a key methodolgy behind the FP-tree process? Divide & Conquer Seek & Destroy Correlate & Divide None 0f the above Q6. FP growth is an order of magnitude faster than Apriori because.....? Repeated database scans are necessary Compact data structure is used Candidate generation is required Output is irrelivant of input data

Q7. Using the above diagram, support can be described as? An empty dataset Probability that a transaction will contain {X ^ Z} Probability that a transaction will contain {X ^ Y ^ Z} Probability that a transaction will contain { Y ^ Z} Q8. Using the above diagram, confidence can be described as? Probability that no transactions will take place Probability that the support will exceed 20% Support * No. of frequent itemsets Conditional probability that a transaction containing {X^Y} also contains Z Q9. The Apriori principle states that.... Any subset of a frequent itemset must be frequent All itemsets are frequent There is no frequency among any of the itemsets All subsets of frequent itemsets meet the minimum confidence Q10. Which of the following are used to generate Association Rules when using Apriori's algorithm? FP-tree Frequent itemsets Both FP-tree & frequent itemsets None of the above