The MUSART testbed for Query-by-Humming evaluation

被引:10
作者
Dannenberg, RB
Birmingham, WP
Tzanetakis, G
Meek, C
Hu, N
Pardo, B
机构
[1] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
[2] Grove City Coll, Dept Math & Comp Sci, Grove City, PA 16127 USA
[3] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 3P6, Canada
[4] Microsoft Corp, SQL Server, Redmond, WA 98052 USA
[5] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
关键词
D O I
10.1162/014892604323112239
中图分类号
TP39 [计算机的应用];
学科分类号
081203 [计算机应用技术]; 0835 [软件工程];
摘要
A Query-by-Humming testbed to evaluate and compare different search techniques is described. The testbed helps to organize experiments by providing explicit representations and standard formats for queries, targets, collections, preprocessing stages, search algorithms, and result reporting. A single command can run a complete test.
引用
收藏
页码:34 / 48
页数:15
相关论文
共 20 条
[1]
[Anonymous], P 3 INT C MUS INF RE
[2]
Bainbridge D, 2002, LECT NOTES COMPUT SC, V2555, P129
[3]
BIRMINGHAM WP, 2001, 2 ANN INT S MUS INF, P73
[4]
DANNENBERG RB, 2003, ISMIR 2003, P41
[5]
DOWNIE JS, 2002, ISMIR 2002 C P PAR I, P303
[6]
DURBIN R, 1998, BIOL SEQUENCE ANAL P, P22
[7]
FUTRELLE J, 2002, ISMIR 2002 C P PAR I, P215
[8]
GHIAS A, 1995, P 3 ACM INT C MULT, P231
[9]
HU N, 2002, P 2 ACM IEEE CS JOIN, P301
[10]
Mazzoni D., 2001, 2 ANN INT S MUS INF, P17