𝔖 Bobbio Scriptorium
✦   LIBER   ✦

IMSR_PreTree: an improved algorithm for mining sequential rules based on the prefix-tree

✍ Scribed by Van, Thien-Trang; Vo, Bay; Le, Bac

Book ID
121562862
Publisher
World Scientific
Year
2014
Tongue
English
Weight
694 KB
Volume
1
Category
Article
ISSN
2196-8888

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because