Search (37 results, page 1 of 2)

  • × language_ss:"e"
  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  • × year_i:[2010 TO 2020}
  1. Brunetti, J.M.; Roberto García, R.: User-centered design and evaluation of overview components for semantic data exploration (2014) 0.06 
    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
  2. Gábor, K.; Zargayouna, H.; Tellier, I.; Buscaldi, D.; Charnois, T.: ¬A typology of semantic relations dedicated to scientific literature analysis (2016) 0.05 
    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.
  3. Atanassova, I.; Bertin, M.: Semantic facets for scientific information retrieval (2014) 0.05 
    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
  4. Smith, D.A.; Shadbolt, N.R.: FacetOntology : expressive descriptions of facets in the Semantic Web (2012) 0.04 
    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
  5. Melucci, M.: Contextual search : a computational framework (2012) 0.04 
    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.
  6. Roy, R.S.; Agarwal, S.; Ganguly, N.; Choudhury, M.: Syntactic complexity of Web search queries through the lenses of language models, networks and users (2016) 0.03 
    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.
  7. Darányi, S.; Wittek, P.: Demonstrating conceptual dynamics in an evolving text collection (2013) 0.03 
    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.
  8. Layfield, C.; Azzopardi, J,; Staff, C.: Experiments with document retrieval from small text collections using Latent Semantic Analysis or term similarity with query coordination and automatic relevance feedback (2017) 0.02 
    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
  9. Bergamaschi, S.; Domnori, E.; Guerra, F.; Rota, S.; Lado, R.T.; Velegrakis, Y.: Understanding the semantics of keyword queries on relational data without accessing the instance (2012) 0.02 
    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
  10. Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014) 0.02 
    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.
  11. Semantic search over the Web (2012) 0.02 
    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
  12. Brandão, W.C.; Santos, R.L.T.; Ziviani, N.; Moura, E.S. de; Silva, A.S. da: Learning to expand queries using entities (2014) 0.02 
    0.017842902 = product of:
  0.07137161 = sum of:
    0.029650755 = weight(_text_:web in 1343) [ClassicSimilarity], result of:
      0.029650755 = score(doc=1343,freq=4.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.029650755 = weight(_text_:web in 1343) [ClassicSimilarity], result of:
      0.029650755 = score(doc=1343,freq=4.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.012070097 = product of:
      0.024140194 = sum of:
        0.024140194 = weight(_text_:22 in 1343) [ClassicSimilarity], result of:
          0.024140194 = score(doc=1343,freq=2.0), product of:
            0.12478739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035634913 = 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.25 = coord(3/12)
    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
  13. Cai, F.; Rijke, M. de: Learning from homologous queries and semantically related terms for query auto completion (2016) 0.02 
    0.01775394 = product of:
  0.07101576 = sum of:
    0.02096625 = weight(_text_:web in 2971) [ClassicSimilarity], result of:
      0.02096625 = score(doc=2971,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.18028519 = fieldWeight in 2971, 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=2971)
    0.029083263 = weight(_text_:world in 2971) [ClassicSimilarity], result of:
      0.029083263 = score(doc=2971,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.21233483 = fieldWeight in 2971, 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=2971)
    0.02096625 = weight(_text_:web in 2971) [ClassicSimilarity], result of:
      0.02096625 = score(doc=2971,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.18028519 = fieldWeight in 2971, 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=2971)
  0.25 = coord(3/12)
    Abstract
    Query auto completion (QAC) models recommend possible queries to web search users when they start typing a query prefix. Most of today's QAC models rank candidate queries by popularity (i.e., frequency), and in doing so they tend to follow a strict query matching policy when counting the queries. That is, they ignore the contributions from so-called homologous queries, queries with the same terms but ordered differently or queries that expand the original query. Importantly, homologous queries often express a remarkably similar search intent. Moreover, today's QAC approaches often ignore semantically related terms. We argue that users are prone to combine semantically related terms when generating queries. We propose a learning to rank-based QAC approach, where, for the first time, features derived from homologous queries and semantically related terms are introduced. In particular, we consider: (i) the observed and predicted popularity of homologous queries for a query candidate; and (ii) the semantic relatedness of pairs of terms inside a query and pairs of queries inside a session. We quantify the improvement of the proposed new features using two large-scale real-world query logs and show that the mean reciprocal rank and the success rate can be improved by up to 9% over state-of-the-art QAC models.
  14. Brambilla, M.; Ceri, S.: Designing exploratory search applications upon Web data sources (2012) 0.02 
    0.015813736 = product of:
  0.094882414 = sum of:
    0.047441207 = weight(_text_:web in 428) [ClassicSimilarity], result of:
      0.047441207 = score(doc=428,freq=16.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.047441207 = weight(_text_:web in 428) [ClassicSimilarity], result of:
      0.047441207 = score(doc=428,freq=16.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.16666667 = coord(2/12)
    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
  15. Zenz, G.; Zhou, X.; Minack, E.; Siberski, W.; Nejdl, W.: Interactive query construction for keyword search on the Semantic Web (2012) 0.01 
    0.013977501 = product of:
  0.083865 = sum of:
    0.0419325 = weight(_text_:web in 430) [ClassicSimilarity], result of:
      0.0419325 = score(doc=430,freq=8.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.0419325 = weight(_text_:web in 430) [ClassicSimilarity], result of:
      0.0419325 = score(doc=430,freq=8.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = 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.16666667 = coord(2/12)
    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
  16. Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015) 0.01 
    0.012104871 = product of:
  0.07262922 = sum of:
    0.03631461 = weight(_text_:web in 2696) [ClassicSimilarity], result of:
      0.03631461 = score(doc=2696,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.3122631 = fieldWeight in 2696, 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=2696)
    0.03631461 = weight(_text_:web in 2696) [ClassicSimilarity], result of:
      0.03631461 = score(doc=2696,freq=6.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.3122631 = fieldWeight in 2696, 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=2696)
  0.16666667 = coord(2/12)
    Abstract
    Search Engines have become an integral part of our day to day life. Our reliance on search engines increases with every passing day. With the amount of data available on Internet increasing exponentially, it becomes important to develop new methods and tools that help to return results relevant to the queries and reduce the time spent on searching. The results should be diverse but at the same time should return results focused on the queries asked. Relation Based Page Rank [4] algorithms are considered to be the next frontier in improvement of Semantic Web Search. The probability of finding relevance in the search results as posited by the user while entering the query is used to measure the relevance. However, its application is limited by the complexity of determining relation between the terms and assigning explicit meaning to each term. Trust Rank is one of the most widely used ranking algorithms for semantic web search. Few other ranking algorithms like HITS algorithm, PageRank algorithm are also used for Semantic Web Searching. In this paper, we will provide a comparison of few ranking approaches.
  17. Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014) 0.01 
    0.011860303 = product of:
  0.071161814 = sum of:
    0.035580907 = weight(_text_:web in 2799) [ClassicSimilarity], result of:
      0.035580907 = score(doc=2799,freq=4.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.3059541 = fieldWeight in 2799, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2799)
    0.035580907 = weight(_text_:web in 2799) [ClassicSimilarity], result of:
      0.035580907 = score(doc=2799,freq=4.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.3059541 = fieldWeight in 2799, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2799)
  0.16666667 = coord(2/12)
    Abstract
    With ever increasing information being available to the end users, search engines have become the most powerful tools for obtaining useful information scattered on the Web. However, it is very common that even most renowned search engines return result sets with not so useful pages to the user. Research on semantic search aims to improve traditional information search and retrieval methods where the basic relevance criteria rely primarily on the presence of query keywords within the returned pages. This work is an attempt to explore different relevancy ranking approaches based on semantics which are considered appropriate for the retrieval of relevant information. In this paper, various pilot projects and their corresponding outcomes have been investigated based on methodologies adopted and their most distinctive characteristics towards ranking. An overview of selected approaches and their comparison by means of the classification criteria has been presented. With the help of this comparison, some common concepts and outstanding features have been identified.
  18. Surfing versus Drilling for knowledge in science : When should you use your computer? When should you use your brain? (2018) 0.01 
    0.009030595 = product of:
  0.054183573 = sum of:
    0.02326661 = weight(_text_:world in 4564) [ClassicSimilarity], result of:
      0.02326661 = score(doc=4564,freq=2.0), product of:
        0.13696888 = queryWeight, product of:
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.035634913 = queryNorm
        0.16986786 = fieldWeight in 4564, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.8436708 = idf(docFreq=2573, maxDocs=44218)
          0.03125 = fieldNorm(doc=4564)
    0.030916965 = weight(_text_:wide in 4564) [ClassicSimilarity], result of:
      0.030916965 = score(doc=4564,freq=2.0), product of:
        0.1578897 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.035634913 = queryNorm
        0.1958137 = fieldWeight in 4564, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.03125 = fieldNorm(doc=4564)
  0.16666667 = coord(2/12)
    Abstract
    For this second Special Issue of Infozine, we have invited students, teachers, researchers, and software developers to share their opinions about one or the other aspect of this broad topic: how to balance drilling (for depth) vs. surfing (for breadth) in scientific learning, teaching, research, and software design - and how the modern digital-liberal system affects our ability to strike this balance. This special issue is meant to provide a wide and unbiased spectrum of possible viewpoints on the topic, helping readers to define lucidly their own position and information use behavior.
    Content
    Editorial: Surfing versus Drilling for Knowledge in Science: When should you use your computer? When should you use your brain? Blaise Pascal: Les deux infinis - The two infinities / Philippe Hünenberger and Oliver Renn - "Surfing" vs. "drilling" in the modern scientific world / Antonio Loprieno - Of millimeter paper and machine learning / Philippe Hünenberger - From one to many, from breadth to depth - industrializing research / Janne Soetbeer - "Deep drilling" requires "surfing" / Gerd Folkers and Laura Folkers - Surfing vs. drilling in science: A delicate balance / Alzbeta Kubincová - Digital trends in academia - for the sake of critical thinking or comfort? / Leif-Thore Deck - I diagnose, therefore I am a Doctor? Will drilling computer software replace human doctors in the future? / Yi Zheng - Surfing versus drilling in fundamental research / Wilfred van Gunsteren - Using brain vs. brute force in computational studies of biological systems / Arieh Warshel - Laboratory literature boards in the digital age / Jeffrey Bode - Research strategies in computational chemistry / Sereina Riniker - Surfing on the hype waves or drilling deep for knowledge? A perspective from industry / Nadine Schneider and Nikolaus Stiefl - The use and purpose of articles and scientists / Philip Mark Lund - Can you look at papers like artwork? / Oliver Renn - Dynamite fishing in the data swamp / Frank Perabo 34 Streetlights, augmented intelligence, and information discovery / Jeffrey Saffer and Vicki Burnett - "Yes Dave. Happy to do that for you." Why AI, machine learning, and blockchain will lead to deeper "drilling" / Michiel Kolman and Sjors de Heuvel - Trends in scientific document search ( Stefan Geißler - Power tools for text mining / Jane Reed 42 Publishing and patenting: Navigating the differences to ensure search success / Paul Peters
  19. Narock, T.; Zhou, L.; Yoon, V.: Semantic similarity of ontology instances using polarity mining (2013) 0.01 
    0.0083865 = product of:
  0.050318997 = sum of:
    0.025159499 = weight(_text_:web in 620) [ClassicSimilarity], result of:
      0.025159499 = score(doc=620,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.21634221 = fieldWeight in 620, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=620)
    0.025159499 = weight(_text_:web in 620) [ClassicSimilarity], result of:
      0.025159499 = score(doc=620,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.21634221 = fieldWeight in 620, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=620)
  0.16666667 = coord(2/12)
    Theme
    Semantic Web
  20. Gnoli, C.; Pusterla, L.; Bendiscioli, A.; Recinella, C.: Classification for collections mapping and query expansion (2016) 0.01 
    0.0083865 = product of:
  0.050318997 = sum of:
    0.025159499 = weight(_text_:web in 3102) [ClassicSimilarity], result of:
      0.025159499 = score(doc=3102,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.21634221 = fieldWeight in 3102, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=3102)
    0.025159499 = weight(_text_:web in 3102) [ClassicSimilarity], result of:
      0.025159499 = score(doc=3102,freq=2.0), product of:
        0.11629491 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.035634913 = queryNorm
        0.21634221 = fieldWeight in 3102, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=3102)
  0.16666667 = coord(2/12)
    Abstract
    Dewey Decimal Classification has been used to organize materials owned by the three scientific libraries at the University of Pavia, and to allow integrated browsing in their union catalogue through SciGator, a home built web-based user interface. Classification acts as a bridge between collections located in different places and shelved according to different local schemes. Furthermore, cross-discipline relationships recorded in the system allow for expanded queries that increase recall. Advantages and possible improvements of such a system are discussed.

Authors

Types

Themes