作者: Carminative 時(shí)間: 2025-3-21 21:21 作者: coddle 時(shí)間: 2025-3-22 00:32
Learning when negative examples abound,le brought about by imbalanced training sets and presents a learning algorithm addressing this issue. The experiments (with synthetic and real-world data) focus on 2-class problems with examples described with binary and continuous attributes.作者: radiograph 時(shí)間: 2025-3-22 07:04 作者: appall 時(shí)間: 2025-3-22 09:33
Constructing and sharing perceptual distinctions,The paper describes a mechanism whereby agents generate perceptual distinctions through a series of adaptive discrimination games and share these distinctions through adaptive language games. Results from computer simulations as well as experiments on robotic agents are presented.作者: 四牛在彎曲 時(shí)間: 2025-3-22 13:37 作者: 火花 時(shí)間: 2025-3-22 18:36
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/620759.jpg作者: Anticonvulsants 時(shí)間: 2025-3-22 22:54 作者: Instantaneous 時(shí)間: 2025-3-23 03:46
Induction of feature terms with INDIE,ibute-value representation. Feature terms have been studied to formalize object-centered representation in declarative languages and can be seen as a subset of first-order logic. We present a representation formalism based on feature terms and we show how induction can be performed in a natural way 作者: evince 時(shí)間: 2025-3-23 07:24
Exploiting qualitative knowledge to enhance skill acquisition,ing to perform motor tasks, a problem known as .. A very difficult purpose because the overwhole behavior of an agent is the result of quite a complex activity, involving sensory, planning and motor processing. In this paper, I present a novel approach for acquiring new skills, named ., that is char作者: Munificent 時(shí)間: 2025-3-23 11:28
Integrated learning and planning based on truncating temporal differences,time steps may be required before this trial- and-error process converges to a satisfactory policy. It is highly desirable that the number of experiences needed by the system to learn to perform its task be minimized, particularly if making errors costs much. One approach to achieve this goal is to 作者: 我還要背著他 時(shí)間: 2025-3-23 16:25 作者: 逃避責(zé)任 時(shí)間: 2025-3-23 19:14
Classification by Voting Feature Intervals,e participates in the classification by distributing real-valued votes among classes. The class receiving the highest vote is declared to be the predicted class. VFI is compared with the ., which also considers each feature separately. Experiments on real-world datasets show that VFI achieves compar作者: outrage 時(shí)間: 2025-3-23 22:22
Constructing intermediate concepts by decomposition of real functions,uring of the learning problem is that it makes the learning easier and improves the comprehensibility of induced descriptions. In this paper, we develop a technique for discovering useful intermediate concepts when both the class and the attributes are real-valued. The technique is based on a decomp作者: instill 時(shí)間: 2025-3-24 03:14
,Conditions for Occam’s razor applicability and noise elimination,e problem domain and has the highest prediction accuracy when classifying new instances. This principle is implicitly used also for dealing with noise, in order to avoid overfitting a noisy training set by rule truncation or by pruning of decision trees. This work gives a theoretical framework for t作者: 結(jié)束 時(shí)間: 2025-3-24 09:31
Learning different types of new attributes by combining the neural network and iterative attribute mbinations. Most are only capable of constructing relatively smaller new attributes. Though it is impossible to build a learner to learn any arbitrarily large and complex concept, there are some large and complex concepts that could be represented in a simple relation such as prototypical concepts, 作者: 斜谷 時(shí)間: 2025-3-24 10:57 作者: 無節(jié)奏 時(shí)間: 2025-3-24 15:48 作者: 散步 時(shí)間: 2025-3-24 23:01 作者: 圓錐體 時(shí)間: 2025-3-24 23:46
Learning Linear Constraints in Inductive Logic Programming, to consider, as in the field of Constraint Logic Programming, a specific computation domain and to handle terms by taking into account their values in this domain. Nevertheless, an earlier version of our system was only able to learn constraints ..=t, where .. is a variable and . is a term. We prop作者: CANDY 時(shí)間: 2025-3-25 06:48 作者: BRIEF 時(shí)間: 2025-3-25 10:41
Inductive Genetic Programming with Decision Trees,ient navigation of the search process is presented. It relies on analysis of the fitness landscape structure and suggests measuring its characteristics with statistical correlations. We demonstrate that this approach increases the global landscape correlation, and thus leads to mitigation of the sea作者: HEED 時(shí)間: 2025-3-25 12:22
Parallel and distributed search for structure in multivariate time series,ithm that performs a systematic search for structure in multivariate time series of categorical data. The systematicity of .‘s search makes implementation of both parallel and distributed versions straightforward. Distributing the search for structure over multiple processors or networked machines m作者: GRATE 時(shí)間: 2025-3-25 18:05 作者: 檢查 時(shí)間: 2025-3-25 21:34 作者: 多山 時(shí)間: 2025-3-26 03:07
Stuart Russellation spaces, and quotient spaces.Requires only some familiaThis book is a revised and enlarged edition of "Linear Algebraic Groups", published by W.A. Benjamin in 1969. The text of the first edition has been corrected and revised. Accordingly, this book presents foundational material on algebraic g作者: 網(wǎng)絡(luò)添麻煩 時(shí)間: 2025-3-26 04:58
Luc Steelsation spaces, and quotient spaces.Requires only some familiaThis book is a revised and enlarged edition of "Linear Algebraic Groups", published by W.A. Benjamin in 1969. The text of the first edition has been corrected and revised. Accordingly, this book presents foundational material on algebraic g作者: 殺人 時(shí)間: 2025-3-26 08:44 作者: 拋射物 時(shí)間: 2025-3-26 13:59 作者: 細(xì)菌等 時(shí)間: 2025-3-26 19:34 作者: 落葉劑 時(shí)間: 2025-3-27 00:07 作者: 創(chuàng)作 時(shí)間: 2025-3-27 04:32 作者: 吼叫 時(shí)間: 2025-3-27 05:29 作者: harmony 時(shí)間: 2025-3-27 13:03 作者: 慢慢啃 時(shí)間: 2025-3-27 16:01
0302-9743 , in April 1997..This volume presents 26 revised full papers selected from a total of 73 submissions. Also included are an abstract and two papers corresponding to the invited talks as well as descriptions from four satellite workshops. The volume covers the whole spectrum of current machine learnin作者: ventilate 時(shí)間: 2025-3-27 19:55
Classification by Voting Feature Intervals,cted class. VFI is compared with the ., which also considers each feature separately. Experiments on real-world datasets show that VFI achieves comparably and even better than NBC in terms of classification accuracy. Moreover, VFI is faster than NBC on all datasets.作者: 江湖郎中 時(shí)間: 2025-3-27 22:49 作者: 險(xiǎn)代理人 時(shí)間: 2025-3-28 05:23
0302-9743 responding to the invited talks as well as descriptions from four satellite workshops. The volume covers the whole spectrum of current machine learning issues.978-3-540-62858-3978-3-540-68708-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 主講人 時(shí)間: 2025-3-28 08:03 作者: Oligarchy 時(shí)間: 2025-3-28 12:54 作者: Foregery 時(shí)間: 2025-3-28 17:01 作者: 黑豹 時(shí)間: 2025-3-28 20:25
Metrics on terms and clauses,t is easy to form metrics on clauses, by a technique due to F.Hausdorff. They will be applicable to generalization from sets of ground clauses, to discovery of heuristic guidance for theorem proving, and to inductive logic programming.作者: monologue 時(shí)間: 2025-3-29 02:01 作者: 魯莽 時(shí)間: 2025-3-29 03:15
Compression-based pruning of decision lists,ains. Simple hill-climbing search for the most compressive decision list significantly reduces the complexity of a given decision list while not impeding and sometimes even improving its predictive accuracy.作者: Terrace 時(shí)間: 2025-3-29 09:18 作者: 平躺 時(shí)間: 2025-3-29 12:32
Induction of feature terms with INDIE,. An example of such inductive methods, ., is presented. . performs bottom-up heuristic search on the subsumption lattice of the feature term space. Results of this method on several domains are explained.作者: 暫停,間歇 時(shí)間: 2025-3-29 18:05
,θ-subsumption for structural matching,such that the remaining problems disappear. Defining clauses as universally quantified disjunctions of literals and productions as existentially quantified conjunctions of literals, it is shown that the lattice on clauses imposed by θ-subsumption is order-isomorphic to the lattice on productions needed for structural matching.作者: innovation 時(shí)間: 2025-3-29 21:58
Parallel and distributed search for structure in multivariate time series,ultivariate time series, and that the distributed version finds the same structure in approximately 1/. of the time required by ., where . is the number of machines across which the search is distributed.作者: Kernel 時(shí)間: 2025-3-30 02:32
Integrated learning and planning based on truncating temporal differences,entially no additional computational expense. Two different ways of combining TTD with planning are proposed which make it possible to benefit from λ>0 in both the learning and planning processes. The algorithms are evaluated experimentally on a family of grid path-finding tasks and shown to indeed 作者: 堅(jiān)毅 時(shí)間: 2025-3-30 04:07 作者: 澄清 時(shí)間: 2025-3-30 10:57
isogenies and the structure of the group of rational points of an isotropic reductive group. The main prerequisite is some familiarity with algebraic geometry. The main notions and results needed are summarized in a chapter with references and brief proofs.978-1-4612-6954-0978-1-4612-0941-6Series ISSN 0072-5285 Series E-ISSN 2197-5612 作者: BLUSH 時(shí)間: 2025-3-30 13:31
Stuart Russell isogenies and the structure of the group of rational points of an isotropic reductive group. The main prerequisite is some familiarity with algebraic geometry. The main notions and results needed are summarized in a chapter with references and brief proofs.978-1-4612-6954-0978-1-4612-0941-6Series ISSN 0072-5285 Series E-ISSN 2197-5612 作者: crescendo 時(shí)間: 2025-3-30 19:53
Luc Steels isogenies and the structure of the group of rational points of an isotropic reductive group. The main prerequisite is some familiarity with algebraic geometry. The main notions and results needed are summarized in a chapter with references and brief proofs.978-1-4612-6954-0978-1-4612-0941-6Series ISSN 0072-5285 Series E-ISSN 2197-5612 作者: 宴會 時(shí)間: 2025-3-30 22:50
Paul Vitányi,Ming Li isogenies and the structure of the group of rational points of an isotropic reductive group. The main prerequisite is some familiarity with algebraic geometry. The main notions and results needed are summarized in a chapter with references and brief proofs.978-1-4612-6954-0978-1-4612-0941-6Series ISSN 0072-5285 Series E-ISSN 2197-5612 作者: mortuary 時(shí)間: 2025-3-31 01:08 作者: etiquette 時(shí)間: 2025-3-31 07:47 作者: Junction 時(shí)間: 2025-3-31 12:27
8樓作者: 微粒 時(shí)間: 2025-3-31 16:44
8樓作者: 培養(yǎng) 時(shí)間: 2025-3-31 20:21
9樓作者: 敘述 時(shí)間: 2025-4-1 01:38
9樓作者: 褲子 時(shí)間: 2025-4-1 05:02
9樓作者: 駕駛 時(shí)間: 2025-4-1 07:21
9樓作者: Psychogenic 時(shí)間: 2025-4-1 13:07
10樓作者: engender 時(shí)間: 2025-4-1 14:52
10樓作者: 兩棲動物 時(shí)間: 2025-4-1 21:04
10樓作者: 乞討 時(shí)間: 2025-4-2 00:45
10樓
