723 search results - page 67 / 145 » Learning a Hidden Subgraph |
OTM
2010
Springer
13 years 6 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
COLT
1994
Springer
14 years 27 days ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...
ITS
2004
Springer
14 years 2 months ago
2004
Springer
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
KBSE
2009
IEEE
14 years 3 months ago
2009
IEEE
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...