Web archives are a huge source of information to mine the past. However, tools to explore web archives are still in their infancy, in part due to the reduced knowledge that we have of their users. We contribute to this knowledge by presenting the first search behavior characterization of web archive users. We obtained detailed statistics about the users’ sessions, queries, terms and clicks from...

We create a novel measure of job search effort starting in 1994 by exploiting the overlap between the Current Population Survey and the American Time Use Survey. We examine the cyclical behavior of aggregate job search effort using time series and cross-state variation and find that it is countercyclical. About half of the countercyclical movement is explained by a cyclical shift in the observa...

In the paradigm of the search theory, we established the search model applicable to the characteristics of China's resale housing market, by modeling the search behavior for buyer and seller, respectively. Setting the parameters based on the Beijing housing market survey in August 2012, we implemented agentbased simulation to study the dynamics of the search behavior measured by search intensit...

In the paradigm of the search theory, we established the search model applicable to the characteristics of China's resale housing market, by modeling the search behavior for buyer and seller, respectively. Setting the parameters based on the Beijing housing market survey in August 2012, we implemented agentbased simulation to study the dynamics of the search behavior measured by search intensit...

Traditional approaches to ranking in web search follow the paradigm of rank-by-score: a learned function gives each query-URL combination an absolute score and URLs are ranked according to this score. This paradigm ensures that if the score of one URL is better than another then one will always be ranked higher than the other. Scoring contradicts prior work in behavioral economics that preferen...

Abstract: Previous analyses of pattern search algorithms for unconstrained and linearly constrained minimization have focused on proving convergence of a subsequence of iterates to a limit point satisfying either directional or first-order necessary conditions for optimality, depending on the smoothness of the objective function in a neighborhood of the limit point. Even though pattern search m...

Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions where subthresholdseeking behavior is possible. Analysis shows that subthreshold-seeking behavior, when possible, can be increased when higher bit precision is used with a bit climber search algorithm and a Gray code...

Previous analyses of pattern search algorithms for unconstrained and linearly constrained minimization have focused on proving convergence of a subsequence of iterates to a limit point satisfying either directional or first-order necessary conditions for optimality, depending on the smoothness of the objective function in a neighborhood of the limit point. Even though pattern search methods req...

Recent work has demonstrated that Web search volume can "predict the present," meaning that it can be used to accurately track outcomes such as unemployment levels, auto and home sales, and disease prevalence in near real time. Here we show that what consumers are searching for online can also predict their collective future behavior days or even weeks in advance. Specifically we use search que...

This research study investigated whether users’ level of domain knowledge influenced their decision to stop information searches. Stopping behavior was investigated using a convenience sample of 15 thirdand fourth-year undergraduate students at a large university. Subjects completed a series of self-assessments about background information and levels of knowledge regarding four search domains. ...