Sciweavers

124 search results - page 2 / 25
» Simplifying Sets of Events by Selecting Temporal Relations
Sort
View
ESANN
2008
13 years 6 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
LOGCOM
2002
142views more  LOGCOM 2002»
13 years 4 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
COLING
2010
12 years 11 months ago
Applying Syntactic, Semantic and Discourse Constraints in Chinese Temporal Annotation
We describe a Chinese temporal annotation experiment that produced a sizable data set for the TempEval-2 evaluation campaign. We show that while we have achieved high inter-annota...
Nianwen Xue, Yuping Zhou
RAID
1999
Springer
13 years 9 months ago
Anomaly Intrusion Detection Systems: Handling Temporal Relations Between Events
Lately, many approaches have been developed to discover computer abuse. Some of them use data mining techniques to discover anomalous behavior in audit trail, considering this beh...
Alexandr Seleznyov, Seppo Puuronen
ACL
2004
13 years 6 months ago
Applying Machine Learning to Chinese Temporal Relation Resolution
Temporal relation resolution involves extraction of temporal information explicitly or implicitly embedded in a language. This information is often inferred from a variety of inte...
Wenjie Li, Kam-Fai Wong, Guihong Cao, Chunfa Yuan