ACM Home Page
Please provide us with feedback. Feedback
Note on generalization in experimental algorithmics
Full text PdfPdf (142 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 26 ,  Issue 4  (December 2000) table of contents
Pages: 568 - 580  
Year of Publication: 2000
ISSN:0098-3500
Authors
Naren Ramakrishnan  Virginia Polytechnic Institute and State Univ., Blacksburg
Raúl E. Valdés-Pérez  Carnegie Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 18,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/365723.365734
What is a DOI?

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
 
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...

Collaborative Colleagues:
Naren Ramakrishnan: colleagues
Raúl E. Valdés-Pérez: colleagues

Peer to Peer - Readers of this Article have also read: