The document is a midterm exam for a Web Mining course consisting of 5 short answer questions worth 1 mark each (5 marks total) and 2 long answer questions worth 5 marks each (10 marks total), for a total of 15 marks. Question 1 contains subquestions on content vs link spamming, rank position combination techniques, defining LSI, and distinguishing between centrality and prestige. Question 2 asks to compute the singular value decomposition for a given document set and search query. Question 3 asks to explain the HITS algorithm with a network example. Question 4 asks about the relationship between co-citation and bibliographic coupling with examples.
The document is a midterm exam for a Web Mining course consisting of 5 short answer questions worth 1 mark each (5 marks total) and 2 long answer questions worth 5 marks each (10 marks total), for a total of 15 marks. Question 1 contains subquestions on content vs link spamming, rank position combination techniques, defining LSI, and distinguishing between centrality and prestige. Question 2 asks to compute the singular value decomposition for a given document set and search query. Question 3 asks to explain the HITS algorithm with a network example. Question 4 asks about the relationship between co-citation and bibliographic coupling with examples.
The document is a midterm exam for a Web Mining course consisting of 5 short answer questions worth 1 mark each (5 marks total) and 2 long answer questions worth 5 marks each (10 marks total), for a total of 15 marks. Question 1 contains subquestions on content vs link spamming, rank position combination techniques, defining LSI, and distinguishing between centrality and prestige. Question 2 asks to compute the singular value decomposition for a given document set and search query. Question 3 asks to explain the HITS algorithm with a network example. Question 4 asks about the relationship between co-citation and bibliographic coupling with examples.
The document is a midterm exam for a Web Mining course consisting of 5 short answer questions worth 1 mark each (5 marks total) and 2 long answer questions worth 5 marks each (10 marks total), for a total of 15 marks. Question 1 contains subquestions on content vs link spamming, rank position combination techniques, defining LSI, and distinguishing between centrality and prestige. Question 2 asks to compute the singular value decomposition for a given document set and search query. Question 3 asks to explain the HITS algorithm with a network example. Question 4 asks about the relationship between co-citation and bibliographic coupling with examples.
Subject Code: 19EAI441 Duration: 50 Minutes Subject Name: Web Mining Max Marks: 15 M
(Answer to Q1 is Compulsory) (5x1=5M)
Q. 1 a. Differentiate content spamming and Link Spamming. b. List the techniques of combination using Rank Positions. c. Define LSI. d. Write the difference between centrality and prestige? e. Write the equation for computing page rank P (i) score of page i.
(Answer any Two Questions from the Following) (2x5=10M)
Q.2 Suppose we have the following set of five documents
d1: Romeo and Juliet, d2: Juliet: O happy dagger! , d3: Romeo died by dagger. d4:“Live free or die”,that’s the New-Hampshire’ smotto. d5: Did you know, New-Hampshire is in New-England.
And a search query: dies dagger.
Compute singular value decomposition U, , VT
Q.3 Explain about hits algorithm with suitable network.
Q.4. What is the relation between co-citation and bibliographic coupling with neat examples?