About: Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Vyvinuli jsme algoritmus, který odhaduje pokrytí klauzule, tj. počet příkladů, které jsou klauzulí implikovány. Algoritmus je implementován a testován na vygenerovaných i realných datových sadách. (cs) In relational learning, {$\theta$}-subsumption and OI-subsumption are widely used coverage tests. Unfortunately, testing both {$\theta$}-subsumption and OI-subsumption is NP-complete, which is one of the reasons for poor performance of most relational learners. In this paper, we aim at a possible exploitation of randomized restarted search strategies for coverage estimation. We devise an algorithm that can, under a distributional assumption, estimate coverage between a given hypothesis and a set of examples without having to decide the subsumption test for all examples. We implement this algorithm in programs {\sc ReCovEr} and {\sc ReCovErOI}. On artificial graph data and real-world datasets, we show that these algorithms can provide reasonably accurate estimates while achieving favorable runtimes as compared to state-of-the-art algorithms. In relational learning, {$\theta$}-subsumption and OI-subsumption are widely used coverage tests. Unfortunately, testing both {$\theta$}-subsumption and OI-subsumption is NP-complete, which is one of the reasons for poor performance of most relational learners. In this paper, we aim at a possible exploitation of randomized restarted search strategies for coverage estimation. We devise an algorithm that can, under a distributional assumption, estimate coverage between a given hypothesis and a set of examples without having to decide the subsumption test for all examples. We implement this algorithm in programs {\sc ReCovEr} and {\sc ReCovErOI}. On artificial graph data and real-world datasets, we show that these algorithms can provide reasonably accurate estimates while achieving favorable runtimes as compared to state-of-the-art algorithms. (en)
Title	Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood (en) Rychlý odhad pokrytí klauzule prostřednictvím randomizace a maximální věrohodnosti (cs)
skos:prefLabel	Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood (en) Rychlý odhad pokrytí klauzule prostřednictvím randomizace a maximální věrohodnosti (cs)
skos:notation	RIV/68407700:21230/08:03145218!RIV09-GA0-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA201/08/0509)
http://linked.open...vai/riv/dodaniDat	2009
http://linked.open...aciTvurceVysledku	Kuželka, Ondřej Železný, Filip
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	367691
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/08:03145218
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	clause coverage; randomization; relational learning (en)
http://linked.open.../riv/klicoveSlovo	randomization clause coverage relational learning
http://linked.open...ontrolniKodProRIV	[12173B0327ED]
http://linked.open...v/mistoKonaniAkce	Helsinki
http://linked.open...i/riv/mistoVydani	Madison
http://linked.open...i/riv/nazevZdroje	Proceedings of the 25th International Conference on Machine Learning
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	LeCoS: merging machine LEarning and COnstraint Satisfaction
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Kuželka, Ondřej Železný, Filip
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2008-07-05 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Omnipress
https://schema.org/isbn	978-1-60558-205-4
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood Fast Estimation of First Order Clause Coverage through Randomization and Maximum Likelihood

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software