Nicola Di Mauro

ndm Ricercatore (Assistant Professor)
Dipartimento di Informatica
Università degli Studi di Bari "Aldo Moro"
Via Orabona, 4
70126 Bari - Italy

phone: +39 080 544 2297
fax: +39 080 544 3196
email: n1col4.d1m4uro un1b4.1t (replace 1 with i, 4 with a, and insert @ between o and u)

Dipartimento di Informatica

[ Reserch Interests | CV and Short Bio | Activities | Projects | Publications | Systems | Teaching (in italian) ]
Position : Assistant Professor at the Department of Computer Science, University of Bari "Aldo Moro", Italy.

Research Interests

Short Bio

Activities

Co-Chair/Co-Organizer

Organizing Committee Member

Program Committee Member

IJAIA - International Journal of Artificial Intelligence and Application, SERSC

Reviewing

International Tutorials

PhD students

Projects

European projects

National projects

Regional projects

Publications

Systems

Statistical Relational Learning

RIB: Relational Information Bottleneck
Applying the Information Bottleneck Approach to SRL: Learning LPAD Parameters
Lynx
Probabilistic Models for Relational (Sequence) Learning

Clustering-Grouping Problem

ELK: Algorithms for cooperative grouping (partitioning) problem
ELK is a system implementing some algorithms for solving the coalition structure formation (CSF) (and/or set partitioning) problem.

Inductive Logic Programming

MDLS
An Inductive Logic Programming (ILP) algorithm for discovering first-order (DATALOG) maximal frequent patterns in multi-dimensional relational sequences.
INTHELEX: INcremental THeory Learner from EXamples
An incremental learning system for the induction of hierarchical logic theories expressed as sets of Datalog clauses under Object Identity from positive and negative examples.
A matching procedure for theta-subsumption
A procedure for the complete computation of all solutions to theta-subsumption between Horn clauses
SPROL
Learner of relational concepts based on a stochastic propositionalization technique.
RBK (Random Backtracking Depth First Search)
A randomization strategy for ILP, similar to a restart strategy, able to randomly jump in the clause lattice to skip some portion of it.
MILE (Mode-Declarations Incremental Learner from Examples)
An incremental algorithm that induces mode declarations from instances of relational concept.

Creative Commons License

Except where stated otherwise, the content of this website is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License

GNU Emacs
Powered with GNU Emacs
- Copyright © 2001-2009 Nicola Di Mauro