Search (3 results, page 1 of 1)

Vidinli, I.B.; Ozcan, R.: New query suggestion framework and algorithms : a case study for an educational search engine (2016) 0.03

0.030295819 = product of:
  0.10603536 = sum of:
    0.031131983 = weight(_text_:management in 3185) [ClassicSimilarity], result of:
      0.031131983 = score(doc=3185,freq=2.0), product of:
        0.13932906 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.041336425 = queryNorm
        0.22344214 = fieldWeight in 3185, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=3185)
    0.07490338 = weight(_text_:case in 3185) [ClassicSimilarity], result of:
      0.07490338 = score(doc=3185,freq=4.0), product of:
        0.18173204 = queryWeight, product of:
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.041336425 = queryNorm
        0.41216385 = fieldWeight in 3185, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.3964143 = idf(docFreq=1480, maxDocs=44218)
          0.046875 = fieldNorm(doc=3185)
  0.2857143 = coord(2/7)

Abstract: Query suggestion is generally an integrated part of web search engines. In this study, we first redefine and reduce the query suggestion problem as "comparison of queries". We then propose a general modular framework for query suggestion algorithm development. We also develop new query suggestion algorithms which are used in our proposed framework, exploiting query, session and user features. As a case study, we use query logs of a real educational search engine that targets K-12 students in Turkey. We also exploit educational features (course, grade) in our query suggestion algorithms. We test our framework and algorithms over a set of queries by an experiment and demonstrate a 66-90% statistically significant increase in relevance of query suggestions compared to a baseline method.
Source: Information processing and management. 52(2016) no.5, S.733-752

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.01
```
0.012606538 = product of:
  0.044122882 = sum of:
    0.025943318 = weight(_text_:management in 3188) [ClassicSimilarity], result of:
      0.025943318 = score(doc=3188,freq=2.0), product of:
        0.13932906 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.041336425 = queryNorm
        0.18620178 = fieldWeight in 3188, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3188)
    0.018179566 = product of:
      0.03635913 = sum of:
        0.03635913 = weight(_text_:studies in 3188) [ClassicSimilarity], result of:
          0.03635913 = score(doc=3188,freq=2.0), product of:
            0.16494368 = queryWeight, product of:
              3.9902744 = idf(docFreq=2222, maxDocs=44218)
              0.041336425 = queryNorm
            0.22043361 = fieldWeight in 3188, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9902744 = idf(docFreq=2222, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3188)
      0.5 = coord(1/2)
  0.2857143 = coord(2/7)
```
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.

Source

Information processing and management. 52(2016) no.5, S.923-948

Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014) 0.00

0.004447426 = product of:
  0.031131983 = sum of:
    0.031131983 = weight(_text_:management in 2799) [ClassicSimilarity], result of:
      0.031131983 = score(doc=2799,freq=2.0), product of:
        0.13932906 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.041336425 = queryNorm
        0.22344214 = fieldWeight in 2799, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=2799)
  0.14285715 = coord(1/7)

Source: Information processing and management. 50(2014) no.2, S.416-425

Search (3 results, page 1 of 1)

Authors