Chapter 31 Flashcards

1
Q

What are supervised mining techniques

A

The inputs are given by end user/user

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

What are unsupervised mining techniques

A

The inputs are not given by end user/user. We do not how much classes and properties there and we are not guiding how to do data mining.

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

What is similarity / dissimilarity ratio

A

The match/mismatch ratio of the matrix sets the target evolutionary distance

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

What is time complexity of similarity matrix

A

n(square) x m

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

What are main types of data mining

A

1- Supervised

2- Unsupervised

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

What are types of supervised data mining

A
  • Bayesian modeling
  • Decision Tree
  • Neural network etc
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are 2 types of unsupervised data mining

A

1- One-way clustering

2- Two-way clustering

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

What is one-way clustering

A

When we cluster a data matrix, we use all attributes and do rows clustering. It gives global view of data matrix.

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

What is two-way clustering

A

We use columns and rows clustering in two-way in data matrix. It gives local view of data matrix

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

What is min-max “distances” in clustering

A

Records are grouped with similarity constraint. In clustering, the intra-distance should be maximum e.g. clustering of employees in company with similar salary. Young people cluster is far away with old people cluster.

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

How to identify association in records

A

Map the association in distance matrix. So we can quantify records with more similarity.

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

What is numeric and non-numeric attributes

A

Numeric attributes are with numeric values and non-numeric attributes are with non-numeric values.

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

Can graph be stored in matrix form

A

Yes. Matrix is a data structure that can store a graph.

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

What is binary matrix

A

The matrix that has values 0 and 1

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

What are 2 methods to find clusters in matrix

A
  1. Graph portioning (Separate vertices which have more connectivity and less connectivity)
  2. Click detection
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is classification

A

Classification is a data mining function that assigns items in a collection to target categories or classes.

17
Q

How classification works

A

We take data set and convert it into 2 sets.
1. Training set
2. Test set
Training set is testify on test set and get 2 classes of it. So we can classify data.

18
Q

Clustering vs cluster detection

A

First do clustering and then do cluster detection. (note: once we have clusters then we can know how much number of clusters exists in system)

19
Q

What is K means cluster detection technique

A

K means clustering techniques use a mean point to categorize values in clusters. It is fast technique.

20
Q

What is mean point in clustering

A

The point in a cluster which defines in which cluster the value falls

21
Q

Does k means clustering supervised

A

Yes

22
Q

Does k means clustering converse

A

Yes