Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Action rules introduced in [12] and extended further to e-action rules [21] have been investigated in [22], [13], [20]. They assume that attributes in a database are divided into t...
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...