-
Dominich, S.: Mathematical foundations of information retrieval (2001)
0.02
0.01586826 = product of:
0.03173652 = sum of:
0.03173652 = sum of:
0.0061926404 = weight(_text_:a in 1753) [ClassicSimilarity], result of:
0.0061926404 = score(doc=1753,freq=10.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.14243183 = fieldWeight in 1753, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.02554388 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
0.02554388 = score(doc=1753,freq=2.0), product of:
0.13204344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.037706986 = queryNorm
0.19345059 = fieldWeight in 1753, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.5 = coord(1/2)
- Abstract
- This book offers a comprehensive and consistent mathematical approach to information retrieval (IR) without which no implementation is possible, and sheds an entirely new light upon the structure of IR models. It contains the descriptions of all IR models in a unified formal style and language, along with examples for each, thus offering a comprehensive overview of them. The book also creates mathematical foundations and a consistent mathematical theory (including all mathematical results achieved so far) of IR as a stand-alone mathematical discipline, which thus can be read and taught independently. Also, the book contains all necessary mathematical knowledge on which IR relies, to help the reader avoid searching different sources. The book will be of interest to computer or information scientists, librarians, mathematicians, undergraduate students and researchers whose work involves information retrieval.
- Date
- 22. 3.2008 12:26:32
-
Lalmas, M.: XML retrieval (2009)
0.00
0.0022962927 = product of:
0.0045925854 = sum of:
0.0045925854 = product of:
0.009185171 = sum of:
0.009185171 = weight(_text_:a in 4998) [ClassicSimilarity], result of:
0.009185171 = score(doc=4998,freq=22.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.21126054 = fieldWeight in 4998, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=4998)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Documents usually have a content and a structure. The content refers to the text of the document, whereas the structure refers to how a document is logically organized. An increasingly common way to encode the structure is through the use of a mark-up language. Nowadays, the most widely used mark-up language for representing structure is the eXtensible Mark-up Language (XML). XML can be used to provide a focused access to documents, i.e. returning XML elements, such as sections and paragraphs, instead of whole documents in response to a query. Such focused strategies are of particular benefit for information repositories containing long documents, or documents covering a wide variety of topics, where users are directed to the most relevant content within a document. The increased adoption of XML to represent a document structure requires the development of tools to effectively access documents marked-up in XML. This book provides a detailed description of query languages, indexing strategies, ranking algorithms, presentation scenarios developed to access XML documents. Major advances in XML retrieval were seen from 2002 as a result of INEX, the Initiative for Evaluation of XML Retrieval. INEX, also described in this book, provided test sets for evaluating XML retrieval effectiveness. Many of the developments and results described in this book were investigated within INEX.
-
Lavrenko, V.: ¬A generative theory of relevance (2009)
0.00
0.0020770747 = product of:
0.0041541494 = sum of:
0.0041541494 = product of:
0.008308299 = sum of:
0.008308299 = weight(_text_:a in 3306) [ClassicSimilarity], result of:
0.008308299 = score(doc=3306,freq=18.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.19109234 = fieldWeight in 3306, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=3306)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A modern information retrieval system must have the capability to find, organize and present very different manifestations of information - such as text, pictures, videos or database records - any of which may be of relevance to the user. However, the concept of relevance, while seemingly intuitive, is actually hard to define, and it's even harder to model in a formal way. Lavrenko does not attempt to bring forth a new definition of relevance, nor provide arguments as to why any particular definition might be theoretically superior or more complete. Instead, he takes a widely accepted, albeit somewhat conservative definition, makes several assumptions, and from them develops a new probabilistic model that explicitly captures that notion of relevance. With this book, he makes two major contributions to the field of information retrieval: first, a new way to look at topical relevance, complementing the two dominant models, i.e., the classical probabilistic model and the language modeling approach, and which explicitly combines documents, queries, and relevance in a single formalism; second, a new method for modeling exchangeable sequences of discrete random variables which does not make any structural assumptions about the data and which can also handle rare events. Thus his book is of major interest to researchers and graduate students in information retrieval who specialize in relevance modeling, ranking algorithms, and language modeling.
-
Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006)
0.00
8.308299E-4 = product of:
0.0016616598 = sum of:
0.0016616598 = product of:
0.0033233196 = sum of:
0.0033233196 = weight(_text_:a in 6) [ClassicSimilarity], result of:
0.0033233196 = score(doc=6,freq=8.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.07643694 = fieldWeight in 6, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0234375 = fieldNorm(doc=6)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Content
- Inhalt: Chapter 1. Introduction to Web Search Engines: 1.1 A Short History of Information Retrieval - 1.2 An Overview of Traditional Information Retrieval - 1.3 Web Information Retrieval Chapter 2. Crawling, Indexing, and Query Processing: 2.1 Crawling - 2.2 The Content Index - 2.3 Query Processing Chapter 3. Ranking Webpages by Popularity: 3.1 The Scene in 1998 - 3.2 Two Theses - 3.3 Query-Independence Chapter 4. The Mathematics of Google's PageRank: 4.1 The Original Summation Formula for PageRank - 4.2 Matrix Representation of the Summation Equations - 4.3 Problems with the Iterative Process - 4.4 A Little Markov Chain Theory - 4.5 Early Adjustments to the Basic Model - 4.6 Computation of the PageRank Vector - 4.7 Theorem and Proof for Spectrum of the Google Matrix Chapter 5. Parameters in the PageRank Model: 5.1 The a Factor - 5.2 The Hyperlink Matrix H - 5.3 The Teleportation Matrix E Chapter 6. The Sensitivity of PageRank; 6.1 Sensitivity with respect to alpha - 6.2 Sensitivity with respect to H - 6.3 Sensitivity with respect to vT - 6.4 Other Analyses of Sensitivity - 6.5 Sensitivity Theorems and Proofs Chapter 7. The PageRank Problem as a Linear System: 7.1 Properties of (I - alphaS) - 7.2 Properties of (I - alphaH) - 7.3 Proof of the PageRank Sparse Linear System Chapter 8. Issues in Large-Scale Implementation of PageRank: 8.1 Storage Issues - 8.2 Convergence Criterion - 8.3 Accuracy - 8.4 Dangling Nodes - 8.5 Back Button Modeling
-
Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (2005)
0.00
5.538866E-4 = product of:
0.0011077732 = sum of:
0.0011077732 = product of:
0.0022155463 = sum of:
0.0022155463 = weight(_text_:a in 7) [ClassicSimilarity], result of:
0.0022155463 = score(doc=7,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.050957955 = fieldWeight in 7, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.03125 = fieldNorm(doc=7)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The second edition of Understanding Search Engines: Mathematical Modeling and Text Retrieval follows the basic premise of the first edition by discussing many of the key design issues for building search engines and emphasizing the important role that applied mathematics can play in improving information retrieval. The authors discuss important data structures, algorithms, and software as well as user-centered issues such as interfaces, manual indexing, and document preparation. Significant changes bring the text up to date on current information retrieval methods: for example the addition of a new chapter on link-structure algorithms used in search engines such as Google. The chapter on user interface has been rewritten to specifically focus on search engine usability. In addition the authors have added new recommendations for further reading and expanded the bibliography, and have updated and streamlined the index to make it more reader friendly.
