The following pages link to Andrea Passerini (Q413865):
Displayed 19 items.
- Relational information gain (Q413866) (← links)
- Type extension trees for feature construction and learning in relational domains (Q490428) (← links)
- Structured learning modulo theories (Q511777) (← links)
- An efficient procedure for mining egocentric temporal motifs (Q832661) (← links)
- A semiparametric generative model for efficient structured-output supervised learning (Q841642) (← links)
- Predicting the disulfide bonding state of cysteines with combinations of kernel machines (Q1430038) (← links)
- Fast learning of relational kernels (Q1959554) (← links)
- Constructive preference elicitation for multiple users with setwise max-margin (Q1990278) (← links)
- Counts-of-counts similarity for prediction and search in relational data (Q2218368) (← links)
- Learning modulo theories for constructive preference elicitation (Q2238637) (← links)
- Advanced SMT techniques for weighted model integration (Q2321319) (← links)
- (Q3093346) (← links)
- Feature Discovery with Type Extension Trees (Q3543273) (← links)
- Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence (Q3596265) (← links)
- (Q4799239) (← links)
- Learning Modulo Theories (Q4988864) (← links)
- Learning with Kernels and Logical Representations (Q5452022) (← links)
- A Neuro-Symbolic Approach to Structured Event Recognition. (Q6080276) (← links)
- Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesis (Q6161200) (← links)