数学与应用数学专业外文翻译--高级搜索方法.docVIP

外文原文 Advanced search methods A search for the key words such as linear and algebra could easily turn up hundreds of documents, some of which may not even be about linear algebra. If we were to increase the number of search words and require that all search words be matched, then we could run a risk of excluding some crucial linear algebra documents. Rather than match all words of the expanded search list, our database search should give priority to those documents that match most of the key words with high relative frequencies. To accomplish this, we need to find the columns of the database matrix A that are “closest” to the search vector x. One way to measure how close two vectors are is to define the angle between the vectors. We will do this in Section 1 of Chapter 5. We will also revisit the information retrieval application again after we have learned about the singular value decomposition (Chapter 6, Section 5). This decomposition can be used to find a simpler approximation to the database matrix, which will speed up the searches dramatically. Often it has the added advantage of filtering out noise; that is, using the approximate version of the database matrix may automatically have the effect of eliminating documents that use key words in unwanted contexts. For example, a dental student and a mathematics student could both use calculus as one of their search words. Since the list of mathematics search using an approximate database matrix is likely to eliminate all documents relating to dentistry. Similarly, the mathematics documents would be filtered out in the dental student’s search. Web search and page ranking Modern Web searches could easily involve billions of documents with hundreds of thousands of key words. Indeed, as of March 2004, there were more than 4 billion Web pages on the Internet, and it is not uncommon for search engines to acquire or update as many as 10 billion Web pages in a single day. Although the database matrix for pages on the I