Syllabus
|
Course Code: PE-CS-D405L Course Name: Information Retrieval Lab |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | 1. Implementation of Simple tokenization and Stop-word removal on a document. | |
| 2 | 2. Write a program to compute similarity between two text documents. | |
| 3 | 3. Write a map reduce program to count the number of occurrence of each alphabetic character in a document. The count for each letter should be case-insensitive. | |
| 4 | 4. Write a program to parse XML text, generate web graph and compute topic specific page rank | |
| 5 | 5. Write a program to implement Simple web crawler | |
| 6 | 6. Implementation of Naïve Bayes algorithm. | |
| 7 | 7. Implementation of Decision tree algorithm. | |
| 8 | 8. Implementation of K-nearest neighbour algorithm. | |
| 9 | 9. Implementation of K- means algorithm. | |
| 10 | 10. Evaluate the performance matrix using any algorith | |
