Complexity of data subsets generated by the random subspace method: An experimental investigation
Research output: Contribution to conference › Paper
Standard Standard
Complexity of data subsets generated by the random subspace method: An experimental investigation. / Kuncheva, L.I.; Roli, F.; Marcialis, G.L. et al.
2001. 349-358 Paper presented at MCS 2001.
2001. 349-358 Paper presented at MCS 2001.
Research output: Contribution to conference › Paper
HarvardHarvard
Kuncheva, LI, Roli, F, Marcialis, GL & Shipp, CA 2001, 'Complexity of data subsets generated by the random subspace method: An experimental investigation', Paper presented at MCS 2001, 3/01/01 pp. 349-358.
APA
Kuncheva, L. I., Roli, F., Marcialis, G. L., & Shipp, C. A. (2001). Complexity of data subsets generated by the random subspace method: An experimental investigation. 349-358. Paper presented at MCS 2001.
CBE
Kuncheva LI, Roli F, Marcialis GL, Shipp CA. 2001. Complexity of data subsets generated by the random subspace method: An experimental investigation. Paper presented at MCS 2001.
MLA
Kuncheva, L.I. et al. Complexity of data subsets generated by the random subspace method: An experimental investigation. MCS 2001, 03 Jan 0001, Paper, 2001.
VancouverVancouver
Kuncheva LI, Roli F, Marcialis GL, Shipp CA. Complexity of data subsets generated by the random subspace method: An experimental investigation. 2001. Paper presented at MCS 2001.
Author
RIS
TY - CONF
T1 - Complexity of data subsets generated by the random subspace method: An experimental investigation
AU - Kuncheva, L.I.
AU - Roli, F.
AU - Marcialis, G.L.
AU - Shipp, C.A.
PY - 2001/1/1
Y1 - 2001/1/1
M3 - Paper
SP - 349
EP - 358
T2 - MCS 2001
Y2 - 3 January 0001
ER -