An information retrieval model based on simple Bayesian networks
✍ Scribed by Silvia Acid; Luis M. De Campos; Juan M. Fernández-Luna; Juan F. Huete
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 115 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
✦ Synopsis
In this article a new probabilistic information retrieval (IR) model, based on Bayesian networks (BNs), is proposed. We first consider a basic model, which represents only direct relationships between the documents in the collection and the terms or keywords used to index them. Next, we study two versions of an extended model, which also represents direct relationships between documents. In either case the BNs are used to compute efficiently, by means of a new and exact propagation algorithm, the posterior probabilities of relevance of the documents in the collection given a query. The performance of the proposed retrieval models is tested through a series of experiments with several standard document collections.
📜 SIMILAR VOLUMES
## Abstract This paper presents new and simple models based on artificial neural networks (ANNs) to determine the effective permittivities of suspended microstrip (SM) and inverted microstrip (IM) lines. The neural results are in very good agreement with the theoretical and experimental results ava
## Abstract We consider a network of sensors that measure the intensities of a complex plume composed of multiple absorption–diffusion source components. We address the problem of estimating the plume parameters, including the spatial and temporal source origins and the parameters of the diffusion
Information retrieval IR can be regarded as a natural instance of multicriteria decision Ž . making MCDM . Queries are formulated as selection criteria aggregated by means of appropriate operators. Retrieval is then performed as a MCDM process by evaluating the degrees of satisfaction of the criteri
A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search