56 search results - page 10 / 12 » Finding Clusters and Components by Unsupervised Learning |
CCIA
2007
Springer
15 years 3 months ago
2007
Springer
Polysemy is one of the most difficult problems when dealing with natural language resources. Consequently, automated ontology learning from textual sources (such as web resources) ...
111
Voted
BMCBI
2007
14 years 9 months ago
2007
Background: The four heterogeneous childhood cancers, neuroblastoma, non-Hodgkin lymphoma, rhabdomyosarcoma, and Ewing sarcoma present a similar histology of small round blue cell...
118
click to vote
JMLR
2010
14 years 4 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
101
click to vote
EPIA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Robots need to ground their external vocabulary and internal symbols in observations of the world. In recent works, this problem has been approached through combinations ...
ICIAR
2010
Springer
14 years 6 months ago
2010
Springer
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...