Sciweavers

2184 search results - page 143 / 437
» Relative Entropy and Statistics
Sort
View
118
Voted
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
15 years 9 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
CIKM
2001
Springer
15 years 8 months ago
Automatic Query Expansion Based on Divergence
In this paper we are mainly concerned with discussion of a formal model, based on the basic concept of divergence from information theory, for automatic query expansion. The basic...
D. Cai, C. J. van Rijsbergen, Joemon M. Jose
ASIACRYPT
1992
Springer
15 years 7 months ago
Nonperfect Secret Sharing Schemes
: Nonperfect secret sharing schemes NSSs have an advantage such that the size of shares can be shorter than that of perfect secret sharing schemes. This paper shows some basic prop...
Wakaha Ogata, Kaoru Kurosawa, Shigeo Tsujii
CEAS
2006
Springer
15 years 7 months ago
Learning at Low False Positive Rates
Most spam filters are configured for use at a very low falsepositive rate. Typically, the filters are trained with techniques that optimize accuracy or entropy, rather than perfor...
Wen-tau Yih, Joshua Goodman, Geoff Hulten
DAWAK
2006
Springer
15 years 7 months ago
Automatic Image Annotation by Mining the Web
Abstract. Automatic image annotation has been becoming an attractive research subject. Most current image annotation methods are based on training techniques. The major weaknesses ...
Zhiguo Gong, Qian Liu, Jingbai Zhang