• Non ci sono risultati.

Information Retrieval

N/A
N/A
Info
Scarica
Protected

Academic year: 2021

Condividi "Information Retrieval"

Copied!
1
0
0

Caricamento.... (Visualizza il testo completo ora)

Scarica adesso ( 1 pagine )

Testo completo

(1)

Information Retrieval

15 June 2020 – time 30 minutes

Question #1. Assume that you are given a set of strings S = {bar, bat, bes, bet, bit}.

- Build the data structure that efficiently searches for an arbitrary pattern P with 1 edit distance.

- Show how it is executed the 1-edit search for P = “bas”

Question #2. Show how to synchronize via rsync the new file “bacaddabb” (on the server) using the old file “acabbbdabac” (on the client) and blocks of size 3 chars.

Question #3. Given the graph:

a) Compute one step of PageRank by assuming a uniform starting distribution, and setting alpha=0.5

b) Compute one step of Personalised PageRank with respect to node 3 and assuming a uniform starting distribution, and setting alpha=0.5

Question #4. Let us assume that you are given a set of records R1,R2,…., Rn each one formed by F fields. Sketch the design of an algorithm that finds the most similar records in terms of the number of fields which contain the same values.

1

3 4 2

5

Riferimenti

Scarica adesso ( PDF - 1 pagine - 169.41 KB )

Documenti correlati

How to Disassemble a Ball the Size of a Pea and Reassemble it into a Ball the Size of the Sun Based on notes taken at a talk at Yale in the early

The Banach-Tarski paradox does not exist in the plane be- cause of Banach’s proof that Lebesgue measure extends to an isometry-invariant, finitely additive measure on all subsets of

Compute the sum of the squares of distances from the center of O to the incenters of the triangles of∆ and show that this sum is independent of

[r]

The following slides show how to

 Create a classification model based on the logistic regression algorithm for textual documents..  Apply the model to new

The textual file edges.csv

 For each user with at least one follower, store in the output folder the number of followers.. ▪ One user

The rsync algorithm

• Scan the sorted list to find a match with the second half of the

The rsync algorithm

•  Beta compute a hash of the file B and send it to alpha?. •  Alpha compute the hash of A and send back to beta either the hash (if the two hash are the same) or the content of

We show how the likelihood of segregation depends on information preferences and on parameters of the diffusion process

We show that segregation according to information preferences leads to a seg- regation of information: If groups do not interact with each other, within each group, only the

the manoeuvre file

The “turn.man” is a true manoeuvre file compared to the “match.man” which only tries to mimic flight test manoeuvres. It is built up in a similar way as the “match.man”