Vector Space Representation - Pattern Recognition - Assignment, Exercises of Computer Science

These are the Assignment of Pattern Recognition which includes Squared Mahalanobis, Weighted Version, Squared Euclidean, Dimensional Binary Patterns, Euclidean Distance, Satisfy Symmetry etc.Key important points are: Vector Space Representation, Logic Based Representation, Vector-Space Representation, Transactions, Considering, Inexpensive, Expensive

Typology: Exercises

2012/2013

Uploaded on 03/28/2013

ekanath
ekanath 🇮🇳

3.8

(4)

76 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Assignment
1. Consider the data shown in the following table where each pattern is
represented by 4 binary features f1, f2, f3, and f4. Suggest:
(a) a vector-space representation
(b) a logic based representation
(c) Which of the above two representations is suited well for the data?
Why?
pattern no f1 f2 f3 f4 Class label
1 1 0 1 0 1
2 0 1 0 1 2
3 1 0 1 0 1
4 1 0 1 0 1
5 0 1 0 1 2
2. Consider the table below of 4 transactions in a supermarket where we
consider only 4 items, i1, i2, i3, and i4. There are two classes. Obtain
the frequent patterns by considering items with frequency 2 and above.
Is it possible to use the resultant FP-Tree in classification?
Transaction no i1 i2 i3 i4 Class label
1 1 0 1 0 inexpensive
2 0 1 0 1 expensive
3 1 0 1 0 inexpensive
4 0 1 0 1 expensive
3. Consider a two-class problem where the classes are labeled pen drive
and laptop. Suggest a set of features that could be used to discriminate
between these two classes of objects. What is the corresponding vector-
space representation?
4. For what kind of datasets does the FP-Tree be large in size? Provide
such a dataset.
5. Given a dataset, will the corresponding MST be unique? Why is it so?
If not provide a counterexample.
6. Consider a dataset in a d-dimensional space. What is the worst-case
size of a K-d tree built on such a dataset?
Docsity.com

Partial preview of the text

Download Vector Space Representation - Pattern Recognition - Assignment and more Exercises Computer Science in PDF only on Docsity!

Assignment

  1. Consider the data shown in the following table where each pattern is represented by 4 binary features f 1 , f 2 , f 3 , and f 4. Suggest: (a) a vector-space representation (b) a logic based representation (c) Which of the above two representations is suited well for the data? Why? pattern no f 1 f 2 f 3 f 4 Class label 1 1 0 1 0 1 2 0 1 0 1 2 3 1 0 1 0 1 4 1 0 1 0 1 5 0 1 0 1 2
  2. Consider the table below of 4 transactions in a supermarket where we consider only 4 items, i 1 , i 2 , i 3 , and i 4. There are two classes. Obtain the frequent patterns by considering items with frequency 2 and above. Is it possible to use the resultant FP-Tree in classification? Transaction no i 1 i 2 i 3 i 4 Class label 1 1 0 1 0 inexpensive 2 0 1 0 1 expensive 3 1 0 1 0 inexpensive 4 0 1 0 1 expensive
  3. Consider a two-class problem where the classes are labeled pen drive and laptop. Suggest a set of features that could be used to discriminate between these two classes of objects. What is the corresponding vector- space representation?
  4. For what kind of datasets does the FP-Tree be large in size? Provide such a dataset.
  5. Given a dataset, will the corresponding MST be unique? Why is it so? If not provide a counterexample.
  6. Consider a dataset in a d-dimensional space. What is the worst-case size of a K-d tree built on such a dataset?

Docsity.com