Refine
Has Fulltext
- no (15) (remove)
Year of publication
Document Type
- Article (15)
Language
- English (15)
Is part of the Bibliography
- yes (15)
Keywords
- ResNet (2)
- gradient boosting (2)
- monitoring (2)
- random forest (2)
- regression (2)
- Active evaluation (1)
- Animal building (1)
- Automatically controlled windows (1)
- Bean (1)
- CP-Logic (1)
- Deep learning (1)
- Digital image analysis (1)
- Facial mimicry (1)
- Gaussian process (1)
- Housing-price prediction (1)
- Information retrieval (1)
- Inverse problems (1)
- Loss (1)
- Machine learning (1)
- Markov processes (1)
- Metric learning (1)
- Natural ventilation (1)
- Navier-Stokes equations (1)
- Optimization (1)
- Physics-based machine learning (1)
- Plant identification (1)
- Proper orthogonal decomposition (1)
- Ranking (1)
- Seismic-hazard models (1)
- Sequence embeddings (1)
- Statistical relational learning (1)
- Stochastic relational process (1)
- Time series (1)
- Transfer learning (1)
- UAV imagery (1)
- VGG16 (1)
- Varying-coefficient models (1)
- adoptive T-cell transfer (1)
- air pollutant (1)
- artificial neural network (1)
- autologous cell therapy (1)
- camera sensor (1)
- cognitive (1)
- complex emotions (1)
- crop (1)
- deep learning (1)
- deep residual networks (1)
- embedded systems (1)
- emission factor (1)
- emission inventory (1)
- emission modeling (1)
- emotional (1)
- empathy (1)
- end-stage renal disease (1)
- ensemble methods (1)
- functions (1)
- greenhouse gas (1)
- image classification (1)
- image recognition (1)
- kidney transplantation (1)
- livestock (1)
- neural networks (1)
- on-farm evaluation (1)
- real-time mapping (1)
- regulatory T cells (1)
- site-specific weed management (1)
- smart farming (1)
- support vector machines (1)
- training sample (1)
- wheat crops (1)
- yellow rust (1)
One of the goals of artificial intelligence is to develop agents that learn and act in complex environments. Realistic environments typically feature a variable number of objects, relations amongst them, and non-deterministic transition behavior. While standard probabilistic sequence models provide efficient inference and learning techniques for sequential data, they typically cannot fully capture the relational complexity. On the other hand, statistical relational learning techniques are often too inefficient to cope with complex sequential data. In this paper, we introduce a simple model that occupies an intermediate position in this expressiveness/efficiency trade-off. It is based on CP-logic (Causal Probabilistic Logic), an expressive probabilistic logic for modeling causality. However, by specializing CP-logic to represent a probability distribution over sequences of relational state descriptions and employing a Markov assumption, inference and learning become more tractable and effective. Specifically, we show how to solve part of the inference and learning problems directly at the first-order level, while transforming the remaining part into the problem of computing all satisfying assignments for a Boolean formula in a binary decision diagram. We experimentally validate that the resulting technique is able to handle probabilistic relational domains with a substantial number of objects and relations.