Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (kNN) model. They retrieve images from a single neighborhood using lo...
Document length normalisation is known to be a difficult problem in IR, as tuning is often needed to overcome the collection dependence problem known to affect many normalisation s...
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...