Chp 1

1.data mining
a. Definition
b. Theory
c. Architecture
d. Issuses
e. Technology used
f. Functionalites
g. Advanatages
h. Application
2.kdd model

Chp 2
3.Types of attributes
a. Nominal
b. Binary
c. Ordinal
d. Numeric
e. Discrete verses continous
4.Box plot
5..data visualization
a. Theory
b. Reason
c. Techniques (steam leaf, histogram, box plot, pie chart, scatter plotter)
6.data pre-processing steps
a. Data cleaning
b. Data integration
c. Data reduction
d. Data discretization
7.data compression techniques
8.similarities and dissimilarities
9.Binning method
10.Explain methods of cleaning phase

Chp 3

11.classification
a. Theory
b. Problem
c. Two step process
d. Techniques (regression, decision tree, rules, neural network)
12.issues regarding classification and prediction
13..id 3 examples
14.Methods
a. decision tree(attributes selection, tree pruning)
b. bayesian classification(naive bayes)
Chp 4
15.clustering
a. Categories
b. Classification vs clustering
16.k mean
17.k medoids
18.herarchical clustering
19.Agglomaerative clustering
20.Divisive hierarchy clustering
21.BIRCH
22.Density Based METHOD
23.outliers
a. Types
b. Application
c. Challengea
d. detection methods

Chp no 5

24.market base analysis

a. Theory
b. Application
c. How to use
25.frequest itemset, closed itemset, association rules
26.frequent pattern mining
27.aprior
a. Advantage and disadvantages
b. Examples
28.fp tree
a. Algorithm
b. Example
29.mining multilevel association rules
30.md rules

Chp no 6
31.WHAT IS BI
A. Theory
B. Architecture
C. Components
32.decision support system
33.fraud detection
34.clickstream data
35.crm