Recognition of Users' Activities Using Constraint Satisfaction
نویسندگان
چکیده
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms presented use constraint satisfaction techniques to compare user interaction histories to a set of ideal solutions. We evaluate these algorithms on data obtained from user interactions with a commercially available pedagogical software, and find that these algorithms identified users’ activities with 93% accuracy.
منابع مشابه
A comparison of two handwriting recognizers for pen-based computers
An experiment is described that compares two commercial handwriting recognizers with handprinted characters. Each recognizer was tested at two levels of constraint, one using lowercase letters (which were the only symbols included in the input text) and the other using both uppercase and lowercase letters. Two factors – recognizer and constraint – with two levels each, resulted in four test con...
متن کاملPlan recognition in exploratory domains
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for effective plan recognition in such settings. In exploratory domains, agents’ actions map onto logs of behavior that include switching between activities, extraneous actions, and mistakes. Flexible pedagogical software, suc...
متن کاملPii: S0953-5438(98)00030-7
An experiment is described comparing two commercial handwriting recognizers with discrete hand-printed characters. Each recognizer was tested at two levels of constraint, one using lowercase letters (which were the only symbols included in the input text) and the other using both uppercase and lowercase letters. Two factors—recognizer and constraint—with two levels each, resulted in four test c...
متن کاملDJ: A Java-based Constraint Language and System
DJ (Declarative Java) is an extension of Java that supports constraint programming. With DJ, users do not need to learn the complicated class hierarchy of the AWT package or Java's layout managers. To construct a GUI, users only need to specify the components that compose the GUI and the relationship among the components by using constraints. As a constraint language, DJ can be used not only to...
متن کاملDomain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the solution of problems in the domain. The technique is applied to reduce the space complexity of the the massively parallel AC Chip algorithm. Results of the optimizations are shown for an object recognition domain in wh...
متن کامل