-
Gillitzer, B.: Yewno (2017)
0.01
0.0062400475 = product of:
0.012480095 = sum of:
0.012480095 = product of:
0.02496019 = sum of:
0.02496019 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
0.02496019 = score(doc=3447,freq=2.0), product of:
0.16128273 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046056706 = queryNorm
0.15476047 = fieldWeight in 3447, 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=3447)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 2.2017 10:16:49
-
Vidinli, I.B.; Ozcan, R.: New query suggestion framework and algorithms : a case study for an educational search engine (2016)
0.00
0.0028703054 = product of:
0.005740611 = sum of:
0.005740611 = product of:
0.011481222 = sum of:
0.011481222 = weight(_text_:a in 3185) [ClassicSimilarity], result of:
0.011481222 = score(doc=3185,freq=16.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.2161963 = fieldWeight in 3185, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=3185)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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.
- Type
- a
-
Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015)
0.00
0.0014647468 = product of:
0.0029294936 = sum of:
0.0029294936 = product of:
0.005858987 = sum of:
0.005858987 = weight(_text_:a in 2696) [ClassicSimilarity], result of:
0.005858987 = score(doc=2696,freq=6.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.11032722 = fieldWeight in 2696, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=2696)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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.
- Type
- a
-
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.00
0.0014647468 = product of:
0.0029294936 = sum of:
0.0029294936 = product of:
0.005858987 = sum of:
0.005858987 = weight(_text_:a in 3188) [ClassicSimilarity], result of:
0.005858987 = score(doc=3188,freq=6.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.11032722 = fieldWeight in 3188, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=3188)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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.
- Type
- a
-
Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014)
0.00
0.0014351527 = product of:
0.0028703054 = sum of:
0.0028703054 = product of:
0.005740611 = sum of:
0.005740611 = weight(_text_:a in 2799) [ClassicSimilarity], result of:
0.005740611 = score(doc=2799,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.10809815 = fieldWeight in 2799, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=2799)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Horch, A.; Kett, H.; Weisbecker, A.: Semantische Suchsysteme für das Internet : Architekturen und Komponenten semantischer Suchmaschinen (2013)
0.00
0.0011959607 = product of:
0.0023919214 = sum of:
0.0023919214 = product of:
0.0047838427 = sum of:
0.0047838427 = weight(_text_:a in 4063) [ClassicSimilarity], result of:
0.0047838427 = score(doc=4063,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.090081796 = fieldWeight in 4063, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=4063)
0.5 = coord(1/2)
0.5 = coord(1/2)
