Year: 2013
Type: conference-paper
Abstract: Typically search engine results (SERs) are presented in a ranked list of decreasing estimated relevance to user queries.While familiar to users, ranked lists do not show inherent connections between SERs, e.g.whether SERs are hyperlinked or authored by the same source.Such potentially useful connections between SERs can be displayed as graphs.We present a preliminary comparative study of ranked lists vs graph visualisations of SERs.Experiments with TREC web search data and a small user study of 10 participants show that ranked lists result in more precise and also faster search sessions than graph visualisations.
Institution: University of Copenhagen
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2395563037
