Results 1 - 10
of
6,074
Pivoted Document Length Normalization
- SIGIR'96
, 1996
"... Automatic information retrieval systems have to deal with documents of varying lengths in a text collection. Document length normalization is used to fairly retrieve documents of all lengths. In this study, we ohserve that a normalization scheme that retrieves documents of all lengths with similar c ..."
Abstract
-
Cited by 477 (16 self)
- Add to MetaCart
chances as their likelihood of relevance will outperform another scheme which retrieves documents with chances very different from their likelihood of relevance. We show that the retrievaf probabilities for a particular normalization method deviate systematically from the relevance probabilities across
Automatic Image Annotation and Retrieval using Cross-Media Relevance Models
, 2003
"... Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labor intensive procedure and hence there has been great interest in coming up with automatic ways to retrieve images based o ..."
Abstract
-
Cited by 431 (14 self)
- Add to MetaCart
with annotations, we show that probabilistic models allow us to predict the probability of generating a word given the blobs in an image. This may be used to automatically annotate and retrieve images given a word as a query. We show that relevance models. allow us to derive these probabilities in a natural way
"Is This Document Relevant? ...Probably": A Survey of Probabilistic Models in Information Retrieval
, 2001
"... This article surveys probabilistic approaches to modeling information retrieval. The basic concepts of probabilistic approaches to information retrieval are outlined and the principles and assumptions upon which the approaches are based are presented. The various models proposed in the developmen ..."
Abstract
-
Cited by 71 (15 self)
- Add to MetaCart
This article surveys probabilistic approaches to modeling information retrieval. The basic concepts of probabilistic approaches to information retrieval are outlined and the principles and assumptions upon which the approaches are based are presented. The various models proposed in the development of IR are described, classified, and compared using a common formalism. New approaches that constitute the basis of future research are described
Prior Probabilities
- IEEE Transactions on Systems Science and Cybernetics
, 1968
"... e case of location and scale parameters, rate constants, and in Bernoulli trials with unknown probability of success. In realistic problems, both the transformation group analysis and the principle of maximum entropy are needed to determine the prior. The distributions thus found are uniquely determ ..."
Abstract
-
Cited by 260 (4 self)
- Add to MetaCart
of probability theory have been hampered by difficulties in the treatment of prior information. In realistic problems of decision or inference, we often have prior information which is highly relevant to the question being asked; to fail to take it into account is to commit the most obvious inconsistency
Information Retrieval as Statistical Translation
"... We propose a new probabilistic approach to information retrieval based upon the ideas and methods of statistical machine translation. The central ingredient in this approach is a statistical model of how a user might distill or "translate" a given document into a query. To assess the rele ..."
Abstract
-
Cited by 313 (6 self)
- Add to MetaCart
the relevance of a document to a user's query, we estimate the probability that the query would have been generated as a translation of the document, and factor in the user's general preferences in the form of a prior distribution over documents. We propose a simple, well motivated model
Some advances in transformation-based part-of-speech tagging
- In Proceedings of the Twelfth National Conference on Artificial Intelligence
, 1994
"... Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual probabilities. In (Brill 1992), a trainable rule-based tagger wa ..."
Abstract
-
Cited by 294 (1 self)
- Add to MetaCart
Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual probabilities. In (Brill 1992), a trainable rule-based tagger
A theory of attention: Variations in the associability of stimuli with reinforcement
- Psychological Review
, 1975
"... According to theories of selective attention, learning about a stimulus de-pends on attending to that stimulus; this is represented in two-stage models by saying that subjects switch in analyzers as well as learning stimulus-response associations. This assumption, however, is equally well represente ..."
Abstract
-
Cited by 284 (6 self)
- Add to MetaCart
represented in a formal model by the incorporation of a stimulus-specific learning-rate parameter, a, into the equations describing changes in the associative strength of stimuli. Theories of selective attention have also assumed (a) that subjects learn to attend to and ignore relevant and irrelevant stimuli
Early Results for Named Entity Recognition with Conditional Random Fields, Feature Induction and Web-Enhanced Lexicons
, 2003
"... This paper presents a feature induction method for CRFs. Founded on the principle of constructing only those feature conjunctions that significantly increase loglikelihood, the approach builds on that of Della Pietra et al (1997), but is altered to work with conditional rather than joint probabiliti ..."
Abstract
-
Cited by 267 (12 self)
- Add to MetaCart
probabilities, and with a mean-field approximation and other additional modifications that improve efficiency specifically for a sequence model. In comparison with traditional approaches, automated feature induction offers both improved accuracy and significant reduction in feature count; it enables the use
How We Learn Variation, Optionality, and Probability
- University of Amsterdam
, 1997
"... . Variation is controlled by the grammar, though indirectly: it follows automatically from the robustness requirement of learning. If every constraint in an Optimality-Theoretic grammar has a ranking value along a continuous scale, and the disharmony of a constraint at evaluation time is randomly d ..."
Abstract
-
Cited by 189 (32 self)
- Add to MetaCart
distributed about this ranking value, the phenomenon of optionality in determining the winning candidate follows automatically from the finiteness of the difference between the ranking values of the relevant constraints. The degree of optionality is a descending function of this ranking difference
Pursuing happiness: The architecture of sustainable change
- Review of General Psychology
, 2005
"... The pursuit of happiness is an important goal for many people. However, surprisingly little scientific research has focused on the question of how happiness can be increased and then sustained, probably because of pessimism engendered by the concepts of genetic determinism and hedonic adaptation. Ne ..."
Abstract
-
Cited by 262 (45 self)
- Add to MetaCart
The pursuit of happiness is an important goal for many people. However, surprisingly little scientific research has focused on the question of how happiness can be increased and then sustained, probably because of pessimism engendered by the concepts of genetic determinism and hedonic adaptation
Results 1 - 10
of
6,074