Sciweavers

4660 search results - page 521 / 932
» Learning from imperfect data
Sort
View
110
Voted
ICDM
2009
IEEE
113views Data Mining» more  ICDM 2009»
15 years 10 months ago
Spatiotemporal Relational Random Forests
Abstract—We introduce and validate Spatiotemporal Relational Random Forests, which are random forests created with spatiotemporal relational probability trees. We build on the do...
Timothy A. Supinie, Amy McGovern, John Williams, J...
PRIB
2009
Springer
135views Bioinformatics» more  PRIB 2009»
15 years 10 months ago
Sequential Hierarchical Pattern Clustering
Abstract. Clustering is a widely used unsupervised data analysis technique in machine learning. However, a common requirement amongst many existing clustering methods is that all p...
Bassam Farran, Amirthalingam Ramanan, Mahesan Nira...
SOFSEM
2001
Springer
15 years 8 months ago
How Can Computer Science Contribute to Knowledge Discovery?
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
Osamu Watanabe
IDEAS
1998
IEEE
146views Database» more  IDEAS 1998»
15 years 8 months ago
The Design and Implementation of an Infrastructure for Multimedia Digital Libraries
We develop an infrastructure for managing, indexing and serving multimedia content in digital libraries. This infrastructure follows the model of the web, and thereby is distribut...
Arjen P. de Vries, Brian S. Eberman, David E. Kova...
COLING
2008
15 years 5 months ago
Homotopy-Based Semi-Supervised Hidden Markov Models for Sequence Labeling
This paper explores the use of the homotopy method for training a semi-supervised Hidden Markov Model (HMM) used for sequence labeling. We provide a novel polynomial-time algorith...
Gholamreza Haffari, Anoop Sarkar