Questions tagged [information-retrieval]

The tag has no usage guidance.

14 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5
votes
0answers
377 views

What's known about web search query distribution?

Silverstein et al., Analysis of a Very Large AltaVista Query Log, SRC Technical Note '98 looked at 43 days of queries in 1998 and pulled out how many terms there are per query, what the top 25 queries ...
2
votes
0answers
22 views

Poset data structure to find least element, greater or equal to given

Let $A$ be a finite set, and $S \subset \mathcal{P}(A)$. Is there a data structure for $S$ that would allow to quickly retrieve an element $q \in S $, given a key $p \in \mathcal{P}(A)$, such that $q$ ...
1
vote
0answers
69 views

Does the way that PageRank is heavily skewed lower the effectiveness of TF-IDF calculations?

PageRank is heavily skewed in that a small proportion of webpages have a high PageRank score while most of the others have a very low PageRank score. Does this undermine the effectiveness of the TF-...
1
vote
0answers
54 views

How to use HITS algorithm to rank pages

I am trying to implement a simple web search engine mechanism with using HITS algorithm. I understand how the algorithm work and produce hubs and authority values for each page. But how can I use this ...
1
vote
0answers
115 views

Single Pass in Memory Indexing

I was reading single pass in memory indexing and had few doubts. Why is the time complexity of SPIMI O(T) where T are the token. We know that before writing blocks to Disk, we have to sort ...
1
vote
2answers
109 views

Query Logs and evaluation of search engines

I'm taking a course about Information Retrieval and we had a quiz involving the evaluation of search engines. We had a problematic question regarding "Query Logs" (basically recording the queries ...
1
vote
0answers
34 views

Evaluation of Information extraction a task

I have to evaluate my information extraction program. I have to evaluate it by the expectation-driven way. I don't know what that means. I would appreciate if you could help me. Thx.
0
votes
0answers
22 views

How Bloom filter work

I'm trying to understand the Bloom filter, and how it works, In particular, the subject that I use the bloom filter is the networking world store a large number of URLs. I understand that the Bloom ...
0
votes
0answers
9 views

R-Precision of documents with same relevance degree

Let's assume I have a collection of 10 documents,so |D| = 10 and a collection of relevant documents R , where |R| = 3 & R = {d1,d3,d8}. Then I make a query,q, to a random retrieval system and it ...
0
votes
0answers
16 views

Learning material on information visualization

If somebody with a computer science background wants to learn about information visualization, again from a computer science perspective, which will be the best learning material for him? A textbook ...
0
votes
0answers
60 views

Algorithm of finding relationships between two sets given a bijection relationship between their cosets to another set

Let $C$ be the set of all available classes, $S$ be the set of all available students, $P$ be the set of all available phone numbers. Each student many have zero to many phone numbers, but each phone ...
0
votes
0answers
90 views

Gensim LDA all topics zero

I'm trying to run Gensim's LdaModel on a corpus. I load the corpus myself from two XML files. I made a class to iterate over the text pieces in the XML files. It ...
0
votes
0answers
205 views

Skip-Gram Window?

I'm reading about Skip-Gram and how it represents words as vectors. If I'm correct it not just represents a single words as a vector, but the word and it's neighbours. So if I have the dataset "the ...
-1
votes
1answer
102 views

How do I calculate values in K-means (clustering)?

I'm learning some Data Retrieval concepts, one of them being K-means clustering. I understand that it's meant to help understand data, but that's where I begin having issues. I'm working on this ...