Maximum Entropy Principle based Document Ranking with Term Selection Analysis for Cross-Lingual Information Retrieval

Author(s):  
Ms. P. Mahalakshmi ◽  
N. Sabiyath Fatima
Author(s):  
KENJI SAITO ◽  
HIROYUKI SHIOYA ◽  
TSUTOMU DA-TE

We improve a document retrieval method based on the so-called maximum entropy principle proposed by Cooper, and show how to implement this system on a Bayesian network. A Bayesian network is a probabilistic model for expressing probabilistic relations among random variables. We show advantages of a document retrieval system on a Bayesian network in comparison with Cooper's system. The original document retrieval system based on the maximum entropy principle has a drawback: a result of retrieval can not be obtained in some cases. In this paper, we resolve this drawback by fuzzification of user retrieval requests.


1990 ◽  
Vol 27 (2) ◽  
pp. 303-313 ◽  
Author(s):  
Claudine Robert

The maximum entropy principle is used to model uncertainty by a maximum entropy distribution, subject to some appropriate linear constraints. We give an entropy concentration theorem (whose demonstration is based on large deviation techniques) which is a mathematical justification of this statistical modelling principle. Then we indicate how it can be used in artificial intelligence, and how relevant prior knowledge is provided by some classical descriptive statistical methods. It appears furthermore that the maximum entropy principle yields to a natural binding between descriptive methods and some statistical structures.


Author(s):  
KAI YAO ◽  
JINWU GAO ◽  
WEI DAI

Entropy is a measure of the uncertainty associated with a variable whose value cannot be exactly predicated. In uncertainty theory, it has been quantified so far by logarithmic entropy. However, logarithmic entropy sometimes fails to measure the uncertainty. This paper will propose another type of entropy named sine entropy as a supplement, and explore its properties. After that, the maximum entropy principle will be introduced, and the arc-cosine distributed variables will be proved to have the maximum sine entropy with given expected value and variance.


Sign in / Sign up

Export Citation Format

Share Document