標(biāo)題: Titlebook: Change of Representation and Inductive Bias; D. Paul Benjamin Book 1990 Kluwer Academic Publishers 1990 autonomous system.hierarchical pla [打印本頁] 作者: endocarditis 時間: 2025-3-21 19:38
書目名稱Change of Representation and Inductive Bias影響因子(影響力)
書目名稱Change of Representation and Inductive Bias影響因子(影響力)學(xué)科排名
書目名稱Change of Representation and Inductive Bias網(wǎng)絡(luò)公開度
書目名稱Change of Representation and Inductive Bias網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Change of Representation and Inductive Bias被引頻次
書目名稱Change of Representation and Inductive Bias被引頻次學(xué)科排名
書目名稱Change of Representation and Inductive Bias年度引用
書目名稱Change of Representation and Inductive Bias年度引用學(xué)科排名
書目名稱Change of Representation and Inductive Bias讀者反饋
書目名稱Change of Representation and Inductive Bias讀者反饋學(xué)科排名
作者: 闖入 時間: 2025-3-21 22:28
Improving Problem Solving Performance by Example Guided Reformulation,eatures are explicit in the syntax. This method, in contrast to previous reformulation methods, employs sets of training examples to constrain and direct the reformulation process. The use of examples offers two advantages over purely deductive approaches: First, the examples identify the exact part作者: Gobble 時間: 2025-3-22 02:17
STRATA: Problem Reformulation and Abstract Data Types,e that the performance of an algorithm design system can be enhanced by first reformulating a problem specification into an abstract data type by incorporating relevant problem properties. We will describe the semantics of a class of valid problem reformulations and relate them to the semantics of t作者: aviator 時間: 2025-3-22 07:32
Abstracting First-Order Theories,in search, so that concrete level problems can be solved by first mapping the problems to the abstract level, performing search within the abstract space, and using the abstract solution to guide the concrete level search. Formalizing this mapping requires a precise specification of the relationship作者: 協(xié)定 時間: 2025-3-22 10:04
A Theory of Abstraction for Hierarchical Planning,ot well understood. This paper formally defines hierarchical planning, shows that the technique can reduce an exponential search space to a linear one, and identifies the assumptions under which this analysis holds. Since these assumptions would be difficult to guarantee in general, the paper identi作者: 多嘴 時間: 2025-3-22 15:40 作者: 多嘴 時間: 2025-3-22 18:44 作者: Texture 時間: 2025-3-22 21:51 作者: faddish 時間: 2025-3-23 04:58
Similarities in Problem Solving Strategies,to be a functor from the category of problems to the category of solutions. Two strategies are considered similar if there is a natural transformation on one into the other..Prof. Takahara considered the case where problems are defined by pay-off matrices and solutions are pre-orders on the rows of 作者: 過時 時間: 2025-3-23 05:32
Constraint Incorporation and the Structure Mismatch Problem,icit forms. The compilation techniques we are developing produce a . problem solver where the generators produce values for solution parameters, and the testers check the satisfaction of the problem constraints. To improve the efficiency of the generate-and-test problem solver, our approach uses . t作者: 記憶 時間: 2025-3-23 13:23 作者: 凝結(jié)劑 時間: 2025-3-23 14:55
Efficient Candidate Elimination Through Test Incorporation,g as output. One language bias is stronger (weaker) than another if the hypothesis space of the first bias is a subset (superset) of the hypothesis space of the second bias. For example, a system that always produces a conjunctive hypothesis has a stronger language bias than a system that can produc作者: 鑒賞家 時間: 2025-3-23 19:08
Comparing Instance-Averaging with Instance-Saving Learning Algorithms,is paper concerns two methods for reducing storage requirements for instance-based learning algorithms. The first method, termed instance-saving, represents concept descriptions by selecting and storing a representative subset of the given training instances. We provide an analysis for instance-savi作者: SPALL 時間: 2025-3-24 01:47
A Logical Model of Machine Learning a Study of Vague Predicates,g objects; we formally account for the context sensitivity of recognition observed by W. Labov. We show how multiple theories of “cup” can be combined in a new theory of that concept. Finally, we conjecture that operationality in explanation based learning is related to the cost of abduction..The lo作者: 巡回 時間: 2025-3-24 06:21
Declarative Bias: An Overview,e role of knowledge that the system itself possesses in generating and selecting among inductive hypotheses. Inductive learning has often been characterized as a search in a hypothesis space for hypotheses consistent with observations. It is shown that committing to a given hypothesis space is equiv作者: 低位的人或事 時間: 2025-3-24 08:37 作者: 拱形面包 時間: 2025-3-24 12:07 作者: 特征 時間: 2025-3-24 15:21 作者: 談判 時間: 2025-3-24 22:45 作者: SIT 時間: 2025-3-25 00:37 作者: Subdue 時間: 2025-3-25 04:59
Planning disassembly with stochastic yields,g as output. One language bias is stronger (weaker) than another if the hypothesis space of the first bias is a subset (superset) of the hypothesis space of the second bias. For example, a system that always produces a conjunctive hypothesis has a stronger language bias than a system that can produce arbitrary disjunctions of conjunctions.作者: murmur 時間: 2025-3-25 09:51
The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/c/image/223727.jpg作者: dictator 時間: 2025-3-25 14:32
Decompiling Problem-Solving Experience to Elucidate Representational Distinctions,es efficiency, but flexibility is greatly compromised. In this paper I discuss an alternative that extracts relevant distinctions from problem-solving traces and creates explicit representational terms for them. The new terms are seamlessly integrated into declarative knowledge and are effectively utilized in subsequent problem solving.作者: IRATE 時間: 2025-3-25 19:23
Knowledge as Bias, generalize training data before doing empirical learning. The combination operates like empirical learning given no knowledge, but can utilize knowledge when provided, and therefore exhibits behavior along aspectrum from knowledge-poor to knowledge-rich learning. When used in this way knowledge can be viewed as an explicit bias for learning.作者: VICT 時間: 2025-3-25 20:23 作者: Hemodialysis 時間: 2025-3-26 00:40 作者: 流逝 時間: 2025-3-26 06:01 作者: finite 時間: 2025-3-26 08:28 作者: HAIL 時間: 2025-3-26 14:30 作者: Celiac-Plexus 時間: 2025-3-26 16:49
https://doi.org/10.1007/978-0-387-48576-8ot well understood. This paper formally defines hierarchical planning, shows that the technique can reduce an exponential search space to a linear one, and identifies the assumptions under which this analysis holds. Since these assumptions would be difficult to guarantee in general, the paper identi作者: Harass 時間: 2025-3-27 01:01
https://doi.org/10.1007/978-0-387-48576-8 ability to solve problems, answer questions, and acquire knowledge has traditionally been bounded by its initial problem representation. One solution to this dilemma is to develop systems which can automatically alter their problem representation. This research deals with automatically shifting fro作者: 不足的東西 時間: 2025-3-27 02:42 作者: rods366 時間: 2025-3-27 09:02
Reflections on New Perspectives,help a programmer to choose (or derive) a good representation — we call such a system a .. To make this system possible requires well-founded knowledge about what makes a representation effective and what makes a representation sound. This paper is in part a catalogue of the kinds of mathematical re作者: Enzyme 時間: 2025-3-27 12:37
https://doi.org/10.1007/978-3-8350-9595-3to be a functor from the category of problems to the category of solutions. Two strategies are considered similar if there is a natural transformation on one into the other..Prof. Takahara considered the case where problems are defined by pay-off matrices and solutions are pre-orders on the rows of 作者: 用手捏 時間: 2025-3-27 16:53
Planning disassembly with stochastic yields,icit forms. The compilation techniques we are developing produce a . problem solver where the generators produce values for solution parameters, and the testers check the satisfaction of the problem constraints. To improve the efficiency of the generate-and-test problem solver, our approach uses . t作者: 送秋波 時間: 2025-3-27 19:06 作者: BLANK 時間: 2025-3-28 01:20 作者: objection 時間: 2025-3-28 06:05 作者: obtuse 時間: 2025-3-28 08:33
Planning Support Systems and Smart Citiesg objects; we formally account for the context sensitivity of recognition observed by W. Labov. We show how multiple theories of “cup” can be combined in a new theory of that concept. Finally, we conjecture that operationality in explanation based learning is related to the cost of abduction..The lo作者: critique 時間: 2025-3-28 11:01
PlanningTheory: Reconstruction or Requiem?,e role of knowledge that the system itself possesses in generating and selecting among inductive hypotheses. Inductive learning has often been characterized as a search in a hypothesis space for hypotheses consistent with observations. It is shown that committing to a given hypothesis space is equiv作者: 彎曲道理 時間: 2025-3-28 15:14
PlanningTheory: Reconstruction or Requiem?,f physical laws [Kokar, 1986a, 1986b]. It was incorporated in the procedures of COPER, and thus was applicable to the domain of physical laws. This paper presents a step toward construction of a domain-independent module whose goal is to find invariants and utilize them for constructive induction of作者: 煤渣 時間: 2025-3-28 21:09 作者: 完成 時間: 2025-3-28 22:55 作者: BAIT 時間: 2025-3-29 03:41 作者: 浮雕寶石 時間: 2025-3-29 08:25 作者: 色情 時間: 2025-3-29 14:15
978-1-4612-8817-6Kluwer Academic Publishers 1990作者: Ige326 時間: 2025-3-29 17:00
https://doi.org/10.1007/978-0-387-48576-8goal. Next, the set of explanations is “clustered” into cases and then generalized using the induction over explanations method, forming a set of general explanations. Finally, these general explanations are reformulated into new domain theory rules. We illustrate the method in the domain of chess. 作者: Immunotherapy 時間: 2025-3-29 23:15
https://doi.org/10.1007/978-0-387-48576-8e distinctions are not . with respect to a given problem solver for a given class of problems. We then present a meta-theoretical principle of ontological economy called the .. The irrelevance principle logically . a formulation by removing all facts and distinctions that are either logically or com作者: 暫時過來 時間: 2025-3-30 00:15 作者: 特別容易碎 時間: 2025-3-30 06:01
Planning disassembly with stochastic yields,the assumptions of instance-averaging algorithms and describe how their violation might degrade performance. To mitigate the effects of non-convex concepts, a dynamic distance-thresholding technique is introduced and applied in both the averaging and non-averaging learning algorithms. Thresholding i作者: figure 時間: 2025-3-30 12:02
Book 1990 to improve their effectiveness. At the Fourth Machine Learning Workshop held in June, 1987, at the University of California at Irvine, it became clear that the both the machine learning community and the number of topics it addresses had grown so large that the representation issue could not be dis作者: habitat 時間: 2025-3-30 15:13 作者: SKIFF 時間: 2025-3-30 18:26 作者: Osteoporosis 時間: 2025-3-31 00:36 作者: 桉樹 時間: 2025-3-31 04:41
Comparing Instance-Averaging with Instance-Saving Learning Algorithms,the assumptions of instance-averaging algorithms and describe how their violation might degrade performance. To mitigate the effects of non-convex concepts, a dynamic distance-thresholding technique is introduced and applied in both the averaging and non-averaging learning algorithms. Thresholding i作者: 禁止,切斷 時間: 2025-3-31 06:07 作者: 有說服力 時間: 2025-3-31 10:04 作者: 過多 時間: 2025-3-31 16:49 作者: 有花 時間: 2025-3-31 21:15 作者: 上流社會 時間: 2025-3-31 22:31 作者: Infelicity 時間: 2025-4-1 03:44 作者: Offset 時間: 2025-4-1 07:04
PlanningTheory: Reconstruction or Requiem?,per presents a step toward construction of a domain-independent module whose goal is to find invariants and utilize them for constructive induction of functional concepts. To this aim, the features of COPER are expressed in the language of algebra, and the algorithm for constructive induction of concepts is described.作者: 笨拙的你 時間: 2025-4-1 13:47 作者: 典型 時間: 2025-4-1 18:04
