Results 141 to 150 of about 287,496 (196)

Providers of relief in distress: RAG-based LLMs as situation and intent-aware assistants. [PDF]

Front Artif Intell
Nazar AM, Norman B, Northway H, Toutoungi A, Zatkalik E, Carlson G, Sabado E, Shawa H, Selim MY.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Searching the Web with Queries

Knowledge and Information Systems, 1999
In this paper we study the problem of searching the Web with online learning algorithms. We consider that Web documents can be represented by vectors of n boolean attributes. A search engine is viewed as a learner, and a user is viewed as a teacher. We investigate the number of queries a search engine needs from the user to search for a collection of ...
Zhixiang Chen, Xiannong Meng, Richard H. Fowler   +2 more
openaire   +1 more source

Exploiting Web querying for Web people search

ACM Transactions on Database Systems, 2012
Searching for people on the Web is one of the most common query types submitted to Web search engines today. However, when a person name is queried, the returned Webpages often contain documents related to several distinct namesakes who have the queried name.
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad Mehrotra   +2 more
openaire   +1 more source

Trends in multimedia Web searching: excite queries

Proceedings. International Conference on Information Technology: Coding and Computing, 2005
This paper provides results from a study analyzing current trends in multimedia Web searching. The following results were found: (1) multimedia searches are more complex than general searches in queries per user session and terms per query, and (2) audio queries are the most popular type of multimedia queries (compared to video and image queries) in ...
Ozmutlu, SEDA, Ozmutlu, HÜSEYİN CENK, Spink, A   +2 more
openaire   +2 more sources

Predicting query reformulation during web searching

CHI '09 Extended Abstracts on Human Factors in Computing Systems, 2009
his paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in order to predict what the next query reformulation would be. We employed an n-gram modeling approach to describe the probability of searchers transitioning from one query ...
Jansen, Bernard, Booth, Danielle, Spink, Amanda   +2 more
openaire   +2 more sources

Query Expansion for Improving Web Search

Journal of Computational and Theoretical Nanoscience, 2020
The aim of this paper is to retrieve the most relevant expansion words for expanding the initial query of the user in order to enhance the outcomes of web search results. Query expansion plays a major role in reformulating a user’s initial query to a one more pertinent to the user’s intended meaning.
Hiteshwar Kumar Azad, Akshay Deepak, Kumar Abhishek   +2 more
openaire   +1 more source

LiveConcept: Web Search using Structured Query

2007 IEEE 23rd International Conference on Data Engineering, 2007
In this paper, we propose an approach that structure the given query as a taxonomy, called a query taxonomy, from the user's perspective. The proposed approach is based on an unsupervised classification method, which uses the dynamic Web as the training corpus.
Pu-Jeng Cheng, Ching-Hsiang Tsai, Chen-Ming Hung   +2 more
openaire   +1 more source

Identifying ambiguous queries in web search

Proceedings of the 16th international conference on World Wide Web, 2007
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how many queries are ambiguous?" and "how can we automatically identify an ambiguous query?" This paper deals with these issues.
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, Hsiao-Wuen Hon   +4 more
openaire   +1 more source