Sciweavers

501 search results - page 61 / 101
» Rough Sets
Sort
View
IPL
2007
96views more  IPL 2007»
13 years 7 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 1 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
ATAL
2006
Springer
13 years 11 months ago
Learning against multiple opponents
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
Thuc Vu, Rob Powers, Yoav Shoham
AAAI
2010
13 years 9 months ago
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
Lin Xu, Holger Hoos, Kevin Leyton-Brown
IOR
2008
119views more  IOR 2008»
13 years 7 months ago
Integrating Approximation and Interactive Decision Making in Multicriteria Optimization
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. W...
Kathrin Klamroth, Kaisa Miettinen