Skip to main content

Questions tagged [search-theory]

Filter by
Sorted by
Tagged with
1 vote
0 answers
16 views

Using a Markov Network to match similar names between lists

I have a problem where I am trying to match people between two datasets--meaning it is the dataset but captured during different year ranges. The problem is that the data was manually entered, so ...
krishnab's user avatar
  • 1,582
1 vote
0 answers
32 views

Has there been any research work done on stochastic display of search engine results?

When using search engine query logs to make use of click-through data to order search results, there is a well-known position bias. This position bias gives search engine users a tendency to click on ...
Joebevo's user avatar
  • 111
4 votes
1 answer
137 views

Unconventional optimization over the space of combinations $C(N,n)$

I have an unconventional optimization problem. At least for me. PROBLEM: $$ \max_{c \in C(N,n)} F(c) $$ where: $C(N,n)$ is the space of the combinations of $n$ objects, out of $N$; $F: C(N,n) \...
Gabriele Pompa's user avatar
1 vote
0 answers
115 views

TF-IDF vector contents when computing cosine similarity for document search

Say you're trying to find the most similar document in a corpus to a given search query. I've seen some examples create TF-IDF vectors that are the length of the given query, and some create TF-IDF ...
Tim S's user avatar
  • 171
5 votes
1 answer
87 views

Capturing an Escaping Prisoner? (Something I thought about in my car)

So, I was in my car listening to the radio when I was listening to a story about the captured New York prison escapees, and it had me thinking: In a hypothetical large fixed area of land, let us ...
Alvin Nunez's user avatar
2 votes
0 answers
125 views

How to find a cost function with only a statistical measure of success?

Using the U.S.A. as a loose analogy, we have search algorithms that find the names and number of States adjacent to a given State (containing a selected city). The goal is to minimize the number of "...
user avatar
0 votes
0 answers
119 views

Pairwise Learning to Rank - detecting detrimental changes

The idea behind Pairwise Learning to Rank is that if you have a set of search results then a clicked on result can be used as training example to indicate that it should rank more highly that the ...
Ben McCann's user avatar
20 votes
2 answers
6k views

How to apply Bayes' theorem to the search for a fisherman lost at sea

The article The Odds, Continually Updated mentions the story of a Long Island fisherman who literally owes his life to Bayesian Statistics. Here's the short version: There are two fishermen on a ...
mlai's user avatar
  • 493
2 votes
1 answer
137 views

A/B split/bucket testing with three or more variants

Let's say I have three search engine e.g. search engine A, search engine B and search engine C. Each search engine is given a set of queries Q (e.g. apple,banana,carrot....), this set Q remains the ...
statman's user avatar
  • 21
2 votes
1 answer
987 views

Citation for Continuous Space Hill Climbing Algorithm pseudocode on Wikipedia?

Can anyone provide a reference for the Continuous Space Hill Climbing Algorithm pseudocode in the Wikipedia article on Hill Climbing? The Russell and Norvig text is cited, but they only provide the ...
aljaca's user avatar
  • 23
2 votes
1 answer
178 views

How many user interactions do I need to perform search relevance experiment?

I know similar questions have been asked many times here. But I still don't get simple formula or idea how estimate this. I have site with traffic and I want to split portion of it to test new search ...
yura's user avatar
  • 233
4 votes
1 answer
140 views

Thoughts on model self-penalization amidst difficult parameter estimation

It is well accepted that one should account for model complexity when performing model comparisons, and the general procedure is to penalize more complex models more strongly. While this makes sense ...
Mike Lawrence's user avatar
4 votes
2 answers
1k views

Optimal stopping from an unknown distribution

The Secretary problem has an algorithm for fixed N and immediate accept/reject (that is, reject reject ... accept one, stop). There are several variants; in mine, secretaries or samples come from a ...
denis's user avatar
  • 3,297
5 votes
2 answers
894 views

Use of Bayesian Search Theory in geological interpretation

I was having a look round a few things yesturday and came across Bayesian Search Theory. Thinking about this theory led me to think about a problem I was working on a few years ago regarding ...
Ian Turner's user avatar