Author of the publication

How an Ensemble Method Can Compute a Comprehensible Model.

, , and . DaWaK, volume 5182 of Lecture Notes in Computer Science, page 368-378. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

How an Ensemble Method Can Compute a Comprehensible Model., , and . DaWaK, volume 5182 of Lecture Notes in Computer Science, page 368-378. Springer, (2008)An Empirical Comparison of Some Multiobjective Graph Search Algorithms., , , and . KI, volume 6359 of Lecture Notes in Computer Science, page 238-245. Springer, (2010)Computing a Comprehensible Model for Spam Filtering., , and . Discovery Science, volume 5808 of Lecture Notes in Computer Science, page 457-464. Springer, (2009)A comparison of heuristic best-first algorithms for bicriterion shortest path problems., , , and . Eur. J. Oper. Res., 217 (1): 44-53 (2012)Improving local minima of Hopfield networks with augmented Lagrange multipliers for large scale TSPs., , and . Neural Networks, 13 (3): 283-285 (2000)Parallelism in Binary Hopfield Networks., , and . IWANN (2), volume 6692 of Lecture Notes in Computer Science, page 105-112. Springer, (2011)A Bounded Version of Online Boosting on Open-Ended Data Streams., , and . DaWaK, volume 6862 of Lecture Notes in Computer Science, page 460-470. Springer, (2011)