turning term exam 1 Flashcards

1
Q

data mining is a

A

process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

the following stage in data mining involves digging beneath the surface to uncover the structure of the business problem and the data that are available and then match them to one or more data mining tasks for which we may have substantial science and technology to apply

A

data understanding

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

the following is not an example of machine learning tasks

A

calculating the annual profit or loss

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

” a computer program is said to learn from experience E with respect to some task T and some performance measure P if its performance on T as measured by P improves with experience E

the training data is referred to as

A

E

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

CRISP-DM is a codification for the data mining process which starts with the following stage

A

business and data understanding

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

supervised machine learning methods include the following

A

none of the above

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

business data science requires the combination of the know-how in the following

A

business domain expertise, mathematics, statistics, computer science

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

the diagram above depicts the following type of machine learning systems

A

unsupervised

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

the following machine learning algorithm attempts to find associations between entities based on transactions involving them

A

co-occurrence grouping

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

the following is not mentioned in chapter 1 of the data science for business book

A

IBM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

in the diagrams the amount of shading corresponds to

A

total entropy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

based on the diagrams which single attribute would you select to spilt between edible and poisonous mushrooms

A

spore print color

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

entropy is a measure of

A

purity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

a basket contains 10 apples and nothing else a bowl contains 5 cherries and nothing else the entropy values of the set of apples in the basket and the set of cherries in a bowl are

A

0 and 0 respectively

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

a supervised segmentation with tree structured modeling can be done by recursively selecting the best attribute from multiple attributes based on their

A

information gain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

in the diagram which are considered as nodes

A

all of the above (employed; balance and age; class write off and class not write off)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

the following is an alternative to the entropy measure of information

A

gini impurity

18
Q

in a decision tree a terminal node is also known as a

A

leaf

19
Q

the cellular phone churn prediction problem discussed toward the end of chapter 3 uses a historical data set 20000 customer to measure the accuracy of the tree model the authors used a training set consisting of

A

50% customers who churned and 50% customers who did not churn

20
Q

an instance is also called a

A

feature vector

21
Q

the objective function of support vector machines is based on the idea that

A

the wider the bar is between the classes, the better

22
Q

with linear regressions the goal is to find a model that gives the

A

minimum sum of squared errors

23
Q

a model is a BLANK of reality created to serve a purpose

A

sampled representation

24
Q

the following describes the parametric learning approach

A

start by specifying the structure of the model and then continue with calculating the best parameter values given a particular set of training data

25
Q

the above is an example of the BLANK view

A

instance space

26
Q

the basic linear model is not appropriate for estimating the class probability because the output of the linear function f(x) ranges

A

from negative infinity to positive infinity

27
Q

the corresponding offs of probability of 0.8 is

A

4

28
Q

logistic regression models are used widely for

A

classification

29
Q

support vector machines are used widely for

A

classification

30
Q

f(x)= w0+w1x1+w2x2+…

in the above general line model the parameters are

A

w0,w1,w2

31
Q

the variation in mouse size explained by weight divided by the variation in mouse size not explained by weight is called

A

F

32
Q

BLANK tells us how much of the variation in mouse size can be explained by taking mouse weight into account

A

R squared

33
Q

in support vector machines to make a threshold that is not so sensitive to outliers we must allow

A

none of the above

34
Q

there is BLANK variation around the line that we fit by least squares

A

less

35
Q

the sum of squares of the distance from the mean to each data point is called

A

SS(mean)

36
Q

R squared is 0.6 which means that BLANK explains 60% of the variation in mouse size

A

mouse weight

37
Q

the sum of the distances between the data and the line squared is

A

SS(fit)

38
Q

in support vector machines we use BLANK to determine the number of misclassifications and observations to allow inside of the soft margin to get the best classification

A

cross validation

39
Q

the variation around the mean can be calculated using

A

(data-mean)^2 / n

40
Q

in the case of predicting the weight of a mouse based on its size the following value of r2 squared will indicate a perfect prediction

A

1