Search (83 results, page 1 of 5)

0.08046646 = product of:
  0.12069968 = sum of:
    0.09773055 = weight(_text_:web in 1026) [ClassicSimilarity], result of:
      0.09773055 = score(doc=1026,freq=12.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.6182494 = fieldWeight in 1026, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1026)
    0.022969136 = product of:
      0.045938272 = sum of:
        0.045938272 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
          0.045938272 = score(doc=1026,freq=2.0), product of:
            0.16961981 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.048437484 = queryNorm
            0.2708308 = fieldWeight in 1026, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1026)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

We have created software applications that allow users to both author and use Semantic Web metadata. To create and use a layer of semantic content on top of the existing Web, we have (1) implemented a user interface that expedites the task of attributing metadata to resources on the Web, and (2) augmented a Web browser to leverage this semantic metadata to provide relevant information and tasks to the user. This project provides a framework for annotating and reorganizing existing files, pages, and sites on the Web that is similar to Vannevar Bushrsquos original concepts of trail blazing and associative indexing.

Source

Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003

Theme

Semantic Web

0.061383378 = product of:
  0.092075065 = sum of:
    0.06910593 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
      0.06910593 = score(doc=1319,freq=6.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.43716836 = fieldWeight in 1319, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.022969136 = product of:
      0.045938272 = sum of:
        0.045938272 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
          0.045938272 = score(doc=1319,freq=2.0), product of:
            0.16961981 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.048437484 = queryNorm
            0.2708308 = fieldWeight in 1319, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1319)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web

Date

1. 8.1996 22:08:06

Footnote

Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia

0.051740434 = product of:
  0.07761065 = sum of:
    0.06448543 = weight(_text_:web in 1626) [ClassicSimilarity], result of:
      0.06448543 = score(doc=1626,freq=16.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.4079388 = fieldWeight in 1626, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=1626)
    0.01312522 = product of:
      0.02625044 = sum of:
        0.02625044 = weight(_text_:22 in 1626) [ClassicSimilarity], result of:
          0.02625044 = score(doc=1626,freq=2.0), product of:
            0.16961981 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.048437484 = queryNorm
            0.15476047 = fieldWeight in 1626, 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=1626)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Purpose - The growing volumes of semantic data available in the web result in the need for handling the information overload phenomenon. The potential of this amount of data is enormous but in most cases it is very difficult for users to visualize, explore and use this data, especially for lay-users without experience with Semantic Web technologies. The paper aims to discuss these issues. Design/methodology/approach - The Visual Information-Seeking Mantra "Overview first, zoom and filter, then details-on-demand" proposed by Shneiderman describes how data should be presented in different stages to achieve an effective exploration. The overview is the first user task when dealing with a data set. The objective is that the user is capable of getting an idea about the overall structure of the data set. Different information architecture (IA) components supporting the overview tasks have been developed, so they are automatically generated from semantic data, and evaluated with end-users. Findings - The chosen IA components are well known to web users, as they are present in most web pages: navigation bars, site maps and site indexes. The authors complement them with Treemaps, a visualization technique for displaying hierarchical data. These components have been developed following an iterative User-Centered Design methodology. Evaluations with end-users have shown that they get easily used to them despite the fact that they are generated automatically from structured data, without requiring knowledge about the underlying semantic technologies, and that the different overview components complement each other as they focus on different information search needs. Originality/value - Obtaining semantic data sets overviews cannot be easily done with the current semantic web browsers. Overviews become difficult to achieve with large heterogeneous data sets, which is typical in the Semantic Web, because traditional IA techniques do not easily scale to large data sets. There is little or no support to obtain overview information quickly and easily at the beginning of the exploration of a new data set. This can be a serious limitation when exploring a data set for the first time, especially for lay-users. The proposal is to reuse and adapt existing IA components to provide this overview to users and show that they can be generated automatically from the thesaurus and ontologies that structure semantic data while providing a comparable user experience to traditional web sites.

Date

20. 1.2015 18:30:22

Theme

Semantic Web

