Learning with Kernels on Graphs: DAG-based kernels, data streams and RNA function prediction.

In many application domains data can be naturally represented as graphs. When the application of analytical solutions for a given problem is unfeasible, machine learning techniques could be a viable way to solve the problem. Classical machine learning techniques are defined for data represented in a vectorial form. Recently some of them have been extended to deal directly with structured data. Among those techniques, kernel methods have shown promising results both from the computational complexity and the predictive performance point of view. Kernel methods allow to avoid an explicit mapping in a vectorial form relying on kernel functions, which informally are functions calculating a similarity measure between two entities. However, the definition of good kernels for graphs is a challenging problem because of the difficulty to find a good tradeoff between computational complexity and expressiveness. Another problem we face is learning on data streams, where a potentially unbounded sequence of data is generated by some sources. There are three main contributions in this thesis. The first contribution is the definition of a new family of kernels for graphs based on Directed Acyclic Graphs (DAGs). We analyzed two kernels from this family, achieving state-of-the-art results from both the computational and the classification point of view on real-world datasets. The second contribution consists in making the application of learning algorithms for streams of graphs feasible. Moreover,we defined a principled way for the memory management. The third contribution is the application of machine learning techniques for structured data to non-coding RNA function prediction. In this setting, the secondary structure is thought to carry relevant information. However, existing methods considering the secondary structure have prohibitively high computational complexity. We propose to apply kernel methods on this domain, obtaining state-of-the-art results.

Enhancing predictive capability of models for solubility and permeability in polymers and composites

The interpretation of phase equilibrium and mass transport phenomena in gas/solvent - polymer system at molten or glassy state is relevant in many industrial applications. Among tools available for the prediction of thermodynamics properties in these systems, at molten/rubbery state, is the group contribution lattice-fluid equation of state (GCLF-EoS), developed by Lee and Danner and ultimately based on Panayiotou and Vera LF theory. On the other side, a thermodynamic approach namely non-equilibrium lattice-fluid (NELF) was proposed by Doghieri and Sarti to consistently extend the description of thermodynamic properties of solute polymer systems obtained through a suitable equilibrium model to the case of non-equilibrium conditions below the glass transition temperature. The first objective of this work is to investigate the phase behaviour in solvent/polymer at glassy state by using NELF model and to develop a predictive tool for gas or vapor solubility that could be applied in several different applications: membrane gas separation, barrier materials for food packaging, polymer-based gas sensors and drug delivery devices. Within the efforts to develop a predictive tool of this kind, a revision of the group contribution method developed by High and Danner for the application of LF model by Panayiotou and Vera is considered, with reference to possible alternatives for the mixing rule for characteristic interaction energy between segments. The work also devotes efforts to the analysis of gas permeability in polymer composite materials as formed by a polymer matrix in which domains are dispersed of a second phase and attention is focused on relation for deviation from Maxwell law as function of arrangement, shape of dispersed domains and loading.