2383 search results - page 120 / 477 » Finding Representative Set from Massive Data |
124
Voted
TRECVID
2008
15 years 3 months ago
2008
Run No. Run ID Run Description infMAP (%) training on TV08 data 1 IUPR-TV-M SIFT visual words with maximum entropy 6.1 2 IUPR-TV-MF SIFT with maximum entropy, fused with color+tex...
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
128
Voted
BMCBI
2007
15 years 1 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
142
Voted
CSMR
2010
IEEE
14 years 8 months ago
2010
IEEE
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
111
click to vote
CIT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we introduce BioPubMiner, a machine learning component-based platform for biomedical information analysis. BioPubMiner employs natural language processing t...