-
Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996)
0.10
0.10433822 = product of:
0.20867644 = sum of:
0.14619127 = weight(_text_:storage in 5123) [ClassicSimilarity], result of:
0.14619127 = score(doc=5123,freq=6.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.62563545 = fieldWeight in 5123, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.04505459 = weight(_text_:retrieval in 5123) [ClassicSimilarity], result of:
0.04505459 = score(doc=5123,freq=6.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.34732026 = fieldWeight in 5123, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.017430587 = product of:
0.034861173 = sum of:
0.034861173 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.034861173 = score(doc=5123,freq=2.0), product of:
0.1501726 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04288404 = queryNorm
0.23214069 = fieldWeight in 5123, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.5 = coord(1/2)
0.5 = coord(3/6)
- Abstract
- Traces the development of text searching and retrieval software designed to cope with the increasing demands made by the storage and handling of large amounts of data, recorded on high data storage media, from CD-ROM to multi gigabyte storage media and online information services, with particular reference to the need to cope with graphics as well as conventional ASCII text. Includes details of: Boolean searching, fuzzy searching and matching; relevance ranking; proximity searching and improved strategies for dealing with text searching in very large databases. Concludes that the best searching tools for CD-ROM publishers are those optimized for searching and retrieval on CD-ROM. CD-ROM drives have relatively lower random seek times than hard discs and so the software most appropriate to the medium is that which can effectively arrange the indexes and text on the CD-ROM to avoid continuous random access searching. Lists and reviews a selection of software packages designed to achieve the sort of results required for rapid CD-ROM searching
- Date
- 12. 9.1996 13:56:22
-
Schiminovich, S.: Automatic classification and retrieval of documents by means of a bibliographic pattern discovery algorithm (1971)
0.09
0.09425926 = product of:
0.2827778 = sum of:
0.19694164 = weight(_text_:storage in 4846) [ClassicSimilarity], result of:
0.19694164 = score(doc=4846,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.8428251 = fieldWeight in 4846, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.109375 = fieldNorm(doc=4846)
0.08583613 = weight(_text_:retrieval in 4846) [ClassicSimilarity], result of:
0.08583613 = score(doc=4846,freq=4.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.6617001 = fieldWeight in 4846, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.109375 = fieldNorm(doc=4846)
0.33333334 = coord(2/6)
- Source
- Information storage and retrieval. 6(1971), S.417-435
-
Information retrieval : data structures and algorithms (1992)
0.09
0.091578074 = product of:
0.18315615 = sum of:
0.099470556 = weight(_text_:storage in 3495) [ClassicSimilarity], result of:
0.099470556 = score(doc=3495,freq=4.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.42569098 = fieldWeight in 3495, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0390625 = fieldNorm(doc=3495)
0.06131152 = weight(_text_:retrieval in 3495) [ClassicSimilarity], result of:
0.06131152 = score(doc=3495,freq=16.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.47264296 = fieldWeight in 3495, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=3495)
0.022374075 = weight(_text_:systems in 3495) [ClassicSimilarity], result of:
0.022374075 = score(doc=3495,freq=2.0), product of:
0.13179013 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.04288404 = queryNorm
0.1697705 = fieldWeight in 3495, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=3495)
0.5 = coord(3/6)
- Abstract
- The book consists of separate chapters by some 20 different authors. It covers many of the information retrieval algorithms, including methods of file organization, file search and access, and query processing
- Content
- An edited volume containing data structures and algorithms for information retrieval including a disk with examples written in C. for prgrammers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents. ------------------Enthält die Kapitel: FRAKES, W.B.: Introduction to information storage and retrieval systems; BAEZA-YATES, R.S.: Introduction to data structures and algorithms related to information retrieval; HARMAN, D. u.a.: Inverted files; FALOUTSOS, C.: Signature files; GONNET, G.H. u.a.: New indices for text: PAT trees and PAT arrays; FORD, D.A. u. S. CHRISTODOULAKIS: File organizations for optical disks; FOX, C.: Lexical analysis and stoplists; FRAKES, W.B.: Stemming algorithms; SRINIVASAN, P.: Thesaurus construction; BAEZA-YATES, R.A.: String searching algorithms; HARMAN, D.: Relevance feedback and other query modification techniques; WARTIK, S.: Boolean operators; WARTIK, S. u.a.: Hashing algorithms; HARMAN, D.: Ranking algorithms; FOX, E.: u.a.: Extended Boolean models; RASMUSSEN, E.: Clustering algorithms; HOLLAAR, L.: Special-purpose hardware for information retrieval; STANFILL, C.: Parallel information retrieval algorithms
-
Dominich, S.: Mathematical foundations of information retrieval (2001)
0.08
0.08123353 = product of:
0.16246706 = sum of:
0.099470556 = weight(_text_:storage in 1753) [ClassicSimilarity], result of:
0.099470556 = score(doc=1753,freq=4.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.42569098 = fieldWeight in 1753, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.048471015 = weight(_text_:retrieval in 1753) [ClassicSimilarity], result of:
0.048471015 = score(doc=1753,freq=10.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.37365708 = fieldWeight in 1753, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.014525489 = product of:
0.029050978 = sum of:
0.029050978 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
0.029050978 = score(doc=1753,freq=2.0), product of:
0.1501726 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04288404 = 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)
0.5 = coord(3/6)
- 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
- LCSH
- Information storage and retrieval
- Subject
- Information storage and retrieval
-
Lee, D.L.; Ren, L.: Document ranking on weight-partitioned signature files (1996)
0.08
0.08007109 = product of:
0.16014218 = sum of:
0.09847082 = weight(_text_:storage in 2417) [ClassicSimilarity], result of:
0.09847082 = score(doc=2417,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.42141256 = fieldWeight in 2417, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0546875 = fieldNorm(doc=2417)
0.030347655 = weight(_text_:retrieval in 2417) [ClassicSimilarity], result of:
0.030347655 = score(doc=2417,freq=2.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.23394634 = fieldWeight in 2417, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0546875 = fieldNorm(doc=2417)
0.031323705 = weight(_text_:systems in 2417) [ClassicSimilarity], result of:
0.031323705 = score(doc=2417,freq=2.0), product of:
0.13179013 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.04288404 = queryNorm
0.23767869 = fieldWeight in 2417, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0546875 = fieldNorm(doc=2417)
0.5 = coord(3/6)
- Abstract
- Proposes the weight partitioned signature file, a signature file organization for supporting document ranking. It uses multiple signature files each corresponding to one term frequency to represent terms with different term frequencies. Words with the same term frequency in a document are grouped together and hased into the signature file corresponding to that term frequency. Investigates the effect of false drops on retrieval effectiveness. Analyses the performance of the weight partitioned signature file under different search strategies and configurations. Obtains an optimal formula for storage allocation to minimise the effect of false drops on document ranks. Analytical results are supported by experiments on document collections
- Source
- ACM transactions on information systems. 14(1996) no.2, S.109-137
-
Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.06
0.057536956 = product of:
0.17261086 = sum of:
0.112538084 = weight(_text_:storage in 3510) [ClassicSimilarity], result of:
0.112538084 = score(doc=3510,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.48161435 = fieldWeight in 3510, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.06007278 = weight(_text_:retrieval in 3510) [ClassicSimilarity], result of:
0.06007278 = score(doc=3510,freq=6.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.46309367 = fieldWeight in 3510, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.33333334 = coord(2/6)
- Abstract
- Discusses hashing, an information storage and retrieval technique useful for implementing many of the other structures in this book. The concepts underlying hashing are presented, along with 2 implementation strategies. The chapter also contains an extensive discussion of perfect hashing, an important optimization in information retrieval, and an O(n) algorithm to find minimal perfect hash functions for a set of keys
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Goffman, W.: ¬A searching procedure for information retrieval (1964)
0.06
0.057536956 = product of:
0.17261086 = sum of:
0.112538084 = weight(_text_:storage in 5281) [ClassicSimilarity], result of:
0.112538084 = score(doc=5281,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.48161435 = fieldWeight in 5281, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0625 = fieldNorm(doc=5281)
0.06007278 = weight(_text_:retrieval in 5281) [ClassicSimilarity], result of:
0.06007278 = score(doc=5281,freq=6.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.46309367 = fieldWeight in 5281, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=5281)
0.33333334 = coord(2/6)
- Abstract
- A search procedure for an information retrieval system is developed whereby the answer to a question is obtained by maximizing an evaluation function of the system's output in terms of the probility of relevance. Necessary and sufficient conditions are given for a set to be an answer to a query. A partition of the file is made in such way that all documents belonging to the answer are members of the same class. Hence the answer can be generated by one relevant document. In this manner a search of the total file is avoided
- Source
- Information storage and retrieval. 2(1964), S.73-78
-
Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (2005)
0.04
0.03510609 = product of:
0.10531826 = sum of:
0.056269042 = weight(_text_:storage in 7) [ClassicSimilarity], result of:
0.056269042 = score(doc=7,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.24080718 = fieldWeight in 7, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.03125 = fieldNorm(doc=7)
0.049049217 = weight(_text_:retrieval in 7) [ClassicSimilarity], result of:
0.049049217 = score(doc=7,freq=16.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.37811437 = fieldWeight in 7, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03125 = fieldNorm(doc=7)
0.33333334 = coord(2/6)
- 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.
- Content
- Inhalt: Introduction Document File Preparation - Manual Indexing - Information Extraction - Vector Space Modeling - Matrix Decompositions - Query Representations - Ranking and Relevance Feedback - Searching by Link Structure - User Interface - Book Format Document File Preparation Document Purification and Analysis - Text Formatting - Validation - Manual Indexing - Automatic Indexing - Item Normalization - Inverted File Structures - Document File - Dictionary List - Inversion List - Other File Structures Vector Space Models Construction - Term-by-Document Matrices - Simple Query Matching - Design Issues - Term Weighting - Sparse Matrix Storage - Low-Rank Approximations Matrix Decompositions QR Factorization - Singular Value Decomposition - Low-Rank Approximations - Query Matching - Software - Semidiscrete Decomposition - Updating Techniques Query Management Query Binding - Types of Queries - Boolean Queries - Natural Language Queries - Thesaurus Queries - Fuzzy Queries - Term Searches - Probabilistic Queries Ranking and Relevance Feedback Performance Evaluation - Precision - Recall - Average Precision - Genetic Algorithms - Relevance Feedback Searching by Link Structure HITS Method - HITS Implementation - HITS Summary - PageRank Method - PageRank Adjustments - PageRank Implementation - PageRank Summary User Interface Considerations General Guidelines - Search Engine Interfaces - Form Fill-in - Display Considerations - Progress Indication - No Penalties for Error - Results - Test and Retest - Final Considerations Further Reading
- RSWK
- Suchmaschine / Information Retrieval
Suchmaschine / Information Retrieval / Mathematisches Modell (HEBIS)
- Subject
- Suchmaschine / Information Retrieval
Suchmaschine / Information Retrieval / Mathematisches Modell (HEBIS)
-
Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006)
0.02
0.023761464 = product of:
0.07128439 = sum of:
0.042201784 = weight(_text_:storage in 6) [ClassicSimilarity], result of:
0.042201784 = score(doc=6,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.18060538 = fieldWeight in 6, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0234375 = fieldNorm(doc=6)
0.02908261 = weight(_text_:retrieval in 6) [ClassicSimilarity], result of:
0.02908261 = score(doc=6,freq=10.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.22419426 = fieldWeight in 6, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0234375 = fieldNorm(doc=6)
0.33333334 = coord(2/6)
- 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
Chapter 9. Accelerating the Computation of PageRank: 9.1 An Adaptive Power Method - 9.2 Extrapolation - 9.3 Aggregation - 9.4 Other Numerical Methods Chapter 10. Updating the PageRank Vector: 10.1 The Two Updating Problems and their History - 10.2 Restarting the Power Method - 10.3 Approximate Updating Using Approximate Aggregation - 10.4 Exact Aggregation - 10.5 Exact vs. Approximate Aggregation - 10.6 Updating with Iterative Aggregation - 10.7 Determining the Partition - 10.8 Conclusions Chapter 11. The HITS Method for Ranking Webpages: 11.1 The HITS Algorithm - 11.2 HITS Implementation - 11.3 HITS Convergence - 11.4 HITS Example - 11.5 Strengths and Weaknesses of HITS - 11.6 HITS's Relationship to Bibliometrics - 11.7 Query-Independent HITS - 11.8 Accelerating HITS - 11.9 HITS Sensitivity Chapter 12. Other Link Methods for Ranking Webpages: 12.1 SALSA - 12.2 Hybrid Ranking Methods - 12.3 Rankings based on Traffic Flow Chapter 13. The Future of Web Information Retrieval: 13.1 Spam - 13.2 Personalization - 13.3 Clustering - 13.4 Intelligent Agents - 13.5 Trends and Time-Sensitive Search - 13.6 Privacy and Censorship - 13.7 Library Classification Schemes - 13.8 Data Fusion Chapter 14. Resources for Web Information Retrieval: 14.1 Resources for Getting Started - 14.2 Resources for Serious Study Chapter 15. The Mathematics Guide: 15.1 Linear Algebra - 15.2 Perron-Frobenius Theory - 15.3 Markov Chains - 15.4 Perron Complementation - 15.5 Stochastic Complementation - 15.6 Censoring - 15.7 Aggregation - 15.8 Disaggregation
