Results 1 
5 of
5
Efficient Voting Prediction for Pairwise Multilabel Classification
, 2009
"... The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to query a quadratic number of preferences for making a prediction. To solve this problem, we extend the recently proposed QW ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
QWeighted algorithm for efficient pairwise multiclass voting to the multilabel setting, and evaluate the adapted algorithm on several realworld datasets. We achieve an averagecase reduction of classifier evaluations from n2 to n+dn log n, where n is the total number of labels and d is the average number
Some algorithmic aspects of the empirical likelihood method in survey sampling
 Statistica Sinica
, 2004
"... Abstract: Recent development of the empirical likelihood method in survey sampling has attracted attention from survey statisticians. Practical considerations for using the method in real surveys depend largely on the availability of simple and efficient algorithms for computing the related weights ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
used design in survey practice. The idea of the qweighted empirical likelihood approach is briefly introduced and the related algorithms are discussed. The proposed algorithms are tested in a limited simulation study and are shown to perform well. Key words and phrases: NewtonRaphson algorithm
RobinsonSchensted algorithm
"... We introduce a qweighted version of the RobinsonSchensted (column insertion) algorithm which is closely connected to qWhittaker functions (or Macdonald polynomials with t = 0) and reduces to the usual RobinsonSchensted algorithm when q = 0. The qinsertion algorithm is ‘randomised’, or ‘quantum’ ..."
Abstract
 Add to MetaCart
We introduce a qweighted version of the RobinsonSchensted (column insertion) algorithm which is closely connected to qWhittaker functions (or Macdonald polynomials with t = 0) and reduces to the usual RobinsonSchensted algorithm when q = 0. The qinsertion algorithm is ‘randomised’, or ‘quantum
Decremental Dynamic Connectivity
 In Proceedings of the 8th ACMSIAM Symposium on Discrete Algorithms (SODA
, 1997
"... We consider Las Vegas randomized dynamic algorithms for online connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(minfn 2 ; m log ng+ p nm log 2:5 n) expected total ti ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We consider Las Vegas randomized dynamic algorithms for online connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(minfn 2 ; m log ng+ p nm log 2:5 n) expected total