Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,852
Fisher kernels for logical sequences
- In Proc. of 15th European Conference on Machine Learning (ECML-04
, 2004
"... Abstract. One approach to improve the accuracy of classifications based on generative models is to combine them with successful discriminative algorithms. Fisher kernels were developed to combine generative models with a currently very popular class of learning algorithms, kernel methods. Empiricall ..."
Abstract
-
Cited by 13 (5 self)
- Add to MetaCart
structured sequences. In this paper, we show how to compute the gradient of logical hidden Markov models, which allow for the modelling of logical sequences, i.e., sequences over an alphabet of logical atoms. Experiments show a considerable improvement over results achieved without Fisher kernels for logical
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first-order r ..."
Abstract
-
Cited by 1194 (81 self)
- Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first
Mathematical And Logical Sequence Identification
"... This article essentially contains all information regarding the design and implementation of the Sequence Expert prototype. This report is accompanied by a users guide which has details on how to run the system ..."
Abstract
- Add to MetaCart
This article essentially contains all information regarding the design and implementation of the Sequence Expert prototype. This report is accompanied by a users guide which has details on how to run the system
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
, 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computat ..."
Abstract
-
Cited by 1100 (6 self)
- Add to MetaCart
We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each
TildeCRF: Conditional random fields for logical sequences
- In Proceedings of the 15th European Conference on Machine Learning (ECML-06
, 2006
"... Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat alphabets. In this paper, we describe TildeCRF, the first method for training CRFs on logical sequences, i.e., sequences o ..."
Abstract
-
Cited by 37 (17 self)
- Add to MetaCart
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat alphabets. In this paper, we describe TildeCRF, the first method for training CRFs on logical sequences, i.e., sequences
Say EM’ for Selecting Probabilistic Models for Logical Sequences
- In Proceedings of the twenty first conference on uncertainty in artificial intelligence
, 2005
"... Many real world sequences such as protein secondary structures or shell logs exhibit a rich internal structures. Traditional probabilistic models of sequences, however, consider sequences of flat symbols only. Logical hidden Markov models have been proposed as one solution. They deal with logical se ..."
Abstract
-
Cited by 17 (8 self)
- Add to MetaCart
Many real world sequences such as protein secondary structures or shell logs exhibit a rich internal structures. Traditional probabilistic models of sequences, however, consider sequences of flat symbols only. Logical hidden Markov models have been proposed as one solution. They deal with logical
How to make a decision: the analytic hierarchy process
- European Journal of Operational Research
, 1990
"... Policy makers at all levels of decision making in organizations use multiple criteria to analyze their complex problems. Multicriteria thinking is used formally to facilitate their decision making. Through trade-offs it clarifies the advantages and disadvantages of policy options under circumstances ..."
Abstract
-
Cited by 411 (0 self)
- Add to MetaCart
circumstances of risk and uncertainty. It is also a tool vital to forming corporate strategies needed for effective competition. Nearly all of us, in one way or another, have been brought up to believe that clearheaded logical thinking is our only sure way to face and solve problems. We also believe that our
Optimization and Evaluation of Probabilistic-Logic Sequence Models
"... Abstract. Analysis of biological sequence data demands more and more sophisticated and fine-grained models, but these in turn introduce hard computational problems. A class of probabilistic-logic models is consid-ered, which increases the expressive power from HMM’s and SCFG’s regular and context-fr ..."
Abstract
- Add to MetaCart
Abstract. Analysis of biological sequence data demands more and more sophisticated and fine-grained models, but these in turn introduce hard computational problems. A class of probabilistic-logic models is consid-ered, which increases the expressive power from HMM’s and SCFG’s regular and context
Adapting Golog for composition of semantic web Services
, 2002
"... Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to building agent technology based on the notion of generic procedures and customizing user constraint. We argue that an augmented version of the logi ..."
Abstract
-
Cited by 381 (17 self)
- Add to MetaCart
of the logic programming language Golog provides a natural formalism for automatically composing services on the Semantic Web. To this end, we adapt and extend the Golog language to enable programs that are generic, customizable and usable in the context of the Web. Further, we propose logical criteria
Modelling (Bio)Logical Sequences through Markov Logic Networks
- INTELLIGENT INFORMATION SYSTEMS
"... Markov Logic Networks are a powerful representation that combines first-order logic and probability by attaching weights to first-order formulas and using these as templates for features of Markov networks. In this paper we propose a simple temporal extension of MLN that is able to deal with sequenc ..."
Abstract
- Add to MetaCart
with sequences of logical atoms. We also propose iterated robust tabu search (IRoTS) for MAP inference and Markov Chain-IRoTS (MC-IRoTS) for conditional inference in the new framework. We show how MC-IRoTS can also be used for discriminative weight learning. As application domain, we describe how sequences
Results 1 - 10
of
3,852
