Search (19 results, page 1 of 1)

0.08213657 = product of:
  0.12320486 = sum of:
    0.079009734 = weight(_text_:query in 6) [ClassicSimilarity], result of:
      0.079009734 = score(doc=6,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.34446338 = fieldWeight in 6, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0234375 = fieldNorm(doc=6)
    0.04419512 = product of:
      0.08839024 = sum of:
        0.08839024 = weight(_text_:page in 6) [ClassicSimilarity], result of:
          0.08839024 = score(doc=6,freq=6.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.3206585 = fieldWeight in 6, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.0234375 = fieldNorm(doc=6)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other Web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of Web page rankings, "Google's PageRank and Beyond" supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample Web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. It includes: many illustrative examples and entertaining asides; MATLAB code; accessible and informal style; and complete and self-contained section for mathematics review.

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

0.04739448 = product of:
  0.14218344 = sum of:
    0.14218344 = sum of:
      0.10206425 = weight(_text_:page in 1781) [ClassicSimilarity], result of:
        0.10206425 = score(doc=1781,freq=2.0), product of:
          0.27565226 = queryWeight, product of:
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.049352113 = queryNorm
          0.37026453 = fieldWeight in 1781, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.046875 = fieldNorm(doc=1781)
      0.040119182 = weight(_text_:22 in 1781) [ClassicSimilarity], result of:
        0.040119182 = score(doc=1781,freq=2.0), product of:
          0.1728227 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049352113 = queryNorm
          0.23214069 = fieldWeight in 1781, 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=1781)
  0.33333334 = coord(1/3)

Date

22. 3.2008 14:35:21

Series

Edition PAGE

0.03511544 = product of:
  0.105346315 = sum of:
    0.105346315 = weight(_text_:query in 7) [ClassicSimilarity], result of:
      0.105346315 = score(doc=7,freq=10.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.4592845 = fieldWeight in 7, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=7)
  0.33333334 = coord(1/3)

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

0.027482178 = product of:
  0.08244653 = sum of:
    0.08244653 = weight(_text_:query in 377) [ClassicSimilarity], result of:
      0.08244653 = score(doc=377,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.35944697 = fieldWeight in 377, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0546875 = fieldNorm(doc=377)
  0.33333334 = coord(1/3)

Content

Information representation and retrieval : an overview -- Information representation I : basic approaches -- Information representation II : related topics -- Language in information representation and retrieval -- Retrieval techniques and query representation -- Retrieval approaches -- Information retrieval models -- Information retrieval systems -- Retrieval of information unique in content or format -- The user dimension in information representation and retrieval -- Evaluation of information representation and retrieval -- Artificial intelligence in information representation and retrieval.

0.02409996 = product of:
  0.07229988 = sum of:
    0.07229988 = sum of:
      0.058926824 = weight(_text_:page in 1789) [ClassicSimilarity], result of:
        0.058926824 = score(doc=1789,freq=6.0), product of:
          0.27565226 = queryWeight, product of:
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.049352113 = queryNorm
          0.21377233 = fieldWeight in 1789, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            5.5854197 = idf(docFreq=450, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
      0.013373061 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
        0.013373061 = score(doc=1789,freq=2.0), product of:
          0.1728227 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.049352113 = queryNorm
          0.07738023 = fieldWeight in 1789, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
  0.33333334 = coord(1/3)

Date

23. 3.2008 19:10:22

Footnote

In 13 chapters, Part Two provides an introduction to KDD, an overview of data mining techniques, and examples of the usefulness of data model visualizations. The importance of visualization throughout the KDD process is stressed in many of the chapters. In particular, the need for measures of visualization effectiveness, benchmarking for identifying best practices, and the use of standardized sample data sets is convincingly presented. Many of the important data mining approaches are discussed in this complementary context. Cluster and outlier detection, classification techniques, and rule discovery algorithms are presented as the basic techniques common to the KDD process. The potential effectiveness of using visualization in the data modeling process are illustrated in chapters focused an using visualization for helping users understand the KDD process, ask questions and form hypotheses about their data, and evaluate the accuracy and veracity of their results. The 11 chapters of Part Three provide an overview of the KDD process and successful approaches to integrating KDD, data mining, and visualization in complementary domains. Rhodes (Chapter 21) begins this section with an excellent overview of the relation between the KDD process and data mining techniques. He states that the "primary goals of data mining are to describe the existing data and to predict the behavior or characteristics of future data of the same type" (p. 281). These goals are met by data mining tasks such as classification, regression, clustering, summarization, dependency modeling, and change or deviation detection. Subsequent chapters demonstrate how visualization can aid users in the interactive process of knowledge discovery by graphically representing the results from these iterative tasks. Finally, examples of the usefulness of integrating visualization and data mining tools in the domain of business, imagery and text mining, and massive data sets are provided. This text concludes with a thorough and useful 17-page index and lengthy yet integrating 17-page summary of the academic and industrial backgrounds of the contributing authors. A 16-page set of color inserts provide a better representation of the visualizations discussed, and a URL provided suggests that readers may view all the book's figures in color on-line, although as of this submission date it only provides access to a summary of the book and its contents. The overall contribution of this work is its focus an bridging two distinct areas of research, making it a valuable addition to the Morgan Kaufmann Series in Database Management Systems. The editors of this text have met their main goal of providing the first textbook integrating knowledge discovery, data mining, and visualization. Although it contributes greatly to our under- standing of the development and current state of the field, a major weakness of this text is that there is no concluding chapter to discuss the contributions of the sum of these contributed papers or give direction to possible future areas of research. "Integration of expertise between two different disciplines is a difficult process of communication and reeducation. Integrating data mining and visualization is particularly complex because each of these fields in itself must draw an a wide range of research experience" (p. 300). Although this work contributes to the crossdisciplinary communication needed to advance visualization in KDD, a more formal call for an interdisciplinary research agenda in a concluding chapter would have provided a more satisfying conclusion to a very good introductory text.

0.022208955 = product of:
  0.06662686 = sum of:
    0.06662686 = weight(_text_:query in 1486) [ClassicSimilarity], result of:
      0.06662686 = score(doc=1486,freq=4.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.29047704 = fieldWeight in 1486, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=1486)
  0.33333334 = coord(1/3)

Abstract

Interested in how an efficient search engine works? Want to know what algorithms are used to rank resulting documents in response to user requests? The authors answer these and other key information on retrieval design and implementation questions is provided. This book is not yet another high level text. Instead, algorithms are thoroughly described, making this book ideally suited for both computer science students and practitioners who work on search-related applications. As stated in the foreword, this book provides a current, broad, and detailed overview of the field and is the only one that does so. Examples are used throughout to illustrate the algorithms. The authors explain how a query is ranked against a document collection using either a single or a combination of retrieval strategies, and how an assortment of utilities are integrated into the query processing scheme to improve these rankings. Methods for building and compressing text indexes, querying and retrieving documents in multiple languages, and using parallel or distributed processing to expedite the search are likewise described. This edition is a major expansion of the one published in 1998. Neuaufl. 2005: Besides updating the entire book with current techniques, it includes new sections on language models, cross-language information retrieval, peer-to-peer processing, XML search, mediators, and duplicate document detection.

0.019630127 = product of:
  0.05889038 = sum of:
    0.05889038 = weight(_text_:query in 0) [ClassicSimilarity], result of:
      0.05889038 = score(doc=0,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.25674784 = fieldWeight in 0, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.0390625 = fieldNorm(doc=0)
  0.33333334 = coord(1/3)

0.015704103 = product of:
  0.047112305 = sum of:
    0.047112305 = weight(_text_:query in 2423) [ClassicSimilarity], result of:
      0.047112305 = score(doc=2423,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.20539828 = fieldWeight in 2423, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.03125 = fieldNorm(doc=2423)
  0.33333334 = coord(1/3)

Content

Inhalt u.a.: - Digital Library Models and Architectures - Multimedia and Hypermedia Digital Libraries - XML - Building Digital Libraries - User Studies - Digital Preservation - Metadata - Digital Libraries and e-Learning - Text Classification in Digital Libraries - Searching - - Focused Crawling Using Latent Semantic Indexing - An Application for Vertical Search Engines / George Almpanidis, Constantine Kotropoulos, Ioannis Pitas - - Active Support for Query Formulation in Virtual Digital Libraries: A Case Study with DAFFODIL / Andre Schaefer, Matthias Jordan, Claus-Peter Klas, Norbert Fuhr - - Expression of Z39.50 Supported Search Capabilities by Applying Formal Descriptions / Michalis Sfakakis, Sarantos Kapidakis - Text Digital Libraries

0.014033119 = product of:
  0.042099357 = sum of:
    0.042099357 = product of:
      0.08419871 = sum of:
        0.08419871 = weight(_text_:page in 9) [ClassicSimilarity], result of:
          0.08419871 = score(doc=9,freq=4.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.30545264 = fieldWeight in 9, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.02734375 = fieldNorm(doc=9)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Few companies in history have ever been as successful and as admired as Google, the company that has transformed the Internet and become an indispensable part of our lives. How has Google done it? Veteran technology reporter Steven Levy was granted unprecedented access to the company, and in this revelatory book he takes readers inside Google headquarters-the Googleplex-to show how Google works. While they were still students at Stanford, Google cofounders Larry Page and Sergey Brin revolutionized Internet search. They followed this brilliant innovation with another, as two of Google's earliest employees found a way to do what no one else had: make billions of dollars from Internet advertising. With this cash cow (until Google's IPO nobody other than Google management had any idea how lucrative the company's ad business was), Google was able to expand dramatically and take on other transformative projects: more efficient data centers, open-source cell phones, free Internet video (YouTube), cloud computing, digitizing books, and much more. The key to Google's success in all these businesses, Levy reveals, is its engineering mind-set and adoption of such Internet values as speed, openness, experimentation, and risk taking. After its unapologetically elitist approach to hiring, Google pampers its engineers-free food and dry cleaning, on-site doctors and masseuses-and gives them all the resources they need to succeed. Even today, with a workforce of more than 23,000, Larry Page signs off on every hire. But has Google lost its innovative edge? It stumbled badly in China-Levy discloses what went wrong and how Brin disagreed with his peers on the China strategy-and now with its newest initiative, social networking, Google is chasing a successful competitor for the first time. Some employees are leaving the company for smaller, nimbler start-ups. Can the company that famously decided not to be evil still compete? No other book has ever turned Google inside out as Levy does with In the Plex.

0.009922914 = product of:
  0.02976874 = sum of:
    0.02976874 = product of:
      0.05953748 = sum of:
        0.05953748 = weight(_text_:page in 1981) [ClassicSimilarity], result of:
          0.05953748 = score(doc=1981,freq=2.0), product of:
            0.27565226 = queryWeight, product of:
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.049352113 = queryNorm
            0.21598764 = fieldWeight in 1981, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.5854197 = idf(docFreq=450, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1981)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

As the World Wide Web continues to expand, it becomes increasingly difficult for users to obtain information efficiently. Because most search engines read format languages such as HTML or SGML, search results reflect formatting tags more than actual page content, which is expressed in natural language. Spinning the Semantic Web describes an exciting new type of hierarchy and standardization that will replace the current "Web of links" with a "Web of meaning." Using a flexible set of languages and tools, the Semantic Web will make all available information - display elements, metadata, services, images, and especially content - accessible. The result will be an immense repository of information accessible for a wide range of new applications. This first handbook for the Semantic Web covers, among other topics, software agents that can negotiate and collect information, markup languages that can tag many more types of information in a document, and knowledge systems that enable machines to read Web pages and determine their reliability. The truly interdisciplinary Semantic Web combines aspects of artificial intelligence, markup languages, natural language processing, information retrieval, knowledge representation, intelligent agents, and databases.

0.007852051 = product of:
  0.023556152 = sum of:
    0.023556152 = weight(_text_:query in 68) [ClassicSimilarity], result of:
      0.023556152 = score(doc=68,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.10269914 = fieldWeight in 68, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.015625 = fieldNorm(doc=68)
  0.33333334 = coord(1/3)

Content

Inhalt: An Introduction to Metatheories, Theories, and Models (Marcia J. Bates) - What Methodology Does to Theory: Sense-Making Methodology as Exemplar (Brenda Dervin) Evolution in Information Behavior Modeling Wilson's Model (T.D. Wilson) - Affective Load (Diane Nahl) - Anomalous State of Knowledge (Nicholas J. Belkin) - Archival Intelligence (Elizabeth Yakel) - Bandura's Social Cognition (Makiko Miwa) - Berrypicking (Marcia J. Bates) - Big6 Skills for Information Literacy (Carrie A. Lowe and Michael B. Eisenberg) - Chang's Browsing (Chan-Ju L. Chang) - Chatman's Information Poverty (Julie Hersberger) - Chatman's Life in the Round (Crystal Fulton) - Cognitive Authority (Soo Young Rieh) - Cognitive Work Analysis (Raya Fidel and Annelise Mark Pejtersen) - Collective Action Dilemma (Marc Smith and Howard T. Weiser) - Communicative Action (Gerald Benoît) - Communities of Practice (Elisabeth Davies) - Cultural Models of Hall and Hofstede (Anita Komlodi) - Dervin's Sense-Making (Tonyia J. Tidline) - Diffusion Theory (Darian Lajoie-Paquette) - The Domain Analytic Approach to Scholars' Information Practices (Sanna Talja) - Ecological Theory of Human Information Behavior (Kirsty Williamson) - Elicitation as Micro-Level Information Seeking (Mei-Mei Wu) - Ellis's Model of InformationSeeking Behavior (David Ellis) - Everyday Life Information Seeking (Reijo Savolainen) - Face Threat (Lorri Mon) - Flow Theory (Charles Naumer) - General Model of the Information Seeking of Professionals (Gloria J. Leckie) - The Imposed Query (Melissa Gross) - Information Acquiringand-Sharing (Kevin Rioux) - Information Activities in Work Tasks (Katriina Byström) - Information Encountering (Sanda Erdelez) - Information Grounds (Karen E. Fisher) - Information Horizons (Diane H. Sonnenwald) - Information Intents (Ross J. Todd) - Information Interchange (Rita Marcella and Graeme Baxter) - Institutional Ethnography (Roz Stooke) - Integrative Framework for Information Seeking and Interactive Information Retrieval (Peter Ingwersen) - Interpretative Repertoires (Pamela J. McKenzie) - Krikelas's Model of Information Seeking (Jean Henefer and Crystal Fulton) - Kuhlthau's Information Search Process (Carol Collier Kuhlthau) - Library Anxiety (Patricia Katopol) - Monitoring and Blunting (Lynda M. Baker) - Motivational Factors for Interface Design (Carolyn Watters and Jack Duffy) - Network Gatekeeping (Karine Barzilai-Nahon) - Nonlinear Information Seeking (Allen Foster) - Optimal Foraging (JoAnn Jacoby) - Organizational Sense Making and Information Use (Anu Maclntosh-Murray) - The PAIN Hypothesis (Harry Bruce) -

0.007852051 = product of:
  0.023556152 = sum of:
    0.023556152 = weight(_text_:query in 92) [ClassicSimilarity], result of:
      0.023556152 = score(doc=92,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.10269914 = fieldWeight in 92, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.015625 = fieldNorm(doc=92)
  0.33333334 = coord(1/3)

Content

Information representation and retrieval : an overview -- Information representation I : basic approaches -- Information representation II : related topics -- Language in information representation and retrieval -- Retrieval techniques and query representation -- Retrieval approaches -- Information retrieval models -- Information retrieval systems -- Retrieval of information unique in content or format -- The user dimension in information representation and retrieval -- Evaluation of information representation and retrieval -- Artificial intelligence in information representation and retrieval.

0.007852051 = product of:
  0.023556152 = sum of:
    0.023556152 = weight(_text_:query in 172) [ClassicSimilarity], result of:
      0.023556152 = score(doc=172,freq=2.0), product of:
        0.22937049 = queryWeight, product of:
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.049352113 = queryNorm
        0.10269914 = fieldWeight in 172, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.6476326 = idf(docFreq=1151, maxDocs=44218)
          0.015625 = fieldNorm(doc=172)
  0.33333334 = coord(1/3)

Content

SESSION: Federating and harvesting metadata DP9: an OAI gateway service for web crawlers (Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson) - The Greenstone plugin architecture (Ian H. Witten, David Bainbridge, Gordon Paynter, Stefan Boddie) - Building FLOW: federating libraries on the web (Anna Keller Gold, Karen S. Baker, Jean-Yves LeMeur, Kim Baldridge) - JAFER ToolKit project: interfacing Z39.50 and XML (Antony Corfield, Matthew Dovey, Richard Mawby, Colin Tatham) - Schema extraction from XML collections (Boris Chidlovskii) - Mirroring an OAI archive on the I2-DSI channel (Ashwini Pande, Malini Kothapalli, Ryan Richardson, Edward A. Fox) SESSION: Music digital libraries HMM-based musical query retrieval (Jonah Shifrin, Bryan Pardo, Colin Meek, William Birmingham) - A comparison of melodic database retrieval techniques using sung queries (Ning Hu, Roger B. Dannenberg) - Enhancing access to the levy sheet music collection: reconstructing full-text lyrics from syllables (Brian Wingenroth, Mark Patton, Tim DiLauro) - Evaluating automatic melody segmentation aimed at music information retrieval (Massimo Melucci, Nicola Orio) SESSION: Preserving, securing, and assessing digital libraries A methodology and system for preserving digital data (Raymond A. Lorie) - Modeling web data (James C. French) - An evaluation model for a digital library services tool (Jim Dorward, Derek Reinke, Mimi Recker) - Why watermark?: the copyright need for an engineering solution (Michael Seadle, J. R. Deller, Jr., Aparna Gurijala) SESSION: Image and cultural digital libraries Time as essence for photo browsing through personal digital libraries (Adrian Graham, Hector Garcia-Molina, Andreas Paepcke, Terry Winograd) - Toward a distributed terabyte text retrieval system in China-US million book digital library (Bin Liu, Wen Gao, Ling Zhang, Tie-jun Huang, Xiao-ming Zhang, Jun Cheng) - Enhanced perspectives for historical and cultural documentaries using informedia technologies (Howard D. Wactlar, Ching-chih Chen) - Interfaces for palmtop image search (Mark Derthick)

0.0055721086 = product of:
  0.016716326 = sum of:
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 1397) [ClassicSimilarity], result of:
          0.03343265 = score(doc=1397,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.19345059 = fieldWeight in 1397, 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=1397)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 3.2008 14:29:25

0.0055721086 = product of:
  0.016716326 = sum of:
    0.016716326 = product of:
      0.03343265 = sum of:
        0.03343265 = weight(_text_:22 in 1708) [ClassicSimilarity], result of:
          0.03343265 = score(doc=1708,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.19345059 = fieldWeight in 1708, 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=1708)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 3.2008 16:15:37

0.0048255883 = product of:
  0.014476764 = sum of:
    0.014476764 = product of:
      0.028953528 = sum of:
        0.028953528 = weight(_text_:22 in 150) [ClassicSimilarity], result of:
          0.028953528 = score(doc=150,freq=6.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.16753313 = fieldWeight in 150, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.01953125 = fieldNorm(doc=150)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Classification

006.7 22

Date

7. 3.2007 19:30:22

DDC

006.7 22

0.004457687 = product of:
  0.013373061 = sum of:
    0.013373061 = product of:
      0.026746122 = sum of:
        0.026746122 = weight(_text_:22 in 2249) [ClassicSimilarity], result of:
          0.026746122 = score(doc=2249,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.15476047 = fieldWeight in 2249, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2249)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 3.2008 18:05:16

0.004457687 = product of:
  0.013373061 = sum of:
    0.013373061 = product of:
      0.026746122 = sum of:
        0.026746122 = weight(_text_:22 in 2426) [ClassicSimilarity], result of:
          0.026746122 = score(doc=2426,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.15476047 = fieldWeight in 2426, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2426)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.004457687 = product of:
  0.013373061 = sum of:
    0.013373061 = product of:
      0.026746122 = sum of:
        0.026746122 = weight(_text_:22 in 2428) [ClassicSimilarity], result of:
          0.026746122 = score(doc=2428,freq=2.0), product of:
            0.1728227 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.049352113 = queryNorm
            0.15476047 = fieldWeight in 2428, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2428)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)