Probabilistic soil identification based on cone penetration tests

In geotechnical engineering, soil classification is an essential component in the design process. Field methods such as the cone penetration test (CPT) can be used as less expensive and faster alternatives to sample retrieval and testing. Unfortunately, current soil classification charts based on CPT data and laboratory measurements are too generic, and may not provide an accurate prediction of the soil type. A probabilistic approach is proposed here to update and modify soil identification charts based on site-specific CPT data. The probability that a soil is correctly classified is also estimated. The updated identification chart can be used for a more accurate prediction of the classification of the soil, and can account for prior information available before conducting the tests, site-specific data, and measurement errors. As an illustration, the proposed approach is implemented using CPT data from the Treporti Test Site (TTS) near Venice (Italy) and the National Geotechnical Experimentation Sites (NGES) at Texas A&M University. The applicability of the site-specific chart for other sites in Venice Lagoon is assessed using data from the Malamocco test site, approximately 20 km from TTS.

Probabilistic graphical models for semi-supervised traffic classification

Traffic classification using machine learning continues to be an active research area. The majority of work in this area uses off-the-shelf machine learning tools and treats them as black-box classifiers. This approach turns all the modelling complexity into a feature selection problem. In this paper, we build a problem-specific solution to the traffic classification problem by designing a custom probabilistic graphical model. Graphical models are a modular framework to design classifiers which incorporate domain-specific knowledge. More specifically, our solution introduces semi-supervised learning which means we learn from both labelled and unlabelled traffic flows. We show that our solution performs competitively compared to previous approaches while using less data and simpler features. Copyright © 2010 ACM.

Probabilistic inference for fast learning in control

A novel framework is provided for very fast model-based reinforcement learning in continuous state and action spaces. It requires probabilistic models that explicitly characterize their levels of condence. Within the framework, exible, non-parametric models are used to describe the world based on previously collected experience. It demonstrates learning on the cart-pole problem in a setting where very limited prior knowledge about the task has been provided. Learning progressed rapidly, and a good policy found after only a small number of iterations.