Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.
© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 04. Juni 2021)
1Yilmaz, T. ; Ozcan, R. ; Altingovde, I.S. ; Ulusoy, Ö.: Improving educational web search for question-like queries through subject classification.
In: Information processing and management. 56(2019) no.1, S.228-246.
Abstract: Students use general web search engines as their primary source of research while trying to find answers to school-related questions. Although search engines are highly relevant for the general population, they may return results that are out of educational context. Another rising trend; social community question answering websites are the second choice for students who try to get answers from other peers online. We attempt discovering possible improvements in educational search by leveraging both of these information sources. For this purpose, we first implement a classifier for educational questions. This classifier is built by an ensemble method that employs several regular learning algorithms and retrieval based approaches that utilize external resources. We also build a query expander to facilitate classification. We further improve the classification using search engine results and obtain 83.5% accuracy. Although our work is entirely based on the Turkish language, the features could easily be mapped to other languages as well. In order to find out whether search engine ranking can be improved in the education domain using the classification model, we collect and label a set of query results retrieved from a general web search engine. We propose five ad-hoc methods to improve search ranking based on the idea that the query-document category relation is an indicator of relevance. We evaluate these methods for overall performance, varying query length and based on factoid and non-factoid queries. We show that some of the methods significantly improve the rankings in the education domain.
Inhalt: Vgl.: https://doi.org/10.1016/j.ipm.2018.10.013.
Themenfeld: Automatisches Klassifizieren
2Sarigil, E. ; Sengor Altingovde, I. ; Blanco, R. ; Barla Cambazoglu, B. ; Ozcan, R. ; Ulusoy, Ö.: Characterizing, predicting, and handling web search queries that match very few or no results.
In: Journal of the Association for Information Science and Technology. 69(2018) no.2, S.256-270.
Abstract: A non-negligible fraction of user queries end up with very few or even no matching results in leading commercial web search engines. In this work, we provide a detailed characterization of such queries and show that search engines try to improve such queries by showing the results of related queries. Through a user study, we show that these query suggestions are usually perceived as relevant. Also, through a query log analysis, we show that the users are dissatisfied after submitting a query that match no results at least 88.5% of the time. As a first step towards solving these no-answer queries, we devised a large number of features that can be used to identify such queries and built machine-learning models. These models can be useful for scenarios such as the mobile- or meta-search, where identifying a query that will retrieve no results at the client device (i.e., even before submitting it to the search engine) may yield gains in terms of the bandwidth usage, power consumption, and/or monetary costs. Experiments over query logs indicate that, despite the heavy skew in class sizes, our models achieve good prediction quality, with accuracy (in terms of area under the curve) up to 0.95.
Inhalt: Vgl.: http://onlinelibrary.wiley.com/doi/10.1002/asi.23955/full.
Themenfeld: Retrievalstudien ; Suchmaschinen
3Vidinli, I.B. ; Ozcan, R.: New query suggestion framework and algorithms : a case study for an educational search engine.
In: Information processing and management. 52(2016) no.5, S.733-752.
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.
Inhalt: Vgl.: http://www.sciencedirect.com/science/article/pii/S0306457316300073.
Themenfeld: Suchmaschinen ; Semantisches Umfeld in Indexierung u. Retrieval
4Ozcan, R. ; Altingovde, I.S. ; Ulusoy, O.: Exploiting navigational queries for result presentation and caching in Web search engines.
In: Journal of the American Society for Information Science and Technology. 62(2011) no.4, S.714-726.
Abstract: Caching of query results is an important mechanism for efficiency and scalability of web search engines. Query results are cached and presented in terms of pages, which typically include 10 results each. In navigational queries, users seek a particular website, which would be typically listed at the top ranks (maybe, first or second) by the search engine, if found. For this type of query, caching and presenting results in the 10-per-page manner may waste cache space and network bandwidth. In this article, we propose nonuniform result page models with varying numbers of results for navigational queries. The experimental results show that our approach reduces the cache miss count by up to 9.17% (because of better utilization of cache space). Furthermore, bandwidth usage, which is measured in terms of number of snippets sent, is also reduced by 71% for navigational queries. This means a considerable reduction in the number of transmitted network packets, i.e., a crucial gain especially for mobile-search scenarios. A user study reveals that users easily adapt to the proposed result page model and that the efficiency gains observed in the experiments can be carried over to real-life situations.