Probabilistic Logic Programming is a promising formalism for dealing with uncertainty. Learning probabilistic logic programs has been receiving an increasing attention in Inductive Logic Programming: for instance, the system SLIP-COVER learns high quality theories in a variety of domains. However, SLIPCOVER is computationally expensive, with a running time of the order of hours. In order to apply SLIP-COVER to Big Data, we present SEMPRE, for "Structure lEarning by MaPREduce", that scales SLIPCOVER by following a MapReduce strategy, directly implemented with the Message Passing Interface.
Scaling Structure Learning of Probabilistic Logic Programs by MapReduce
F. Riguzzi
;E. Bellodi;R. Zese;E. Lamma
2016
Abstract
Probabilistic Logic Programming is a promising formalism for dealing with uncertainty. Learning probabilistic logic programs has been receiving an increasing attention in Inductive Logic Programming: for instance, the system SLIP-COVER learns high quality theories in a variety of domains. However, SLIPCOVER is computationally expensive, with a running time of the order of hours. In order to apply SLIP-COVER to Big Data, we present SEMPRE, for "Structure lEarning by MaPREduce", that scales SLIPCOVER by following a MapReduce strategy, directly implemented with the Message Passing Interface.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
RigBelZes-ECAI5.pdf.pdf
accesso aperto
Descrizione: Articolo principal
Tipologia:
Post-print
Licenza:
Creative commons
Dimensione
287.86 kB
Formato
Adobe PDF
|
287.86 kB | Adobe PDF | Visualizza/Apri |
FAIA285-1602.pdf
accesso aperto
Descrizione: articolo
Tipologia:
Full text (versione editoriale)
Licenza:
Creative commons
Dimensione
187.25 kB
Formato
Adobe PDF
|
187.25 kB | Adobe PDF | Visualizza/Apri |
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.