作者: bourgeois 時(shí)間: 2025-3-21 20:28
ALLPAD: Approximate Learning of Logic Programs with Annotated Disjunctionsin order to tackle real world learning problems more effectively. This is achieved by looking for an approximate solution rather than a perfect one. ALLPAD has been tested on the problem of classifying proteins according to their tertiary structure and the results compare favorably with most other approaches.作者: 解開 時(shí)間: 2025-3-22 02:10
Revising Probabilistic Prolog ProgramsThe ProbLog (probabilistic prolog) language has been introduced in [1], where various algorithms have been developed for solving and approximating ProbLog queries. Here, we define and study the problem of revising ProbLog theories from examples.作者: 劇本 時(shí)間: 2025-3-22 05:35 作者: lobster 時(shí)間: 2025-3-22 09:09
978-3-540-73846-6Springer-Verlag Berlin Heidelberg 2007作者: 徹底明白 時(shí)間: 2025-3-22 12:53 作者: hurricane 時(shí)間: 2025-3-22 18:16 作者: 責(zé)任 時(shí)間: 2025-3-22 23:04 作者: hypertension 時(shí)間: 2025-3-23 03:05
Margin-Based First-Order Rule Learninge-art rule learning approaches [1], we therefore assign weights to the rules. In this way, a rule set represents a linear classifier and one can optimize . optimization criteria, essentially reducing the misclassification error on noisy data. Since we aim at comprehensible models, we employ margins 作者: agglomerate 時(shí)間: 2025-3-23 08:29 作者: 敘述 時(shí)間: 2025-3-23 12:59 作者: monogamy 時(shí)間: 2025-3-23 17:28
John McCarthys correlation to detect shadows. The algorithm may be used to detect both people and vehicles in applications for safety of cities, traffic monitoring, sports analysis, among others. The results obtained in the detection of objects show that it is highly likely to separate the shadow in a high perce作者: infantile 時(shí)間: 2025-3-23 20:53 作者: 財(cái)主 時(shí)間: 2025-3-23 23:42
Bart Selmangressing outlook as regards LO creation and their incorporation/use in educational contexts. There are also some aspects that would have to be considered in more detail in relation to LO reutilization that are good for analysis and coming up with new lines of action.作者: Projection 時(shí)間: 2025-3-24 02:40
Ehud Shapironguages, input and output operations through memory mapped addressing and isolated addressing, write interrupt service routines in order to service interrupts, multithreading programing, explore memory maps, CPU features, etc. This paper describes the testbed architecture, experiments performed by s作者: 很是迷惑 時(shí)間: 2025-3-24 08:46
Erick Alphonse,Aomar Osmanigressing outlook as regards LO creation and their incorporation/use in educational contexts. There are also some aspects that would have to be considered in more detail in relation to LO reutilization that are good for analysis and coming up with new lines of action.作者: Exploit 時(shí)間: 2025-3-24 12:25 作者: Flawless 時(shí)間: 2025-3-24 17:07 作者: SHRIK 時(shí)間: 2025-3-24 20:53
Stephen Muggleton,Alireza Tamaddoni-Nezhadgressing outlook as regards LO creation and their incorporation/use in educational contexts. There are also some aspects that would have to be considered in more detail in relation to LO reutilization that are good for analysis and coming up with new lines of action.作者: 改變立場 時(shí)間: 2025-3-25 01:38 作者: 狂怒 時(shí)間: 2025-3-25 07:20 作者: GRIPE 時(shí)間: 2025-3-25 09:09
Ulrich Rückert,Stefan Kramereach registered person including the educational activities that he is carrying out each time he enters the training. The design of the proposal includes a pilot experience for the evaluation of the tool by a group of users by means of online surveys and personal interviews. According to the results作者: 我悲傷 時(shí)間: 2025-3-25 15:01 作者: 匍匐前進(jìn) 時(shí)間: 2025-3-25 17:02 作者: analogous 時(shí)間: 2025-3-25 20:02 作者: Debark 時(shí)間: 2025-3-26 02:44
Hendrik Blockeel,Wannes Meerteach registered person including the educational activities that he is carrying out each time he enters the training. The design of the proposal includes a pilot experience for the evaluation of the tool by a group of users by means of online surveys and personal interviews. According to the results作者: 過于平凡 時(shí)間: 2025-3-26 07:56
Jianzhong Chen,Lawrence Kelley,Stephen Muggleton,Michael Sternbergohort in 2019, it was decided to launch it in the 2020 cohort,?using it?for teaching Unit 10 of the subject General and Inorganic Chemistry, in which the contents of Electrochemistry that addresses the?hypermedial?MEHI?material are developed..The work begins with a brief introduction that reviews th作者: indenture 時(shí)間: 2025-3-26 11:49
Guillaume Cleuziou,Lionel Martin,Christel Vrainohort in 2019, it was decided to launch it in the 2020 cohort,?using it?for teaching Unit 10 of the subject General and Inorganic Chemistry, in which the contents of Electrochemistry that addresses the?hypermedial?MEHI?material are developed..The work begins with a brief introduction that reviews th作者: 輕觸 時(shí)間: 2025-3-26 15:32
Koichiro Doi,Tetsuya Yamashita,Akihiro Yamamotoohort in 2019, it was decided to launch it in the 2020 cohort,?using it?for teaching Unit 10 of the subject General and Inorganic Chemistry, in which the contents of Electrochemistry that addresses the?hypermedial?MEHI?material are developed..The work begins with a brief introduction that reviews th作者: 易發(fā)怒 時(shí)間: 2025-3-26 17:39 作者: FLINT 時(shí)間: 2025-3-26 23:18 作者: BRINK 時(shí)間: 2025-3-27 03:22 作者: conquer 時(shí)間: 2025-3-27 05:35 作者: Medley 時(shí)間: 2025-3-27 09:48
Structuring Natural Language Data by Learning Rewriting Rules text is to use a structured term (or tree). We present a method for learning transformation rules, rewriting natural language texts into trees, where the input examples are couples (.). The learning process produces an ordered set of rules such that, applying these rules to a . gives the corresponding ..作者: Thyroxine 時(shí)間: 2025-3-27 15:02 作者: 外貌 時(shí)間: 2025-3-27 20:37 作者: 強(qiáng)制性 時(shí)間: 2025-3-27 22:08 作者: Angioplasty 時(shí)間: 2025-3-28 05:14 作者: 詳細(xì)目錄 時(shí)間: 2025-3-28 07:23
Generalized Ordering-Search for Learning Directed Probabilistic Logical Modelsd conditional probability distributions (CPDs) of directed probabilistic logical models. The algorithm upgrades the ordering-search algorithm for Bayesian networks. We use relational probability trees as a representation for the CPDs. We present experiments on blocks world domains, a gene domain and the Cora dataset.作者: 聯(lián)想 時(shí)間: 2025-3-28 10:54
Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networksa reduction of non-recursive LPADs with a finite Herbrand universe to Bayesian networks. This reduction makes it possible to learn such LPADs using standard learning techniques for Bayesian networks. Thus the class of learnable LPADs is extended.作者: 增長 時(shí)間: 2025-3-28 17:03
Conference proceedings 2007e 16th International Conference of Inductive Logic Programming (ILP 2006) was a radical (hopefully interesting but not cursed) departure from previous years. Submissions were requested in two phases. The ?rst phase involved submission of short papers (three pages) which were then presented at the co作者: myelography 時(shí)間: 2025-3-28 20:53 作者: 描述 時(shí)間: 2025-3-28 23:25 作者: Landlocked 時(shí)間: 2025-3-29 04:12 作者: Panacea 時(shí)間: 2025-3-29 08:24
Extension of the Top-Down Data-Driven Strategy to ILPIn this paper, we present the data-driven strategy of ., in terms of a .-based change of representation of negative examples given a positive . example, and show how it can be extended to ILP. We evaluate a basic implementation of . in the system . on a number of benchmark ILP datasets.作者: invulnerable 時(shí)間: 2025-3-29 13:16
Extracting Requirements from Scenarios with ILPlating the specification and scenarios into an event-based logic programming formalism and using a non-monotonic ILP system to learn a set of missing event preconditions. The contribution of this paper is a novel application of ILP to requirements engineering that also demonstrate the need for non-monotonic learning.作者: 掙扎 時(shí)間: 2025-3-29 19:18 作者: Obliterate 時(shí)間: 2025-3-29 20:42 作者: synovitis 時(shí)間: 2025-3-30 00:46 作者: rectum 時(shí)間: 2025-3-30 08:08 作者: 離開 時(shí)間: 2025-3-30 08:13
First-Order Probabilistic Languages: Into the Unknownnomy that helps make sense of the profusion of FOPLs that have been proposed over the past fifteen years. We also emphasize the importance of representing uncertainty not just about the attributes and relations of a fixed set of objects, but also about what objects exist. This leads us to ., or ., a作者: lymphedema 時(shí)間: 2025-3-30 12:45
Integration of Learning and Reasoning Techniquesvariable problems appeared infeasible. Over the last decade, we have witness a qualitative change in the field: current reasoning engines can handle problems with over a million variables and several millions of constraints. I will discuss what led to such a dramatic scale-up, and how progress in re作者: HALL 時(shí)間: 2025-3-30 19:02
Injecting Life with Computersdo with wires and logic gates. In fact, Alan Turing’s notional computer, which marked in 1936 the birth of modern computer science and still stands at its heart, has greater similarity to natural biomolecular machines such as the ribosome and polymerases than to electronic computers. Recently, a new作者: apropos 時(shí)間: 2025-3-30 21:51
On the Connection Between the Phase Transition of the Covering Test and the Learning Success Rateseveral learning algorithms have been conducted on a large set of artificially generated problems by Botta et al. [3]. The authors generated a set of 451 problems by choosing each target concept according to its location in the (.) plane with respect to the PT. The “yes”, “no” and “pt” regions are u作者: Fraudulent 時(shí)間: 2025-3-31 01:50
Inductive Logic Programming for Gene Regulation Predictionl. The efforts are often based on high-throughput genomic data of model organisms such as S. cerevisiae. The goal of this work is to learn a model of gene regulation predicting under which conditions genes are up- or down-regulated. Our starting point is the model of Middendorf . [1], where the pres作者: cataract 時(shí)間: 2025-3-31 07:51
QG/GA: A Stochastic Search for Progolch which efficiently generates a consistent clause on the fringe of the refinement graph search without needing to explore the graph in detail. We use a Genetic Algorithm (GA) to evolve and re-combine clauses generated by QG. Initial experiments with QG/GA indicate that this approach can be more eff作者: 體貼 時(shí)間: 2025-3-31 11:53
Generalized Ordering-Search for Learning Directed Probabilistic Logical Modelsn proposed. Although many authors provide high-level arguments to show that in principle models in their language can be learned from data, most of the proposed learning algorithms have not yet been studied in detail. We introduce an algorithm, generalized ordering-search, to learn both structure an作者: 暫時(shí)過來 時(shí)間: 2025-3-31 13:22 作者: DEAF 時(shí)間: 2025-3-31 18:10 作者: 菊花 時(shí)間: 2025-4-1 00:56 作者: Harrowing 時(shí)間: 2025-4-1 04:22 作者: Pruritus 時(shí)間: 2025-4-1 09:42 作者: achlorhydria 時(shí)間: 2025-4-1 10:54
