Sciweavers

3244 search results - page 182 / 649
» On convex complexity measures
Sort
View
INFOSCALE
2006
ACM
15 years 8 months ago
A picture of search
We survey many of the measures used to describe and evaluate the efficiency and effectiveness of large-scale search services. These measures, herein visualized versus verbalized, ...
Greg Pass, Abdur Chowdhury, Cayley Torgeson
FUIN
2002
108views more  FUIN 2002»
15 years 1 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
ICML
2009
IEEE
16 years 2 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
ICML
2003
IEEE
16 years 2 months ago
Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...
Wee Sun Lee, Bing Liu
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
16 years 2 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt