作者: Initial 時(shí)間: 2025-3-21 23:10 作者: 頌揚(yáng)國(guó)家 時(shí)間: 2025-3-22 04:15
Term comparisons in first-order similarity measures,s. We present an improved similarity measure for the first-order instance based learner . that employs the concept of . to efficiently compute distances between lists and terms, discuss its computational and formal properties, and show that it is empirically superior by a wide margin on a problem from the domain of biochemistry.作者: PACT 時(shí)間: 2025-3-22 06:09
Using ILP-systems for verification and validation of multi-agent systems,he software can be induced from the behaviour of the software. These rules can be readily interpreted by the designers or users of the software, and can in turn result in changes to the software. The approach outlined was tested in the domain of multi-agent systems, more in particular the RoboCup domain.作者: Graves’-disease 時(shí)間: 2025-3-22 10:04 作者: TOXIN 時(shí)間: 2025-3-22 14:53 作者: Communicate 時(shí)間: 2025-3-22 19:08 作者: 生命層 時(shí)間: 2025-3-22 21:17
0302-9743 Wisconsin, USA, in July 1998..The 27 revised full papers presented together with the abstracts of three invited talks were carefully reviewed and selected for inclusion in the book. All relevant aspects of inductive logic programming are covered ranging from theory to implementations and application作者: 稱贊 時(shí)間: 2025-3-23 05:09 作者: 共和國(guó) 時(shí)間: 2025-3-23 06:00
Combining statistical and relational methods for learning in hypertext domains,ages, and (iii) locating a particular class of information in the internal structure of pages. Our experiments demonstrate that this new approach is able to learn more accurate classifiers than either of its constituent methods alone.作者: GIBE 時(shí)間: 2025-3-23 12:50
Learning multilingual morphology with ,,ile FOIDL is, due to efficiency reasons, severely limited in the size of the training set, CLOG does not suffer from such limitations. With the increase of the training set size possible with CLOG, it significantly outperforms FOIDL and learns highly accurate morphological rules.作者: 開頭 時(shí)間: 2025-3-23 17:23
Repeat learning using predicate invention, learning experiments within a chess domain. The results indicate that significant performance increases can be achieved. The paper develops a Bayesian framework and demonstrates initial theoretical results for repeat learning.作者: 騎師 時(shí)間: 2025-3-23 20:39
Strongly typed inductive concept learning,n Escher, a typed, higher-order, functional logic programming language being developed at the University of Bristol. We argue that the use of a type system provides better ways to discard meaningless hypotheses on syntactic grounds and encompasses many . approaches to declarative bias.作者: Banister 時(shí)間: 2025-3-24 00:21
Application of inductive logic programming to discover rules governing the three-dimensional topoloearly stage of development, the rules produced can only be applied to proteins for which the secondary structure is known. However, since the rules are insightful, they should prove to be helpful in assisting the development of taxonomic schemes. The application of ILP to fold recognition represents a novel and promising approach to this problem.作者: 狗舍 時(shí)間: 2025-3-24 05:39
A stochastic simple similarity,similarity function with controllable complexity. Preliminary experiments on the well-studied mutagenesis problem (regression-friendly and regression-unfriendly datasets) demonstrate the potential and the limitations of this similarity.作者: justify 時(shí)間: 2025-3-24 09:22
Induction of Constraint Grammar-rules using Progol,is a realistic way of learning rules of good quality with a minimum of manual effort. When tested on unseen data, 97% of the words retain the correct reading after tagging leaving an ambiguity of 1.15 readings per word.作者: Axon895 時(shí)間: 2025-3-24 13:37 作者: notice 時(shí)間: 2025-3-24 18:02
Stochastic propositionalization of non-determinate background knowledge,thm to automatically derive features from non-determinate background knowledge. The algorithm conducts a top-down search for first-order clauses, where each clause represents a binary feature. These features are used instead of the non-determinate relations in a subsequent induction step. In contras作者: 健忘癥 時(shí)間: 2025-3-24 21:55 作者: Armory 時(shí)間: 2025-3-25 01:20 作者: 不透明 時(shí)間: 2025-3-25 06:02 作者: 注入 時(shí)間: 2025-3-25 11:22
Chandra Reddy,Prasad Tadepallicomputer Programming for parallel/distributed computing is presented using the message-passing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the 作者: mastopexy 時(shí)間: 2025-3-25 12:10
Seán Slattery,Mark Cravencomputer Programming for parallel/distributed computing is presented using the message-passing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the 作者: 抵制 時(shí)間: 2025-3-25 16:25
Marcel Turcotte,Stephen H. Muggleton,Michael J. E. Sternbergcomputer Programming for parallel/distributed computing is presented using the message-passing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the 作者: byline 時(shí)間: 2025-3-25 22:13 作者: HEDGE 時(shí)間: 2025-3-26 01:46 作者: MOTTO 時(shí)間: 2025-3-26 07:57 作者: 評(píng)論者 時(shí)間: 2025-3-26 12:27 作者: 小步舞 時(shí)間: 2025-3-26 15:26 作者: Agility 時(shí)間: 2025-3-26 17:04
Tomofumi Nakano,Nobuhiro Inuzuka,Hirohisa Seki,Hidenori Itohon the representation of programs. Lisp is a language offering macros and much of its extensibility stems from them. However, many problems arise from macros, amongst them being the exact definition of when, where and how the macroexpansion is done to turn the body of a module using extended syntaxe作者: arthroplasty 時(shí)間: 2025-3-27 00:34 作者: Myofibrils 時(shí)間: 2025-3-27 05:06
Leonardo Fogel,Gerson Zaveruchaon the representation of programs. Lisp is a language offering macros and much of its extensibility stems from them. However, many problems arise from macros, amongst them being the exact definition of when, where and how the macroexpansion is done to turn the body of a module using extended syntaxe作者: 表被動(dòng) 時(shí)間: 2025-3-27 08:42 作者: 領(lǐng)帶 時(shí)間: 2025-3-27 13:02
A. Srinivasansing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the 978-1-4899-9443-1978-1-4614-1168-0作者: NEX 時(shí)間: 2025-3-27 14:47 作者: 粗野 時(shí)間: 2025-3-27 19:36
Uta Bohnebeck,Tamás Horváth,Stefan Wrobelsing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the 978-1-4899-9443-1978-1-4614-1168-0作者: 先兆 時(shí)間: 2025-3-27 22:21 作者: 拖網(wǎng) 時(shí)間: 2025-3-28 05:49
Dimitar Kazakov,Suresh Manandharsing paradigm which is at the heart of large clusters of computers. This leads to descriptions of current hardware platforms for large-scale computing, such as clusters of as many as one thousand which are the 978-1-4899-9443-1978-1-4614-1168-0作者: HUMID 時(shí)間: 2025-3-28 06:54 作者: 光滑 時(shí)間: 2025-3-28 12:51 作者: generic 時(shí)間: 2025-3-28 16:12 作者: 財(cái)主 時(shí)間: 2025-3-28 20:21 作者: Nonconformist 時(shí)間: 2025-3-29 02:15 作者: Confound 時(shí)間: 2025-3-29 03:26 作者: 娘娘腔 時(shí)間: 2025-3-29 07:26
Term comparisons in first-order similarity measures,er can be gained by allowing lists and other terms in the input representation and designing similarity measures that work directly on these structures. We present an improved similarity measure for the first-order instance based learner . that employs the concept of . to efficiently compute distanc作者: 警告 時(shí)間: 2025-3-29 14:48 作者: placebo-effect 時(shí)間: 2025-3-29 18:06 作者: 檢查 時(shí)間: 2025-3-29 22:46
Using prior probabilities and density estimation for relational classification,mation. Estimated densities and defined prior are combined in Bayes theorem to perform relational classification. An initial application of the technique is made to part-of-speech (POS) tagging. A novel use of Gibbs sampling for POS tagging is given.作者: 違抗 時(shí)間: 2025-3-30 01:38 作者: Rct393 時(shí)間: 2025-3-30 06:55
A hybrid approach to word segmentation, First, a bias for word segmentation is introduced and a simple genetic algorithm is used for the search of segmentation that corresponds to the best bias value. In the second phase, the segmentation obtained from the genetic algorithm is used as an input for two inductive logic programming algorith作者: 新義 時(shí)間: 2025-3-30 08:47 作者: drusen 時(shí)間: 2025-3-30 12:29
Using ILP-systems for verification and validation of multi-agent systems,amely verification and validation of knowledge based systems and multi-agent systems. Using inductive logic programming, partial . specifications of the software can be induced from the behaviour of the software. These rules can be readily interpreted by the designers or users of the software, and c作者: MAG 時(shí)間: 2025-3-30 18:05
Inducing shogi heuristics using inductive logic programming, using shogi rules. The problems can be solved by heuristic search of AND-OR trees. We propose a method of using the ILP technique to generate heuristic functions, which are automatically tuned according to the confidence of the knowledge induced by ILP. Experiments show that the method prunes searc作者: 凹槽 時(shí)間: 2025-3-31 00:20 作者: Angiogenesis 時(shí)間: 2025-3-31 04:35
Normal programs and multiple predicate learning,t can be handled and induced in a top-down manner by an intensional system. We propose an algorithm called NMPL that improves the multiple predicate learning system MPL and extends its language from definite to this class of normal programs. Finally, we discuss the cost of the MPL‘s refinement algor作者: incontinence 時(shí)間: 2025-3-31 07:24
Strongly typed inductive concept learning,or knowledge representation in inductive concept learning and, in particular, illu minates the relationship between attribute-value learning and inductive logic programming (ILP). Individuals are represented by closed terms: tuples of constants in the case of attribute-value learning; arbitrarily co作者: 樹木中 時(shí)間: 2025-3-31 12:35 作者: forager 時(shí)間: 2025-3-31 17:09
Luc De Raedtare and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain classical theoretical computer science topics such as Unsolvability (e.g. the halting problem) and Undecidabi作者: 發(fā)起 時(shí)間: 2025-3-31 20:05
Stephen Muggletonare and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain classical theoretical computer science topics such as Unsolvability (e.g. the halting problem) and Undecidabi作者: CLOUT 時(shí)間: 2025-4-1 00:33 作者: Sleep-Paralysis 時(shí)間: 2025-4-1 04:35 作者: jarring 時(shí)間: 2025-4-1 07:00 作者: 情感脆弱 時(shí)間: 2025-4-1 12:11
Seán Slattery,Mark Cravenare and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain classical theoretical computer science topics such as Unsolvability (e.g. the halting problem) and Undecidabi作者: 殺死 時(shí)間: 2025-4-1 15:00
Marcel Turcotte,Stephen H. Muggleton,Michael J. E. Sternbergare and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain classical theoretical computer science topics such as Unsolvability (e.g. the halting problem) and Undecidabi作者: foppish 時(shí)間: 2025-4-1 20:07
Uta Bohnebeck,Tamás Horváth,Stefan Wrobelfy computer scientists and engineers.Covers a new kind of co.Computer Science: The Hardware, Software and Heart of It. focuses on the deeper aspects of the two recognized subdivisions of Computer Science, Software and Hardware. These subdivisions are shown to be closely interrelated as a result of t作者: Original 時(shí)間: 2025-4-2 01:06
Stefan Kramer,Bernhard Pfahringer,Christoph Helmafy computer scientists and engineers.Covers a new kind of co.Computer Science: The Hardware, Software and Heart of It. focuses on the deeper aspects of the two recognized subdivisions of Computer Science, Software and Hardware. These subdivisions are shown to be closely interrelated as a result of t
