Search Timelines: Visualizing Search History to Enable Cross-Session Exploratory Search

• URL: http://arxiv.org/abs/2504.16741v2
• Date: Fri, 15 Aug 2025 14:40:28 GMT
• Title: Search Timelines: Visualizing Search History to Enable Cross-Session Exploratory Search
• Abstract summary: Timespan over which exploratory searching can occur, as well as the scope and volume of the search activities undertaken, can make it difficult for searchers to remember key details about their search activities.<n>We present a search interface design and prototype implementation to support cross-session exploratory search in a public digital library context.
• Score: 1.1600069420834453
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Purpose: The timespan over which exploratory searching can occur, as well as the scope and volume of the search activities undertaken, can make it difficult for searchers to remember key details about their search activities. These difficulties are present both in the midst of searching as well as when resuming a search that spans multiple sessions. In this paper, we present a search interface design and prototype implementation to support cross-session exploratory search in a public digital library context. Methods: Search Timelines provides a visualization of current and past search activities via a dynamic timeline of the search activity (queries and saved resources). This timeline is presented at two levels of detail. An Overview Timeline is provided alongside the search results in a typical search engine results page design. A Detailed Timeline is provided in the workspace, where searchers can review the history of their search activities and their saved resources. A controlled laboratory study (n=32) was conducted to compare this approach to a baseline interface modelled after a typical public digital library search/workspace interface. Results: Participants who used Search Timelines reported higher levels of user engagement, usability, and perceived knowledge gain, during an initial search session and when resuming the search after a 7-8 day interval. This came at the expense of the searchers taking more time to complete the search task, which we view as positive evidence of engagement in cross-session exploratory search processes. Conclusion: Search Timelines serves as an example of how lightweight visualization approaches can be used to enhance typical search interface designs to support exploratory search. The results highlight the value of providing persistent representations of past search activities within the search interface.}

Related papers

• Diagnosing Search Behavior and Failure Modes in Long-Horizon Search Agents [63.2133766267587]
  Deep search agents answer difficult information-seeking questions by iteratively issuing search queries to gather supporting evidence.<n>We study these questions through a trajectory-level diagnosis of long-horizon search agents.<n>We evaluate the evidence retrieved at each search step and separate two stages of agent behavior: what evidence an agent retrieves and how effectively it uses that evidence.
  arXiv  Detail & Related papers  (2026-08-03T08:46:48Z)
• SearchMaster: Grounded and Regulated Self-Play for Search Agents [57.537666863340284]
  Training search agents requires high-quality search data.<n> Existing pipelines often depend on human-written tasks, expert demonstrations, or stronger teacher models.<n>We present SearchMaster, a self-play framework that trains a single LLM from search tasks it generates, solves, and verifies in a local search environment.
  arXiv  Detail & Related papers  (2026-08-03T07:29:11Z)
• SearchArt: Training Long-Horizon Search Agent with Scalable Synthetic and Verified Task [28.244711705405056]
  Training effective search agents remains challenging due to the lack of scalable and long-horizon tasks.<n>We introduce SearchArt, a framework for training long-horizon search agents.<n>SearchArt constructs large-scale datasets for complex search-, research- and user-oriented tasks.
  arXiv  Detail & Related papers  (2026-07-25T06:47:46Z)
• SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration [77.28003194268977]
  SearchOS is a system-level multi-agent framework that turns fragile, implicit search progress into explicit, persistent, and shared state.<n>Built on SOCM, SearchOS applies a pipeline-parallel scheduling mechanism that overlaps the execution of sub-agents.<n>SearchOS leads all metrics among the evaluated single- and multi-agent baselines.
  arXiv  Detail & Related papers  (2026-07-16T17:51:23Z)
• SearchLog: A Web Browser Extension for Capturing Search Logs in Laboratory Studies [7.920306388314784]
  SearchLog is an easy-to-install web browser extension for collecting natural search logs during lab-based studies.<n>The extension captures clicks, scrolling, hovered text, typed words, search queries, result rankings, AI-generated summaries when available, tab activity, and window changes.
  arXiv  Detail & Related papers  (2026-06-03T16:03:29Z)
• DeepMMSearch-R1: Empowering Multimodal LLMs in Multimodal Web Search [61.77858432092777]
  We present DeepMMSearch-R1, the first multimodal large language model capable of performing on-demand, multi-turn web searches.<n>DeepMMSearch-R1 can initiate web searches based on relevant crops of the input image making the image search more effective.<n>We conduct extensive experiments across a range of knowledge-intensive benchmarks to demonstrate the superiority of our approach.
  arXiv  Detail & Related papers  (2025-10-14T17:59:58Z)
