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...
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...
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...
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 ...
Ron Stevens, Amy Soller, Melanie Cooper, Marcia Sp...
—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...