|
ABSTRACT
A recurring theme in mathematical software evaluation is the generalization of rankings of algorithms on test problems to build knowledge-based recommender systems for algorithm selection. A key issue is to profile algorithms in terms of the qualitative characteristics of benchmark problems. In this methodological note, we adapt a novel all-pairs algorithm for the profiling task; given performance rankings for m algorithms on n problem instances, each described with p features, identify a (minimal) subset of p that is useful for assessing the selective superiority of an algorithm over another, for all pairs of m algorithms. We show how techniques presented in the mathematical software literature are inadequate for such profiling purposes. In conclusion, we also address various statistical issues underlying the effective application of this technique.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
BOISVERT,R.F.,HOUSTIS,E.N.,AND RICE, J. R. 1979. A system for performance evaluation of partial differential equations software. IEEE Trans. Softw. Eng. SE-5, 4 (July), 418-425.
|
 |
3
|
|
| |
4
|
|
| |
5
|
HOLLANDER,M.AND WOLFE, D. 1973. Nonparametric Statistical Methods. John Wiley and Sons, Inc., New York, NY.
|
| |
6
|
HOUSTIS,E.AND RICE, J. 1982. High order methods for elliptic partial differential equations with singularities. Int. J. Numer. Method. Eng. 18, 737-754.
|
 |
7
|
E. N. Houstis , J. R. Rice , S. Weerawarana , A. C. Catlin , P. Papachiou , K.-Y. Wang , M. Gaitatzes, PELLPACK: a problem-solving environment for PDE-based applications on multicomputer platforms, ACM Transactions on Mathematical Software (TOMS), v.24 n.1, p.30-73, March 1998
[doi> 10.1145/285861.285864]
|
| |
8
|
|
 |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
RICE, J., HOUSTIS, E., AND DYKSEN, W. 1981. A population of linear, second order, elliptic partial differential equations on rectangular domains: part I. Math. Comput. 36, 475-484.
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
REVIEW
"Lawrence Shampine : Reviewer"
The authors describe an all-pairs profiling technique for
extracting concise, qualitative insights from experimental studies of
the comparative advantages of different algorithms. They apply the
technique to some data from the literature on co
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|