0.037806615 = product of:
  0.056709923 = sum of:
    0.040303398 = weight(_text_:web in 1343) [ClassicSimilarity], result of:
      0.040303398 = score(doc=1343,freq=4.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.25496176 = fieldWeight in 1343, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1343)
    0.016406527 = product of:
      0.032813054 = sum of:
        0.032813054 = weight(_text_:22 in 1343) [ClassicSimilarity], result of:
          0.032813054 = score(doc=1343,freq=2.0), product of:
            0.16961981 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.048437484 = queryNorm
            0.19345059 = fieldWeight in 1343, 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=1343)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

A substantial fraction of web search queries contain references to entities, such as persons, organizations, and locations. Recently, methods that exploit named entities have been shown to be more effective for query expansion than traditional pseudorelevance feedback methods. In this article, we introduce a supervised learning approach that exploits named entities for query expansion using Wikipedia as a repository of high-quality feedback documents. In contrast with existing entity-oriented pseudorelevance feedback approaches, we tackle query expansion as a learning-to-rank problem. As a result, not only do we select effective expansion terms but we also weigh these terms according to their predicted effectiveness. To this end, we exploit the rich structure of Wikipedia articles to devise discriminative term features, including each candidate term's proximity to the original query terms, as well as its frequency across multiple article fields and in category and infobox descriptors. Experiments on three Text REtrieval Conference web test collections attest the effectiveness of our approach, with gains of up to 23.32% in terms of mean average precision, 19.49% in terms of precision at 10, and 7.86% in terms of normalized discounted cumulative gain compared with a state-of-the-art approach for entity-oriented query expansion.

Date

22. 8.2014 17:07:50

0.031506617 = product of:
  0.094519846 = sum of:
    0.094519846 = weight(_text_:web in 431) [ClassicSimilarity], result of:
      0.094519846 = score(doc=431,freq=22.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.59793836 = fieldWeight in 431, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=431)
  0.33333334 = coord(1/3)

Abstract

The birth of the Web has brought an exponential growth to the amount of the information that is freely available to the Internet population, overloading users and entangling their efforts to satisfy their information needs. Web search engines such Google, Yahoo, or Bing have become popular mainly due to the fact that they offer an easy-to-use query interface (i.e., based on keywords) and an effective and efficient query execution mechanism. The majority of these search engines do not consider information stored on the deep or hidden Web [9,28], despite the fact that the size of the deep Web is estimated to be much bigger than the surface Web [9,47]. There have been a number of systems that record interactions with the deep Web sources or automatically submit queries them (mainly through their Web form interfaces) in order to index their context. Unfortunately, this technique is only partially indexing the data instance. Moreover, it is not possible to take advantage of the query capabilities of data sources, for example, of the relational query features, because their interface is often restricted from the Web form. Besides, Web search engines focus on retrieving documents and not on querying structured sources, so they are unable to access information based on concepts.

Source

Semantic search over the Web. Eds.: R. De Virgilio, et al

Theme

Semantic Web

0.030160304 = product of:
  0.09048091 = sum of:
    0.09048091 = weight(_text_:web in 3090) [ClassicSimilarity], result of:
      0.09048091 = score(doc=3090,freq=14.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.57238775 = fieldWeight in 3090, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=3090)
  0.33333334 = coord(1/3)

Abstract

Recent Web-searching and -mining tools are combining text and link analysis to improve ranking and crawling algorithms. The central assumption behind such approaches is that there is a correiation between the graph structure of the Web and the text and meaning of pages. Here I formalize and empirically evaluate two general conjectures drawing connections from link information to lexical and semantic Web content. The link-content conjecture states that a page is similar to the pages that link to it, and the link-cluster conjecture that pages about the same topic are clustered together. These conjectures are offen simply assumed to hold, and Web search tools are built an such assumptions. The present quantitative confirmation sheds light an the connection between the success of the latest Web-mining techniques and the small world topology of the Web, with encouraging implications for the design of better crawling algorithms.

0.030160304 = product of:
  0.09048091 = sum of:
    0.09048091 = weight(_text_:web in 3310) [ClassicSimilarity], result of:
      0.09048091 = score(doc=3310,freq=14.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.57238775 = fieldWeight in 3310, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=3310)
  0.33333334 = coord(1/3)

Abstract

