Sciweavers

7 search results - page 1 / 2
» Relevance information: a loss of entropy but a gain for IDF
Sort
View
SIGIR
2005
ACM
13 years 10 months ago
Relevance information: a loss of entropy but a gain for IDF?
When investigating alternative estimates for term discriminativeness, we discovered that relevance information and idf are much closer related than formulated in classical literat...
Arjen P. de Vries, Thomas Rölleke
ASIACRYPT
2011
Springer
12 years 4 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 5 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
SAC
2003
ACM
13 years 10 months ago
Supervised Term Weighting for Automated Text Categorization
The construction of a text classifier usually involves (i) a phase of term selection, in which the most relevant terms for the classification task are identified, (ii) a phase ...
Franca Debole, Fabrizio Sebastiani
ACSC
2009
IEEE
13 years 11 months ago
Microdata Protection Through Approximate Microaggregation
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
Xiaoxun Sun, Hua Wang, Jiuyong Li