最近正在看一本有關 Information Retrieval的書 - "Introduction to Information Retrieval"
裡面的題目有些不懂 希望各位可以幫忙解答
題目如下:
1.
Suppose we wish to use a postings intersection procedure to determine simply the list of documents that satisfy a /k clause, rather than returning the list of positions, as in Figure 2.12 (page 42). For simplicity, assume k ≥ 2. Let L denote the total number of occurrences of the two terms in the document collection (i.e., the sum of their collection frequencies). Which of the following is true? Justify your answer.
a. The merge can be accomplished in a number of steps linear in L and independent of k, and we can ensure that each pointer moves only to the right.
b. The merge can be accomplished in a number of steps linear in L and independent of k, but a pointer may be forced to move non-monotonically (i.e., to sometimes back up)
c. The merge can require kL steps in some cases.
2.
If all the hub and authority scores are initialized to 1, what is the hub/authority score of a node after one iteration?
3.
How should the Boolean query x AND NOT y be handled? Why is naive evaluation of this query normally very expensive? Write out a postings merge algorithm that evaluates this query efficiently.
[返回] 计算机科学论坛 →
计算机理论与工程 → 『 人工智能 :: 机器学习|数据挖掘|进化计算 』 → Information Retrieval 問題
(订阅本版)
2010/12/9 9:53:00
新浪微博
Information Retrieval 問題
