Sciweavers

1404 search results - page 238 / 281
» Complexity of admissible rules
Sort
View
LREC
2010
115views Education» more  LREC 2010»
13 years 10 months ago
A General Methodology for Equipping Ontologies with Time
In the first part of this paper, we present a framework for enriching arbitrary upper or domain-specific ontologies with a concept of time. To do so, we need the notion of a time ...
Hans-Ulrich Krieger
ICMLA
2008
13 years 10 months ago
Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection
Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the em...
Yuchun Tang, Yuanchen He, Sven Krasser
NIPS
2008
13 years 10 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
WICSA
2008
13 years 10 months ago
Towards a Formal Model for Reconfigurable Software Architectures by Bigraphs
With the spread of the Internet and software evolution in complex intensive systems, software architecture often need be reconfigured during runtime to adapt variable environments...
Zhiming Chang, XinJun Mao, Zhichang Qi
AAAI
2006
13 years 10 months ago
A Simple and Effective Method for Incorporating Advice into Kernel Methods
We propose a simple mechanism for incorporating advice (prior knowledge), in the form of simple rules, into support-vector methods for both classification and regression. Our appr...
Richard Maclin, Jude W. Shavlik, Trevor Walker, Li...