• Implicit Search via Discrete Diffusion: A Study on Chess [104.74301574891359]
  We propose DiffuSearch, a model that does textitimplicit search by looking into the future world via discrete diffusion modeling.<n>We instantiate DiffuSearch on a classical board game, Chess, where explicit search is known to be essential.<n>We show DiffuSearch outperforms both the searchless and explicit search-enhanced policies.
  arXiv  Detail & Related papers  (2025-02-27T06:25:15Z)
• Conversational Exploratory Search of Scholarly Publications Using Knowledge Graphs [3.3916160303055567]
  We develop a conversational search system for exploring scholarly publications using a knowledge graph. To assess the system's effectiveness, we employed various performance metrics and conducted a human evaluation with 40 participants.
  arXiv  Detail & Related papers  (2024-10-01T06:16:07Z)
• Query-oriented Data Augmentation for Session Search [71.84678750612754]
  We propose query-oriented data augmentation to enrich search logs and empower the modeling. We generate supplemental training pairs by altering the most important part of a search context. We develop several strategies to alter the current query, resulting in new training data with varying degrees of difficulty.
  arXiv  Detail & Related papers  (2024-07-04T08:08:33Z)
• A Partially Supervised Reinforcement Learning Framework for Visual Active Search [36.966522001393734]
  Visual active search (VAS) has been proposed as a modeling framework in which visual cues are used to guide exploration. We propose an approach that combines the strength of both DRL and conventional active search by decomposing the search policy into a prediction module. We develop a novel meta-learning approach for jointly learning the resulting combined policy that can make effective use of supervised information obtained both at training and decision time.
  arXiv  Detail & Related papers  (2023-10-15T00:29:35Z)
• Investigating Conversational Search Behavior For Domain Exploration [0.5512295869673147]
  This study investigates open-ended search behavior for navigation through unknown information landscapes. We apply statistical analyses and process mining techniques to uncover general information-seeking patterns across five different domains.
  arXiv  Detail & Related papers  (2023-01-10T17:43:03Z)
• A Visual Active Search Framework for Geospatial Exploration [36.31732056074638]
  Many problems can be viewed as forms of geospatial search aided by aerial imagery. We model this class of problems in a visual active search (VAS) framework, which has three key inputs. We propose a reinforcement learning approach for VAS that learns a meta-search policy from a collection of fully annotated search tasks.
  arXiv  Detail & Related papers  (2022-11-28T21:53:05Z)
• CrossBeam: Learning to Search in Bottom-Up Program Synthesis [51.37514793318815]
  We propose training a neural model to learn a hands-on search policy for bottom-up synthesis. Our approach, called CrossBeam, uses the neural model to choose how to combine previously-explored programs into new programs. We observe that CrossBeam learns to search efficiently, exploring much smaller portions of the program space compared to the state-of-the-art.
  arXiv  Detail & Related papers  (2022-03-20T04:41:05Z)
• Deep Reinforcement Agent for Efficient Instant Search [14.086339486783018]
  We propose to address the load issue by identifying tokens that are semantically more salient towards retrieving relevant documents. We train a reinforcement agent that interacts directly with the search engine and learns to predict the word's importance. A novel evaluation framework is presented to study the trade-off between the number of triggered searches and the system's performance.
  arXiv  Detail & Related papers  (2022-03-17T22:47:15Z)
• Exploring Complicated Search Spaces with Interleaving-Free Sampling [127.07551427957362]
  In this paper, we build the search algorithm upon a complicated search space with long-distance connections. We present a simple yet effective algorithm named textbfIF-NAS, where we perform a periodic sampling strategy to construct different sub-networks. In the proposed search space, IF-NAS outperform both random sampling and previous weight-sharing search algorithms by a significant margin.
  arXiv  Detail & Related papers  (2021-12-05T06:42:48Z)
• Exposing Query Identification for Search Transparency [69.06545074617685]
  We explore the feasibility of approximate exposing query identification (EQI) as a retrieval task by reversing the role of queries and documents in two classes of search systems. We derive an evaluation metric to measure the quality of a ranking of exposing queries, as well as conducting an empirical analysis focusing on various practical aspects of approximate EQI.
  arXiv  Detail & Related papers  (2021-10-14T20:19:27Z)
• Global2Local: Efficient Structure Search for Video Action Segmentation [64.99046987598075]
  We propose to find better receptive field combinations through a global-to-local search scheme. Our scheme exploits both global search to find the coarse combinations and local search to get the refined receptive field combination patterns. Our global-to-local search can be plugged into existing action segmentation methods to achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2021-01-04T12:06:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.