Sciweavers

205 search results - page 16 / 41
» Decision trees do not generalize to new variations
Sort
View
CP
2011
Springer
12 years 8 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
BMCBI
2010
126views more  BMCBI 2010»
13 years 8 months ago
A boosting method for maximizing the partial area under the ROC curve
Background: The receiver operating characteristic (ROC) curve is a fundamental tool to assess the discriminant performance for not only a single marker but also a score function c...
Osamu Komori, Shinto Eguchi
ICIP
2005
IEEE
14 years 10 months ago
Optimal representations in multitree dictionaries with application to compression
We generalize our results of [8, 9] and propose a new framework of multitree dictionaries which include many previously proposed dictionaries as well as many new, very large, tree...
Yan Huang, Ilya Pollak, Minh N. Do, Charles A. Bou...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 9 months ago
Privacy-Preserving Data Mining through Knowledge Model Sharing
Privacy-preserving data mining (PPDM) is an important topic to both industry and academia. In general there are two approaches to tackling PPDM, one is statistics-based and the oth...
Patrick Sharkey, Hongwei Tian, Weining Zhang, Shou...
GD
2004
Springer
14 years 2 months ago
The Metro Map Layout Problem
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nasci...