Search (93 results, page 1 of 5)

0.08891679 = product of:
  0.2134003 = sum of:
    0.050840456 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
      0.050840456 = score(doc=1319,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.040716566 = weight(_text_:world in 1319) [ClassicSimilarity], result of:
      0.040716566 = score(doc=1319,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.29726875 = fieldWeight in 1319, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.05410469 = weight(_text_:wide in 1319) [ClassicSimilarity], result of:
      0.05410469 = score(doc=1319,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.342674 = fieldWeight in 1319, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.050840456 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
      0.050840456 = score(doc=1319,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.016898135 = product of:
      0.03379627 = sum of:
        0.03379627 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
          0.03379627 = score(doc=1319,freq=2.0), product of:
            0.12478739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035634913 = 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.41666666 = coord(5/12)

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.06736527 = product of:
  0.20209579 = sum of:
    0.043577533 = weight(_text_:web in 2091) [ClassicSimilarity], result of:
      0.043577533 = score(doc=2091,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.049355935 = weight(_text_:world in 2091) [ClassicSimilarity], result of:
      0.049355935 = score(doc=2091,freq=4.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.36034414 = fieldWeight in 2091, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.046875 = fieldNorm(doc=2091)
    0.06558479 = weight(_text_:wide in 2091) [ClassicSimilarity], result of:
      0.06558479 = score(doc=2091,freq=4.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.4153836 = fieldWeight in 2091, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=2091)
    0.043577533 = weight(_text_:web in 2091) [ClassicSimilarity], result of:
      0.043577533 = score(doc=2091,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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(4/12)

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.060475968 = product of:
  0.1814279 = sum of:
    0.07688942 = weight(_text_:filter in 1626) [ClassicSimilarity], result of:
      0.07688942 = score(doc=1626,freq=2.0), product of:
        0.24899386 = queryWeight, product of:
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.035634913 = queryNorm
        0.30880046 = fieldWeight in 1626, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.03125 = fieldNorm(doc=1626)
    0.047441207 = weight(_text_:web in 1626) [ClassicSimilarity], result of:
      0.047441207 = score(doc=1626,freq=16.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.047441207 = weight(_text_:web in 1626) [ClassicSimilarity], result of:
      0.047441207 = score(doc=1626,freq=16.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.009656077 = product of:
      0.019312155 = sum of:
        0.019312155 = weight(_text_:22 in 1626) [ClassicSimilarity], result of:
          0.019312155 = score(doc=1626,freq=2.0), product of:
            0.12478739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035634913 = 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.33333334 = coord(4/12)

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.05329041 = product of:
  0.127897 = sum of:
    0.03844471 = weight(_text_:filter in 4472) [ClassicSimilarity], result of:
      0.03844471 = score(doc=4472,freq=2.0), product of:
        0.24899386 = queryWeight, product of:
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.035634913 = queryNorm
        0.15440023 = fieldWeight in 4472, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.015625 = fieldNorm(doc=4472)
    0.023720603 = weight(_text_:web in 4472) [ClassicSimilarity], result of:
      0.023720603 = score(doc=4472,freq=16.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.2039694 = fieldWeight in 4472, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.015625 = fieldNorm(doc=4472)
    0.020149475 = weight(_text_:world in 4472) [ClassicSimilarity], result of:
      0.020149475 = score(doc=4472,freq=6.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.14710988 = fieldWeight in 4472, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.015625 = fieldNorm(doc=4472)
    0.021861596 = weight(_text_:wide in 4472) [ClassicSimilarity], result of:
      0.021861596 = score(doc=4472,freq=4.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.1384612 = fieldWeight in 4472, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.015625 = fieldNorm(doc=4472)
    0.023720603 = weight(_text_:web in 4472) [ClassicSimilarity], result of:
      0.023720603 = score(doc=4472,freq=16.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.2039694 = fieldWeight in 4472, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.015625 = fieldNorm(doc=4472)
  0.41666666 = coord(5/12)

Abstract

Depuis son apparition au début des années 90, le World Wide Web (WWW ou Web) a offert un accès universel aux connaissances et le monde de l'information a été principalement témoin d'une grande révolution (la révolution numérique). Il est devenu rapidement très populaire, ce qui a fait de lui la plus grande et vaste base de données et de connaissances existantes grâce à la quantité et la diversité des données qu'il contient. Cependant, l'augmentation et l'évolution considérables de ces données soulèvent d'importants problèmes pour les utilisateurs notamment pour l'accès aux documents les plus pertinents à leurs requêtes de recherche. Afin de faire face à cette explosion exponentielle du volume de données et faciliter leur accès par les utilisateurs, différents modèles sont proposés par les systèmes de recherche d'information (SRIs) pour la représentation et la recherche des documents web. Les SRIs traditionnels utilisent, pour indexer et récupérer ces documents, des mots-clés simples qui ne sont pas sémantiquement liés. Cela engendre des limites en termes de la pertinence et de la facilité d'exploration des résultats. Pour surmonter ces limites, les techniques existantes enrichissent les documents en intégrant des mots-clés externes provenant de différentes sources. Cependant, ces systèmes souffrent encore de limitations qui sont liées aux techniques d'exploitation de ces sources d'enrichissement. Lorsque les différentes sources sont utilisées de telle sorte qu'elles ne peuvent être distinguées par le système, cela limite la flexibilité des modèles d'exploration qui peuvent être appliqués aux résultats de recherche retournés par ce système. Les utilisateurs se sentent alors perdus devant ces résultats, et se retrouvent dans l'obligation de les filtrer manuellement pour sélectionner l'information pertinente. S'ils veulent aller plus loin, ils doivent reformuler et cibler encore plus leurs requêtes de recherche jusqu'à parvenir aux documents qui répondent le mieux à leurs attentes. De cette façon, même si les systèmes parviennent à retrouver davantage des résultats pertinents, leur présentation reste problématique. Afin de cibler la recherche à des besoins d'information plus spécifiques de l'utilisateur et améliorer la pertinence et l'exploration de ses résultats de recherche, les SRIs avancés adoptent différentes techniques de personnalisation de données qui supposent que la recherche actuelle d'un utilisateur est directement liée à son profil et/ou à ses expériences de navigation/recherche antérieures. Cependant, cette hypothèse ne tient pas dans tous les cas, les besoins de l'utilisateur évoluent au fil du temps et peuvent s'éloigner de ses intérêts antérieurs stockés dans son profil.
Dans d'autres cas, le profil de l'utilisateur peut être mal exploité pour extraire ou inférer ses nouveaux besoins en information. Ce problème est beaucoup plus accentué avec les requêtes ambigües. Lorsque plusieurs centres d'intérêt auxquels est liée une requête ambiguë sont identifiés dans le profil de l'utilisateur, le système se voit incapable de sélectionner les données pertinentes depuis ce profil pour répondre à la requête. Ceci a un impact direct sur la qualité des résultats fournis à cet utilisateur. Afin de remédier à quelques-unes de ces limitations, nous nous sommes intéressés dans ce cadre de cette thèse de recherche au développement de techniques destinées principalement à l'amélioration de la pertinence des résultats des SRIs actuels et à faciliter l'exploration de grandes collections de documents. Pour ce faire, nous proposons une solution basée sur un nouveau concept d'indexation et de recherche d'information appelé la projection multi-espaces. Cette proposition repose sur l'exploitation de différentes catégories d'information sémantiques et sociales qui permettent d'enrichir l'univers de représentation des documents et des requêtes de recherche en plusieurs dimensions d'interprétations. L'originalité de cette représentation est de pouvoir distinguer entre les différentes interprétations utilisées pour la description et la recherche des documents. Ceci donne une meilleure visibilité sur les résultats retournés et aide à apporter une meilleure flexibilité de recherche et d'exploration, en donnant à l'utilisateur la possibilité de naviguer une ou plusieurs vues de données qui l'intéressent le plus. En outre, les univers multidimensionnels de représentation proposés pour la description des documents et l'interprétation des requêtes de recherche aident à améliorer la pertinence des résultats de l'utilisateur en offrant une diversité de recherche/exploration qui aide à répondre à ses différents besoins et à ceux des autres différents utilisateurs. Cette étude exploite différents aspects liés à la recherche personnalisée et vise à résoudre les problèmes engendrés par l'évolution des besoins en information de l'utilisateur. Ainsi, lorsque le profil de cet utilisateur est utilisé par notre système, une technique est proposée et employée pour identifier les intérêts les plus représentatifs de ses besoins actuels dans son profil. Cette technique se base sur la combinaison de trois facteurs influents, notamment le facteur contextuel, fréquentiel et temporel des données. La capacité des utilisateurs à interagir, à échanger des idées et d'opinions, et à former des réseaux sociaux sur le Web, a amené les systèmes à s'intéresser aux types d'interactions de ces utilisateurs, au niveau d'interaction entre eux ainsi qu'à leurs rôles sociaux dans le système. Ces informations sociales sont abordées et intégrées dans ce travail de recherche. L'impact et la manière de leur intégration dans le processus de RI sont étudiés pour améliorer la pertinence des résultats.
Since its appearance in the early 90's, the World Wide Web (WWW or Web) has provided universal access to knowledge and the world of information has been primarily witness to a great revolution (the digital revolution). It quickly became very popular, making it the largest and most comprehensive database and knowledge base thanks to the amount and diversity of data it contains. However, the considerable increase and evolution of these data raises important problems for users, in particular for accessing the documents most relevant to their search queries. In order to cope with this exponential explosion of data volume and facilitate their access by users, various models are offered by information retrieval systems (IRS) for the representation and retrieval of web documents. Traditional SRIs use simple keywords that are not semantically linked to index and retrieve these documents. This creates limitations in terms of the relevance and ease of exploration of results. To overcome these limitations, existing techniques enrich documents by integrating external keywords from different sources. However, these systems still suffer from limitations that are related to the exploitation techniques of these sources of enrichment. When the different sources are used so that they cannot be distinguished by the system, this limits the flexibility of the exploration models that can be applied to the results returned by this system. Users then feel lost to these results, and find themselves forced to filter them manually to select the relevant information. If they want to go further, they must reformulate and target their search queries even more until they reach the documents that best meet their expectations. In this way, even if the systems manage to find more relevant results, their presentation remains problematic. In order to target research to more user-specific information needs and improve the relevance and exploration of its research findings, advanced SRIs adopt different data personalization techniques that assume that current research of user is directly related to his profile and / or previous browsing / search experiences.
However, this assumption does not hold in all cases, the needs of the user evolve over time and can move away from his previous interests stored in his profile. In other cases, the user's profile may be misused to extract or infer new information needs. This problem is much more accentuated with ambiguous queries. When multiple POIs linked to a search query are identified in the user's profile, the system is unable to select the relevant data from that profile to respond to that request. This has a direct impact on the quality of the results provided to this user. In order to overcome some of these limitations, in this research thesis, we have been interested in the development of techniques aimed mainly at improving the relevance of the results of current SRIs and facilitating the exploration of major collections of documents. To do this, we propose a solution based on a new concept and model of indexing and information retrieval called multi-spaces projection. This proposal is based on the exploitation of different categories of semantic and social information that enrich the universe of document representation and search queries in several dimensions of interpretations. The originality of this representation is to be able to distinguish between the different interpretations used for the description and the search for documents. This gives a better visibility on the results returned and helps to provide a greater flexibility of search and exploration, giving the user the ability to navigate one or more views of data that interest him the most. In addition, the proposed multidimensional representation universes for document description and search query interpretation help to improve the relevance of the user's results by providing a diversity of research / exploration that helps meet his diverse needs and those of other different users. This study exploits different aspects that are related to the personalized search and aims to solve the problems caused by the evolution of the information needs of the user. Thus, when the profile of this user is used by our system, a technique is proposed and used to identify the interests most representative of his current needs in his profile. This technique is based on the combination of three influential factors, including the contextual, frequency and temporal factor of the data. The ability of users to interact, exchange ideas and opinions, and form social networks on the Web, has led systems to focus on the types of interactions these users have at the level of interaction between them as well as their social roles in the system. This social information is discussed and integrated into this research work. The impact and how they are integrated into the IR process are studied to improve the relevance of the results.

0.051175587 = product of:
  0.15352675 = sum of:
    0.02935275 = weight(_text_:web in 2933) [ClassicSimilarity], result of:
      0.02935275 = score(doc=2933,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.25239927 = fieldWeight in 2933, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2933)
    0.040716566 = weight(_text_:world in 2933) [ClassicSimilarity], result of:
      0.040716566 = score(doc=2933,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.29726875 = fieldWeight in 2933, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2933)
    0.05410469 = weight(_text_:wide in 2933) [ClassicSimilarity], result of:
      0.05410469 = score(doc=2933,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.342674 = fieldWeight in 2933, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2933)
    0.02935275 = weight(_text_:web in 2933) [ClassicSimilarity], result of:
      0.02935275 = score(doc=2933,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.25239927 = fieldWeight in 2933, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2933)
  0.33333334 = coord(4/12)

Content

Vortrag, "Semantics, Analytics, Visualisation: Enhancing Scholarly Data Workshop co-located with the 25th International World Wide Web Conference April 11, 2016 - Montreal, Canada", Montreal 2016.

0.050531488 = product of:
  0.15159446 = sum of:
    0.0419325 = weight(_text_:web in 2589) [ClassicSimilarity], result of:
      0.0419325 = score(doc=2589,freq=8.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.029083263 = weight(_text_:world in 2589) [ClassicSimilarity], result of:
      0.029083263 = score(doc=2589,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.21233483 = fieldWeight in 2589, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2589)
    0.038646206 = weight(_text_:wide in 2589) [ClassicSimilarity], result of:
      0.038646206 = score(doc=2589,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.24476713 = fieldWeight in 2589, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2589)
    0.0419325 = weight(_text_:web in 2589) [ClassicSimilarity], result of:
      0.0419325 = score(doc=2589,freq=8.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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(4/12)

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.0483155 = product of:
  0.193262 = sum of:
    0.13455649 = weight(_text_:filter in 4471) [ClassicSimilarity], result of:
      0.13455649 = score(doc=4471,freq=2.0), product of:
        0.24899386 = queryWeight, product of:
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.035634913 = queryNorm
        0.5404008 = fieldWeight in 4471, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4471)
    0.02935275 = weight(_text_:web in 4471) [ClassicSimilarity], result of:
      0.02935275 = score(doc=4471,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.25239927 = fieldWeight in 4471, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4471)
    0.02935275 = weight(_text_:web in 4471) [ClassicSimilarity], result of:
      0.02935275 = score(doc=4471,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.25239927 = fieldWeight in 4471, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4471)
  0.25 = coord(3/12)

Abstract

We present an Information Retrieval System for scientific publications that provides the possibility to filter results according to semantic facets. We use sentence-level semantic annotations that identify specific semantic relations in texts, such as methods, definitions, hypotheses, that correspond to common information needs related to scientific literature. The semantic annotations are obtained using a rule-based method that identifies linguistic clues organized into a linguistic ontology. The system is implemented using Solr Search Server and offers efficient search and navigation in scientific papers.

Source

Semantic Web Evaluation Challenge. SemWebEval 2014 at ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014, Revised Selected Papers. Eds.: V. Presutti et al

0.042185247 = product of:
  0.16874099 = sum of:
    0.096111774 = weight(_text_:filter in 2208) [ClassicSimilarity], result of:
      0.096111774 = score(doc=2208,freq=2.0), product of:
        0.24899386 = queryWeight, product of:
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.035634913 = queryNorm
        0.38600057 = fieldWeight in 2208, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2208)
    0.03631461 = weight(_text_:web in 2208) [ClassicSimilarity], result of:
      0.03631461 = score(doc=2208,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.3122631 = fieldWeight in 2208, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2208)
    0.03631461 = weight(_text_:web in 2208) [ClassicSimilarity], result of:
      0.03631461 = score(doc=2208,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.3122631 = fieldWeight in 2208, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2208)
  0.25 = coord(3/12)

Abstract

The formal structure of the information on the Semantic Web lends itself to faceted browsing, an information retrieval method where users can filter results based on the values of properties ("facets"). Numerous faceted browsers have been created to browse RDF and Linked Data, but these systems use their own ontologies for defining how data is queried to populate their facets. Since the source data is the same format across these systems (specifically, RDF), we can unify the different methods of describing how to quer the underlying data, to enable compatibility across systems, and provide an extensible base ontology for future systems. To this end, we present FacetOntology, an ontology that defines how to query data to form a faceted browser, and a number of transformations and filters that can be applied to data before it is shown to users. FacetOntology overcomes limitations in the expressivity of existing work, by enabling the full expressivity of SPARQL when selecting data for facets. By applying a FacetOntology definition to data, a set of facets are specified, each with queries and filters to source RDF data, which enables faceted browsing systems to be created using that RDF data.

Theme

Semantic Web

0.04200787 = product of:
  0.16803148 = sum of:
    0.06656578 = weight(_text_:web in 3090) [ClassicSimilarity], result of:
      0.06656578 = score(doc=3090,freq=14.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.034899916 = weight(_text_:world in 3090) [ClassicSimilarity], result of:
      0.034899916 = score(doc=3090,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.25480178 = fieldWeight in 3090, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.046875 = fieldNorm(doc=3090)
    0.06656578 = weight(_text_:web in 3090) [ClassicSimilarity], result of:
      0.06656578 = score(doc=3090,freq=14.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.25 = coord(3/12)

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.040174168 = product of:
  0.16069667 = sum of:
    0.071899265 = weight(_text_:web in 1026) [ClassicSimilarity], result of:
      0.071899265 = score(doc=1026,freq=12.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.071899265 = weight(_text_:web in 1026) [ClassicSimilarity], result of:
      0.071899265 = score(doc=1026,freq=12.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.016898135 = product of:
      0.03379627 = sum of:
        0.03379627 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
          0.03379627 = score(doc=1026,freq=2.0), product of:
            0.12478739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035634913 = 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.25 = coord(3/12)

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.036854155 = product of:
  0.14741662 = sum of:
    0.056258354 = weight(_text_:web in 5698) [ClassicSimilarity], result of:
      0.056258354 = score(doc=5698,freq=10.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.034899916 = weight(_text_:world in 5698) [ClassicSimilarity], result of:
      0.034899916 = score(doc=5698,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.25480178 = fieldWeight in 5698, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
    0.056258354 = weight(_text_:web in 5698) [ClassicSimilarity], result of:
      0.056258354 = score(doc=5698,freq=10.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.25 = coord(3/12)

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

Source

Information world review. 1996, no.120, S.47-48

0.03655399 = product of:
  0.10966197 = sum of:
    0.02096625 = weight(_text_:web in 4913) [ClassicSimilarity], result of:
      0.02096625 = score(doc=4913,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.18028519 = fieldWeight in 4913, 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=4913)
    0.029083263 = weight(_text_:world in 4913) [ClassicSimilarity], result of:
      0.029083263 = score(doc=4913,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.21233483 = fieldWeight in 4913, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4913)
    0.038646206 = weight(_text_:wide in 4913) [ClassicSimilarity], result of:
      0.038646206 = score(doc=4913,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.24476713 = fieldWeight in 4913, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4913)
    0.02096625 = weight(_text_:web in 4913) [ClassicSimilarity], result of:
      0.02096625 = score(doc=4913,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.18028519 = fieldWeight in 4913, 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=4913)
  0.33333334 = coord(4/12)

Abstract

The growing availability of data in electronic form, the expansion of the World Wide Web and the accessibility of computational methods for large-scale data processing have allowed researchers in Information Retrieval (IR) to design systems which can effectively and efficiently constrain search within the boundaries given by context, thus transforming classical search into contextual search. Contextual Search: A Computational Framework introduces contextual search within a computational framework based on contextual variables, contextual factors and statistical models. It describes how statistical models can process contextual variables to infer the contextual factors underlying the current search context. It also provides background to the subject by: placing it among other surveys on relevance, interaction, context, and behaviour; providing a description of the contextual variables used for implementing the statistical models which represent and predict relevance and contextual factors; and providing an overview of the evaluation methodologies and findings relevant to this subject. Contextual Search: A Computational Framework is a highly recommended read, both for beginners who are embarking on research in this area and as a useful reference for established IR researchers.

0.030711796 = product of:
  0.122847185 = sum of:
    0.046881963 = weight(_text_:web in 3188) [ClassicSimilarity], result of:
      0.046881963 = score(doc=3188,freq=10.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.029083263 = weight(_text_:world in 3188) [ClassicSimilarity], result of:
      0.029083263 = score(doc=3188,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.21233483 = fieldWeight in 3188, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3188)
    0.046881963 = weight(_text_:web in 3188) [ClassicSimilarity], result of:
      0.046881963 = score(doc=3188,freq=10.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.25 = coord(3/12)

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.027500976 = product of:
  0.16500585 = sum of:
    0.13592258 = weight(_text_:filter in 1137) [ClassicSimilarity], result of:
      0.13592258 = score(doc=1137,freq=4.0), product of:
        0.24899386 = queryWeight, product of:
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.035634913 = queryNorm
        0.5458873 = fieldWeight in 1137, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          6.987357 = idf(docFreq=110, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1137)
    0.029083263 = weight(_text_:world in 1137) [ClassicSimilarity], result of:
      0.029083263 = score(doc=1137,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.21233483 = fieldWeight in 1137, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1137)
  0.16666667 = coord(2/12)

Abstract

Based on real-world user demands, we demonstrate how animated visualization of evolving text corpora displays the underlying dynamics of semantic content. To interpret the results, one needs a dynamic theory of word meaning. We suggest that conceptual dynamics as the interaction between kinds of intellectual and emotional content and language is key for such a theory. We demonstrate our method by two-way seriation, which is a popular technique to analyze groups of similar instances and their features as well as the connections between the groups themselves. The two-way seriated data may be visualized as a two-dimensional heat map or as a three-dimensional landscape in which color codes or height correspond to the values in the matrix. In this article, we focus on two-way seriation of sparse data in the Reuters-21568 test collection. To achieve a meaningful visualization, we introduce a compactly supported convolution kernel similar to filter kernels used in image reconstruction and geostatistics. This filter populates the high-dimensional sparse space with values that interpolate nearby elements and provides insight into the clustering structure. We also extend two-way seriation to deal with online updates of both the row and column spaces and, combined with the convolution kernel, demonstrate a three-dimensional visualization of dynamics.

0.024556493 = product of:
  0.09822597 = sum of:
    0.016773 = weight(_text_:web in 3478) [ClassicSimilarity], result of:
      0.016773 = score(doc=3478,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.14422815 = fieldWeight in 3478, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=3478)
    0.06467997 = weight(_text_:log in 3478) [ClassicSimilarity], result of:
      0.06467997 = score(doc=3478,freq=2.0), product of:
        0.22837062 = queryWeight, product of:
          6.4086204 = idf(docFreq=197, maxDocs=44218)
          0.035634913 = queryNorm
        0.2832237 = fieldWeight in 3478, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.4086204 = idf(docFreq=197, maxDocs=44218)
          0.03125 = fieldNorm(doc=3478)
    0.016773 = weight(_text_:web in 3478) [ClassicSimilarity], result of:
      0.016773 = score(doc=3478,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.14422815 = fieldWeight in 3478, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=3478)
  0.25 = coord(3/12)

Abstract

One of the problems faced by users of databases containing textual documents is the difficulty in retrieving relevant results due to the diverse vocabulary used in queries and contained in relevant documents, especially when there are only a small number of relevant documents. This problem is known as the Vocabulary Gap. The PIKES team have constructed a small test collection of 331 articles extracted from a blog and a Gold Standard for 35 queries selected from the blog's search log so the results of different approaches to semantic search can be compared. So far, prior approaches include recognising Named Entities in documents and queries, and relations including temporal relations, and represent them as `semantic layers' in a retrieval system index. In this work, we take two different approaches that do not involve Named Entity Recognition. In the first approach, we process an unannotated version of the PIKES document collection using Latent Semantic Analysis and use a combination of query coordination and automatic relevance feedback with which we outperform prior work. However, this approach is highly dependent on the underlying collection, and is not necessarily scalable to massive collections. In our second approach, we use an LSA Model generated by SEMILAR from a Wikipedia dump to generate a Term Similarity Matrix (TSM). We automatically expand the queries in the PIKES test collection with related terms from the TSM and submit them to a term-by-document matrix derived by indexing the PIKES collection using the Vector Space Model. Coupled with a combination of query coordination and automatic relevance feedback we also outperform prior work with this approach. The advantage of the second approach is that it is independent of the underlying document collection.

Series

Information Systems and Applications, incl. Internet/Web, and HCI; 10151

0.023179065 = product of:
  0.13907439 = sum of:
    0.06953719 = weight(_text_:web in 431) [ClassicSimilarity], result of:
      0.06953719 = score(doc=431,freq=22.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.06953719 = weight(_text_:web in 431) [ClassicSimilarity], result of:
      0.06953719 = score(doc=431,freq=22.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.16666667 = coord(2/12)

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.022188595 = product of:
  0.13313156 = sum of:
    0.06656578 = weight(_text_:web in 3310) [ClassicSimilarity], result of:
      0.06656578 = score(doc=3310,freq=14.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.06656578 = weight(_text_:web in 3310) [ClassicSimilarity], result of:
      0.06656578 = score(doc=3310,freq=14.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.16666667 = coord(2/12)

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.020144677 = product of:
  0.08057871 = sum of:
    0.02096625 = weight(_text_:web in 1338) [ClassicSimilarity], result of:
      0.02096625 = score(doc=1338,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.18028519 = fieldWeight in 1338, 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=1338)
    0.038646206 = weight(_text_:wide in 1338) [ClassicSimilarity], result of:
      0.038646206 = score(doc=1338,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.24476713 = fieldWeight in 1338, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1338)
    0.02096625 = weight(_text_:web in 1338) [ClassicSimilarity], result of:
      0.02096625 = score(doc=1338,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.18028519 = fieldWeight in 1338, 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=1338)
  0.25 = coord(3/12)

Abstract

A user's query is considered to be an imprecise description of their information need. Automatic query expansion is the process of reformulating the original query with the goal of improving retrieval effectiveness. Many successful query expansion techniques model syntagmatic associations that infer two terms co-occur more often than by chance in natural language. However, structural linguistics relies on both syntagmatic and paradigmatic associations to deduce the meaning of a word. Given the success of dependency-based approaches to query expansion and the reliance on word meanings in the query formulation process, we argue that modeling both syntagmatic and paradigmatic information in the query expansion process improves retrieval effectiveness. This article develops and evaluates a new query expansion technique that is based on a formal, corpus-based model of word meaning that models syntagmatic and paradigmatic associations. We demonstrate that when sufficient statistical information exists, as in the case of longer queries, including paradigmatic information alone provides significant improvements in retrieval effectiveness across a wide variety of data sets. More generally, when our new query expansion approach is applied to large-scale web retrieval it demonstrates significant improvements in retrieval effectiveness over a strong baseline system, based on a commercial search engine.

0.01854325 = product of:
  0.1112595 = sum of:
    0.05562975 = weight(_text_:web in 411) [ClassicSimilarity], result of:
      0.05562975 = score(doc=411,freq=22.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.05562975 = weight(_text_:web in 411) [ClassicSimilarity], result of:
      0.05562975 = score(doc=411,freq=22.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.16666667 = coord(2/12)

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.018276995 = product of:
  0.054830983 = sum of:
    0.010483125 = weight(_text_:web in 1211) [ClassicSimilarity], result of:
      0.010483125 = score(doc=1211,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.09014259 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
    0.014541632 = weight(_text_:world in 1211) [ClassicSimilarity], result of:
      0.014541632 = score(doc=1211,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.10616741 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
    0.019323103 = weight(_text_:wide in 1211) [ClassicSimilarity], result of:
      0.019323103 = score(doc=1211,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.122383565 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
    0.010483125 = weight(_text_:web in 1211) [ClassicSimilarity], result of:
      0.010483125 = score(doc=1211,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.09014259 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.01953125 = fieldNorm(doc=1211)
  0.33333334 = coord(4/12)

Abstract

In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary generation algorithm to generate a set of concepts for the digital library and a technique called the max-min distance technique to cluster them. Additionally, the concepts were visualized in a spring embedding graph layout to depict the semantic relationship among them. The resulting graph layout serves as an aid to users for retrieving documents. An online archive containing the contents of D-Lib Magazine from July 1995 to May 2002 was used to test the utility of an implemented retrieval and visualization system. We believe that the method developed and tested can be applied to many different domains to help users get a better understanding of online document collections and to minimize users' cognitive load during execution of search tasks. Over the past few years, the volume of information available through the World Wide Web has been expanding exponentially. Never has so much information been so readily available and shared among so many people. Unfortunately, the unstructured nature and huge volume of information accessible over networks have made it hard for users to sift through and find relevant information. To deal with this problem, information retrieval (IR) techniques have gained more intensive attention from both industrial and academic researchers. Numerous IR techniques have been developed to help deal with the information overload problem. These techniques concentrate on mathematical models and algorithms for retrieval. Popular IR models such as the Boolean model, the vector-space model, the probabilistic model and their variants are well established.