Machine Learning is a set of methods and techniques for constructing software systems automatically by analyzing only examples of the desired behaviour.
You do not write a program. You only provide examples of what you want. The program will be synthesized automatically.
In our lab we focus on engineering applications: have a look to our publications to know more about specific research topics.
The Machine Learning Lab is directed by prof. Alberto Bartoli, assisted by prof. Eric Medvet, and hosts PostDocs, PhD students and MS students: check the opportunities. Read also our blog to know more about lab life.
The lab is located at Department of Engineering and Architecture (DIA), University of Trieste (room 1259, 2nd floor, building C3). We are on Twitter and Google+.
The lab paper titled A Novel Estimation Methodology for Tracheal Pressure in Mechanical Ventilation Control has been accepted for presentation at ISPA 2013.In this work, we build an estimator, by means of Genetic Programming, for the tracheal pressure... – More
Other great news: our work "Detection of Hidden Fraudulent URLs within Trusted Sites using Lexical Features" has been accepted at a prestigious security conference (ARES 2013). In this work we developed a methodology for detecting fraudulent pages within... – More
Our staff will present our recent work about Automatic String Replace by Examples at ACM GECCO 2013. The conference will be held in Amsterdam at the beginning of next July.In this work, we propose a tool based on genetic programming (GP) for generating... – More
Our work on event detection, classification and summarization on Twitter has been presented last week at Web Intelligence conference 2012 (WI 2012).In this work, titled Brand-related Events Detection, Classification and Summarization on Twitter, we propose... – More
We have slightly improved our automatic generator of regular expressions—a few internal optimizations, a few more computing resources and better load balancing. We describe below how the system works—very informally and very briefly. Then, we will list... – More