Introducing context to a user query is effective to improve the search effectiveness. In this article we propose a method employing the taxonomy-based search services such as Web directories to facilitate searches in any Web search interfaces that support Boolean queries. The proposed method enables one to convey current search context an taxonomy of a taxonomy-based search service to the searches conducted with the Web search interfaces. The basic idea is to learn the search context in the form of a Boolean condition that is commonly accepted by many Web search interfaces, and to use the condition to modify the user query before forwarding it to the Web search interfaces. To guarantee that the modified query can always be processed by the Web search interfaces and to make the method adaptive to different user requirements an search result effectiveness, we have developed new fast classification learning algorithms.

0.029936887 = product of:
  0.04490533 = sum of:
    0.028498804 = weight(_text_:web in 56) [ClassicSimilarity], result of:
      0.028498804 = score(doc=56,freq=2.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.18028519 = fieldWeight in 56, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=56)
    0.016406527 = product of:
      0.032813054 = sum of:
        0.032813054 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
          0.032813054 = score(doc=56,freq=2.0), product of:
            0.16961981 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.048437484 = queryNorm
            0.19345059 = fieldWeight in 56, 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=56)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.

Date

22. 7.2006 16:32:43

0.025490109 = product of:
  0.07647032 = sum of:
    0.07647032 = weight(_text_:web in 5698) [ClassicSimilarity], result of:
      0.07647032 = score(doc=5698,freq=10.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.48375595 = fieldWeight in 5698, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
  0.33333334 = coord(1/3)

Abstract

Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages

0.025205292 = product of:
  0.075615875 = sum of:
    0.075615875 = weight(_text_:web in 411) [ClassicSimilarity], result of:
      0.075615875 = score(doc=411,freq=22.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.47835067 = fieldWeight in 411, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=411)
  0.33333334 = coord(1/3)

Abstract

The Web has become the world's largest database, with search being the main tool that allows organizations and individuals to exploit its huge amount of information. Search on the Web has been traditionally based on textual and structural similarities, ignoring to a large degree the semantic dimension, i.e., understanding the meaning of the query and of the document content. Combining search and semantics gives birth to the idea of semantic search. Traditional search engines have already advertised some semantic dimensions. Some of them, for instance, can enhance their generated result sets with documents that are semantically related to the query terms even though they may not include these terms. Nevertheless, the exploitation of the semantic search has not yet reached its full potential. In this book, Roberto De Virgilio, Francesco Guerra and Yannis Velegrakis present an extensive overview of the work done in Semantic Search and other related areas. They explore different technologies and solutions in depth, making their collection a valuable and stimulating reading for both academic and industrial researchers. The book is divided into three parts. The first introduces the readers to the basic notions of the Web of Data. It describes the different kinds of data that exist, their topology, and their storing and indexing techniques. The second part is dedicated to Web Search. It presents different types of search, like the exploratory or the path-oriented, alongside methods for their efficient and effective implementation. Other related topics included in this part are the use of uncertainty in query answering, the exploitation of ontologies, and the use of semantics in mashup design and operation. The focus of the third part is on linked data, and more specifically, on applying ideas originating in recommender systems on linked data management, and on techniques for the efficiently querying answering on linked data.

Content

Inhalt: Introduction.- Part I Introduction to Web of Data.- Topology of the Web of Data.- Storing and Indexing Massive RDF Data Sets.- Designing Exploratory Search Applications upon Web Data Sources.- Part II Search over the Web.- Path-oriented Keyword Search query over RDF.- Interactive Query Construction for Keyword Search on the SemanticWeb.- Understanding the Semantics of Keyword Queries on Relational DataWithout Accessing the Instance.- Keyword-Based Search over Semantic Data.- Semantic Link Discovery over Relational Data.- Embracing Uncertainty in Entity Linking.- The Return of the Entity-Relationship Model: Ontological Query Answering.- Linked Data Services and Semantics-enabled Mashup.- Part III Linked Data Search engines.- A Recommender System for Linked Data.- Flint: from Web Pages to Probabilistic Semantic Data.- Searching and Browsing Linked Data with SWSE.

Theme

Semantic Web

0.022799043 = product of:
  0.06839713 = sum of:
    0.06839713 = weight(_text_:web in 2236) [ClassicSimilarity], result of:
      0.06839713 = score(doc=2236,freq=8.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.43268442 = fieldWeight in 2236, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2236)
  0.33333334 = coord(1/3)

Abstract

Collection sizes, query rates, and the number of users of Web search engines are increasing. Therefore, there is continued demand for innovation in providing search services that meet user information needs. In this article, we propose new techniques to add additional terms to documents with the goal of providing more accurate searches. Our techniques are based an query association, where queries are stored with documents that are highly similar statistically. We show that adding query associations to documents improves the accuracy of Web topic finding searches by up to 7%, and provides an excellent complement to existing supplement techniques for site finding. We conclude that using document surrogates derived from query association is a valuable new technique for accurate Web searching.

0.022799043 = product of:
  0.06839713 = sum of:
    0.06839713 = weight(_text_:web in 2591) [ClassicSimilarity], result of:
      0.06839713 = score(doc=2591,freq=18.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.43268442 = fieldWeight in 2591, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=2591)
  0.33333334 = coord(1/3)

Abstract

This study examined the success and information seeking behaviors of seventh-grade science students and graduate students in information science in using Yahooligans! Web search engine/directory. It investigated these users' cognitive, affective, and physical behaviors as they sought the answer for a fact-finding task. It analyzed and compared the overall patterns of children's and graduate students' Web activities, including searching moves, browsing moves, backtracking moves, looping moves, screen scrolling, target location and deviation moves, and the time they took to complete the task. The authors applied Bilal's Web Traversal Measure to quantify these users' effectiveness, efficiency, and quality of moves they made. Results were based on 14 children's Web sessions and nine graduate students' sessions. Both groups' Web activities were captured online using Lotus ScreenCam, a software package that records and replays online activities in Web browsers. Children's affective states were captured via exit interviews. Graduate students' affective states were extracted from the journal writings they kept during the traversal process. The study findings reveal that 89% of the graduate students found the correct answer to the search task as opposed to 50% of the children. Based on the Measure, graduate students' weighted effectiveness, efficiency, and quality of the Web moves they made were much higher than those of the children. Regardless of success and weighted scores, however, similarities and differences in information seeking were found between the two groups. Yahooligans! poor structure of keyword searching was a major factor that contributed to the "breakdowns" children and graduate students experienced. Unlike children, graduate students were able to recover from "breakdowns" quickly and effectively. Three main factors influenced these users' performance: ability to recover from "breakdowns", navigational style, and focus on task. Children and graduate students made recommendations for improving Yahooligans! interface design. Implications for Web user training and system design improvements are made.

0.021495145 = product of:
  0.06448543 = sum of:
    0.06448543 = weight(_text_:web in 530) [ClassicSimilarity], result of:
      0.06448543 = score(doc=530,freq=4.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.4079388 = fieldWeight in 530, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0625 = fieldNorm(doc=530)
  0.33333334 = coord(1/3)

Abstract

Das WWW ist dumm. Ein neuer Ansatz soll jetzt dafür sorgen, dass Maschinen Bedeutungen erfassen und Informationen richtig einordnen können. Das ist noch nicht alles: Wenn die Server erst mal das Verstehen gelernt haben sollten, würden sie auch in der Lage sein, uns von den Ergebnissen ihrer Plaudereien untereinander zu berichten - das 'semantische Web' wäre geboren

0.021495145 = product of:
  0.06448543 = sum of:
    0.06448543 = weight(_text_:web in 428) [ClassicSimilarity], result of:
      0.06448543 = score(doc=428,freq=16.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.4079388 = fieldWeight in 428, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=428)
  0.33333334 = coord(1/3)

Abstract

Search is the preferred method to access information in today's computing systems. The Web, accessed through search engines, is universally recognized as the source for answering users' information needs. However, offering a link to a Web page does not cover all information needs. Even simple problems, such as "Which theater offers an at least three-stars action movie in London close to a good Italian restaurant," can only be solved by searching the Web multiple times, e.g., by extracting a list of the recent action movies filtered by ranking, then looking for movie theaters, then looking for Italian restaurants close to them. While search engines hint to useful information, the user's brain is the fundamental platform for information integration. An important trend is the availability of new, specialized data sources-the so-called "long tail" of the Web of data. Such carefully collected and curated data sources can be much more valuable than information currently available in Web pages; however, many sources remain hidden or insulated, in the lack of software solutions for bringing them to surface and making them usable in the search context. A new class of tailor-made systems, designed to satisfy the needs of users with specific aims, will support the publishing and integration of data sources for vertical domains; the user will be able to select sources based on individual or collective trust, and systems will be able to route queries to such sources and to provide easyto-use interfaces for combining them within search strategies, at the same time, rewarding the data source owners for each contribution to effective search. Efforts such as Google's Fusion Tables show that the technology for bringing hidden data sources to surface is feasible.

Source

Semantic search over the Web. Eds.: R. De Virgilio, et al

Theme

Semantic Web

0.021241754 = product of:
  0.06372526 = sum of:
    0.06372526 = weight(_text_:web in 1905) [ClassicSimilarity], result of:
      0.06372526 = score(doc=1905,freq=10.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.40312994 = fieldWeight in 1905, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1905)
  0.33333334 = coord(1/3)

Abstract

Purpose - The paper aims to argue that digital library retrieval should be based on semantic representations and propose a semantic infrastructure for digital libraries. Design/methodology/approach - The approach taken is formal model based on subject representation for digital libraries. Findings - Search engines and search techniques have fallen short of user expectations as they do not give context based retrieval. Deploying semantic web technologies would lead to efficient and more precise representation of digital library content and hence better retrieval. Though digital libraries often have metadata of information resources which can be accessed through OAI-PMH, much remains to be accomplished in making digital libraries semantic web compliant. This paper presents a semantic infrastructure for digital libraries, that will go a long way in providing them and web based information services with products highly customised to users needs. Research limitations/implications - Here only a model for semantic infrastructure is proposed. This model is proposed after studying current user-centric, top-down models adopted in digital library service architectures. Originality/value - This paper gives a generic model for building semantic infrastructure for digital libraries. Faceted ontologies for digital libraries is just one approach. But the same may be adopted by groups working with different approaches in building ontologies to realise efficient retrieval in digital libraries.

Footnote

Beitrag eines Themenheftes "Digital libraries and the semantic web: context, applications and research".

Theme

Semantic Web

0.021241754 = product of:
  0.06372526 = sum of:
    0.06372526 = weight(_text_:web in 3188) [ClassicSimilarity], result of:
      0.06372526 = score(doc=3188,freq=10.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.40312994 = fieldWeight in 3188, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3188)
  0.33333334 = coord(1/3)

Abstract

Across the world, millions of users interact with search engines every day to satisfy their information needs. As the Web grows bigger over time, such information needs, manifested through user search queries, also become more complex. However, there has been no systematic study that quantifies the structural complexity of Web search queries. In this research, we make an attempt towards understanding and characterizing the syntactic complexity of search queries using a multi-pronged approach. We use traditional statistical language modeling techniques to quantify and compare the perplexity of queries with natural language (NL). We then use complex network analysis for a comparative analysis of the topological properties of queries issued by real Web users and those generated by statistical models. Finally, we conduct experiments to study whether search engine users are able to identify real queries, when presented along with model-generated ones. The three complementary studies show that the syntactic structure of Web queries is more complex than what n-grams can capture, but simpler than NL. Queries, thus, seem to represent an intermediate stage between syntactic and non-syntactic communication.

0.019744553 = product of:
  0.059233658 = sum of:
    0.059233658 = weight(_text_:web in 2091) [ClassicSimilarity], result of:
      0.059233658 = score(doc=2091,freq=6.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.37471575 = fieldWeight in 2091, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2091)
  0.33333334 = coord(1/3)

Abstract

The ever growing popularity of the Internet as a source of information, coupled with the accompanying growth in the number of documents made available through the World Wide Web, is leading to an increasing demand for more efficient and accurate information retrieval tools. Numerous techniques have been proposed and tried for improving the effectiveness of searching the World Wide Web for documents relevant to a given topic of interest. The specification of appropriate keywords and phrases by the user is crucial for the successful execution of a query as measured by the relevance of documents retrieved. Lack of users' knowledge an the search topic and their changing information needs often make it difficult for them to find suitable keywords or phrases for a query. This results in searches that fail to cover all likely aspects of the topic of interest. We describe a scheme that attempts to remedy this situation by automatically expanding the user query through the analysis of initially retrieved documents. Experimental results to demonstrate the effectiveness of the query expansion scheure are presented.

0.018999204 = product of:
  0.05699761 = sum of:
    0.05699761 = weight(_text_:web in 1615) [ClassicSimilarity], result of:
      0.05699761 = score(doc=1615,freq=8.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.36057037 = fieldWeight in 1615, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1615)
  0.33333334 = coord(1/3)

Abstract

The Medical professionals and researchers need information from reputable sources to accomplish their work. Unfortunately, the Web has a large number of documents that are irrelevant to their work, even those documents that purport to be "medically-related." This paper describes an architecture designed to integrate advanced searching and indexing algorithms, an automatic thesaurus, or "concept space," and Kohonen-based Self-Organizing Map (SOM) technologies to provide searchers with finegrained results. Initial results indicate that these systems provide complementary retrieval functionalities. HelpfulMed not only allows users to search Web pages and other online databases, but also allows them to build searches through the use of an automatic thesaurus and browse a graphical display of medical-related topics. Evaluation results for each of the different components are included. Our spidering algorithm outperformed both breadth-first search and PageRank spiders an a test collection of 100,000 Web pages. The automatically generated thesaurus performed as well as both MeSH and UMLS-systems which require human mediation for currency. Lastly, a variant of the Kohonen SOM was comparable to MeSH terms in perceived cluster precision and significantly better at perceived cluster recall.

Footnote

Teil eines Themenheftes: "Web retrieval and mining: A machine learning perspective"

0.018999204 = product of:
  0.05699761 = sum of:
    0.05699761 = weight(_text_:web in 2589) [ClassicSimilarity], result of:
      0.05699761 = score(doc=2589,freq=8.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.36057037 = fieldWeight in 2589, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2589)
  0.33333334 = coord(1/3)

Abstract

The emergence of general audience digital libraries (GADLs) defines a context that represents a hybrid of both "traditional" IR, using primarily bibliographic resources provided by database vendors, and "popular" IR, exemplified by public search systems available on the World Wide Web. Findings of a study investigating end-user searching and response to a GADL are reported. Data collected from a Web-based end-user survey and data logs of resource usage for a Web-based GADL were analyzed for user characteristics, patterns of access and use, and user feedback. Cross-tabulations using respondent demographics revealed several key differences in how the system was used and valued by users of different age groups. Older users valued the service more than younger users and engaged in different searching and viewing behaviors. The GADL more closely resembles traditional retrieval systems in terms of content and purpose of use, but is more similar to popular IR systems in terms of user behavior and accessibility. A model that defines the dual context of the GADL environment is derived from the data analysis and existing IR models in general and other specific contexts. The authors demonstrate the distinguishing characteristics of this IR context, and discuss implications for the development and evaluation of future GADLs to accommodate a variety of user needs and expectations.

0.018999204 = product of:
  0.05699761 = sum of:
    0.05699761 = weight(_text_:web in 430) [ClassicSimilarity], result of:
      0.05699761 = score(doc=430,freq=8.0), product of:
        0.15807624 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.048437484 = queryNorm
        0.36057037 = fieldWeight in 430, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=430)
  0.33333334 = coord(1/3)

Abstract

With the advance of the semantic Web, increasing amounts of data are available in a structured and machine-understandable form. This opens opportunities for users to employ semantic queries instead of simple keyword-based ones to accurately express the information need. However, constructing semantic queries is a demanding task for human users [11]. To compose a valid semantic query, a user has to (1) master a query language (e.g., SPARQL) and (2) acquire sufficient knowledge about the ontology or the schema of the data source. While there are systems which support this task with visual tools [21, 26] or natural language interfaces [3, 13, 14, 18], the process of query construction can still be complex and time consuming. According to [24], users prefer keyword search, and struggle with the construction of semantic queries although being supported with a natural language interface. Several keyword search approaches have already been proposed to ease information seeking on semantic data [16, 32, 35] or databases [1, 31]. However, keyword queries lack the expressivity to precisely describe the user's intent. As a result, ranking can at best put query intentions of the majority on top, making it impossible to take the intentions of all users into consideration.

Source

Semantic search over the Web. Eds.: R. De Virgilio, et al

Theme

Semantic Web