Sciweavers

557 search results - page 64 / 112
» Comparisons of keystroke-level model predictions to observed...
Sort
View
GROUP
2010
ACM
14 years 9 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
DATAMINE
2010
133views more  DATAMINE 2010»
14 years 12 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
UAI
2003
15 years 1 months ago
Probabilistic Models For Joint Clustering And Time-Warping Of Multidimensional Curves
In this paper we present a family of models and learning algorithms that can simultaneously align and cluster sets of multidimensional curves measured on a discrete time grid. Our...
Darya Chudova, Scott Gaffney, Padhraic Smyth
UAI
2004
15 years 1 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
CVPR
2012
IEEE
13 years 2 months ago
Understanding collective crowd behaviors: Learning a Mixture model of Dynamic pedestrian-Agents
In this paper, a new Mixture model of Dynamic pedestrian-Agents (MDA) is proposed to learn the collective behavior patterns of pedestrians in crowded scenes. Collective behaviors ...
Bolei Zhou, Xiaogang Wang, Xiaoou Tang