標題: Titlebook: Case-Based Reasoning Research and Development; 19th International C Ashwin Ram,Nirmalie Wiratunga Conference proceedings 2011 Springer-Verl [打印本頁] 作者: quick-relievers 時間: 2025-3-21 19:13
書目名稱Case-Based Reasoning Research and Development影響因子(影響力)
書目名稱Case-Based Reasoning Research and Development影響因子(影響力)學科排名
書目名稱Case-Based Reasoning Research and Development網(wǎng)絡公開度
書目名稱Case-Based Reasoning Research and Development網(wǎng)絡公開度學科排名
書目名稱Case-Based Reasoning Research and Development被引頻次
書目名稱Case-Based Reasoning Research and Development被引頻次學科排名
書目名稱Case-Based Reasoning Research and Development年度引用
書目名稱Case-Based Reasoning Research and Development年度引用學科排名
書目名稱Case-Based Reasoning Research and Development讀者反饋
書目名稱Case-Based Reasoning Research and Development讀者反饋學科排名
作者: 詞匯表 時間: 2025-3-21 21:10 作者: 終端 時間: 2025-3-22 04:14
Invariants of One-Factorizations,ttleneck in this work has often been the development of case libraries needed to support this reasoning rather than the transformation of the cases themselves. In much of our work, we have taken an approach in which we treat web-recourses as the distributed knowledge engineering that can be integrat作者: 跳脫衣舞的人 時間: 2025-3-22 05:25
As Close to Perfection As Humanly Possibleng Jeopardy! questions is text from written sources such as encyclopedias or news articles. A text passage may partially or fully indicate that some candidate answer is the correct answer to the question. Recognizing whether it does requires determining the extent to which what the passage is saying作者: 省略 時間: 2025-3-22 12:35
As Close to Perfection As Humanly Possible One might think that with the definition of commonalities and differences, the definition of similarities in and for ontologies should follow immediately. Traditionally, however, the contrary is true, because the method background of ontologies, i.e. logics-based representations, and similarity, i.作者: 引導 時間: 2025-3-22 15:27 作者: 引導 時間: 2025-3-22 17:54 作者: Clinch 時間: 2025-3-22 22:39
https://doi.org/10.1007/978-1-4757-2834-7e select three different complexity measures and use them to evaluate eight case base editing algorithms. While we might expect the complexity of a case base to decrease, or stay the same, and the classification accuracy to increase, or stay the same, after maintenance, we find many counter-examples作者: 強制令 時間: 2025-3-23 04:55
Mathematical Fundamentals of Optimal Controlssive way, then adapting the source cases corresponding to the generalised target problem. This paper shows how enriching this ontology improves the retrieval and final results of the CBR system. An existing ontology is enriched by automatically adding new classes that will refine the initial organi作者: 揮舞 時間: 2025-3-23 07:21
Mathematical Fundamentals of Optimal Controlsally applicable methodological framework for CBR on the basis of formal concepts and methods for knowledge representation and reasoning with preferences. A preference-based approach to CBR appears to be appealing for several reasons, notably because case-based experiences naturally lend themselves 作者: CLOUT 時間: 2025-3-23 11:45
Mathematical Fundamentals of Optimal Controlncounters is a crucial factor in its performance. Consequently, the ability to assess the current level of case-base coverage and to predict the incremental benefit of adding cases could play an important role in guiding the case acquisition process. This paper demonstrates that such tasks require d作者: sundowning 時間: 2025-3-23 14:46 作者: thrombus 時間: 2025-3-23 19:25 作者: 使尷尬 時間: 2025-3-24 02:02 作者: Middle-Ear 時間: 2025-3-24 04:35 作者: Eulogy 時間: 2025-3-24 10:09 作者: 是限制 時間: 2025-3-24 13:25
Rein Luus,Wichaya Mekarapiruk,Colin Storeyere extends the existing Explicit Semantic Analysis approach to representation, where textual content is represented using concepts with correspondence to Wikipedia articles. We present approaches to identify Wikipedia pages that are likely to contribute to the effectiveness of text classification t作者: seruting 時間: 2025-3-24 16:46 作者: 外貌 時間: 2025-3-24 22:02
Rein Luus,Wichaya Mekarapiruk,Colin Storeys of the group. The goal in this paper is the use of personality and trust as the mean to define alliances to reach agreements inside a group of people. The approach reproduces the behaviour of real users when negotiating a common item to consume using three variables: personality, trust and persona作者: 拋棄的貨物 時間: 2025-3-25 00:09 作者: Thyroiditis 時間: 2025-3-25 03:41
Case-Based Reasoning Research and Development978-3-642-23291-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 省略 時間: 2025-3-25 11:29
https://doi.org/10.1007/978-3-642-23291-6application domain ontologies; case-based categorization; case-based classification; description logic; 作者: Pedagogy 時間: 2025-3-25 15:14
978-3-642-23290-9Springer-Verlag GmbH Berlin Heidelberg 2011作者: 苦惱 時間: 2025-3-25 18:10
https://doi.org/10.1007/978-1-4757-3218-4This paper addresses the automated acquisition of adaptation cases for the modification of scientific workflows. Pairs of workflow versions from community repositories are analysed to extract transformation pathways from one workflow version to another. An algorithmic solution is provided and investigated by experiments with promising results.作者: 嘮叨 時間: 2025-3-25 22:47 作者: Provenance 時間: 2025-3-26 02:43
As Close to Perfection As Humanly Possibleorithm originally developed for analogical reasoning) is applied to determine similarity between content in questions and passages. That algorithm is one of many used in the Watson question answering system [2]. It contributes a significant amount to Watson’s effectiveness.作者: 小母馬 時間: 2025-3-26 07:20
As Close to Perfection As Humanly Possiblehow our own work touches on the intersection between ontologies and similarity. While this cannot be a comprehensive account of the interrelationship between ontologies and similarity, we aim it to be a stepping stone for inspiration and for indicating entry points for future investigations.作者: 單片眼鏡 時間: 2025-3-26 11:44
Mathematical Fundamentals of Optimal Controlo, since it would be unreasonable for the agents to know all the alternatives. Unknown alternatives, as well as a strategy to increase chances of reaching an agreement, are problems addressed using case-based methods.作者: Esalate 時間: 2025-3-26 13:06 作者: subacute 時間: 2025-3-26 18:59
Structure Mapping for Jeopardy! Cluesorithm originally developed for analogical reasoning) is applied to determine similarity between content in questions and passages. That algorithm is one of many used in the Watson question answering system [2]. It contributes a significant amount to Watson’s effectiveness.作者: 系列 時間: 2025-3-27 00:34 作者: 破布 時間: 2025-3-27 03:35 作者: 微生物 時間: 2025-3-27 06:07 作者: mechanical 時間: 2025-3-27 13:28
Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measuresarch are described. A new retrieval algorithm is introduced that goes beyond traditional sequential retrieval for graphs, interweaving similarity computation with case selection. Significant reductions on the overall retrieval time are demonstrated without sacrificing the correctness of the computed similarity.作者: NAUT 時間: 2025-3-27 14:59 作者: esoteric 時間: 2025-3-27 19:47
Conference proceedings 2011 retrieval, and adaptation; provenance and maintenance; recommender systems; multi-agent collaborative systems; data mining; time series analysis; Web applications; knowledge management; legal reasoning; healthcare systems and planning systems.作者: CARK 時間: 2025-3-28 02:00 作者: Obituary 時間: 2025-3-28 03:00 作者: SPER 時間: 2025-3-28 10:13 作者: Stable-Angina 時間: 2025-3-28 10:36
Xin Min Yang,Kok Lay Teo,Xiaoqi Yang each individual. The (in)satisfaction of users modifies the typical aggregation functions used to estimate the value of an item for the group. This paper proposes a memory of past recommendations to compute the satisfaction of users when similar items (movies, in this case) are recommended several times.作者: 貪心 時間: 2025-3-28 17:03
On Dataset Complexity for Case Base Maintenancese base to decrease, or stay the same, and the classification accuracy to increase, or stay the same, after maintenance, we find many counter-examples. In particular, we find that the RENN noise reduction algorithm may be over-simplifying class boundaries.作者: arousal 時間: 2025-3-28 19:53
Amalgam-Based Reuse for Multiagent Case-Based Reasoningges: ., where agents generate full solutions internally, and ., where agents engage in a deliberation process in order to reach an agreement on a final solution. Specifically, . is based on the idea of ., which is a way to generate solutions by combining multiple solutions into one. We illustrate . in the domain of interior room design.作者: 溫室 時間: 2025-3-29 01:43 作者: Bureaucracy 時間: 2025-3-29 03:09
https://doi.org/10.1007/978-1-4757-2733-3arch are described. A new retrieval algorithm is introduced that goes beyond traditional sequential retrieval for graphs, interweaving similarity computation with case selection. Significant reductions on the overall retrieval time are demonstrated without sacrificing the correctness of the computed similarity.作者: MEEK 時間: 2025-3-29 08:31 作者: 作繭自縛 時間: 2025-3-29 12:33 作者: PHAG 時間: 2025-3-29 19:12 作者: 細絲 時間: 2025-3-29 19:56 作者: DAUNT 時間: 2025-3-30 01:10
Ted H. Szymanski,S. Thomas Obenausplanning method for obtaining qualitative plan diversity through the use of distance metrics which incorporate domain-specific content, without requiring a domain metatheory. To our knowledge, this is the first time qualitative plan diversity is being explored in a case-based planning context.作者: 控制 時間: 2025-3-30 04:26
W. H. J. Feijen,A. J. M. van Gasterenamework for medical research as well as for artificial intelligence (AI) research. This new work has the potential to positively impact the health and wellbeing of patients with diabetes. This paper shares the 4DSS project experience.作者: 沒有希望 時間: 2025-3-30 10:03
Nonconvex Optimization and Its Applicationsadaptation methods, we demonstrate the effectiveness of a “l(fā)azier” approach to learning/problem solving in CBR that avoids commitment to previous adaptation paths and hence the need for feedback propagation.作者: ECG769 時間: 2025-3-30 14:05 作者: BIPED 時間: 2025-3-30 18:09 作者: 虛構(gòu)的東西 時間: 2025-3-30 22:00
Qualitative vs. Quantitative Plan Diversity in Case-Based Planningplanning method for obtaining qualitative plan diversity through the use of distance metrics which incorporate domain-specific content, without requiring a domain metatheory. To our knowledge, this is the first time qualitative plan diversity is being explored in a case-based planning context.作者: 陳列 時間: 2025-3-31 04:25
The 4 Diabetes Support System: A Case Study in CBR Research and Developmentamework for medical research as well as for artificial intelligence (AI) research. This new work has the potential to positively impact the health and wellbeing of patients with diabetes. This paper shares the 4DSS project experience.作者: 輕而薄 時間: 2025-3-31 07:08
Learning More from Experience in Case-Based Reasoningadaptation methods, we demonstrate the effectiveness of a “l(fā)azier” approach to learning/problem solving in CBR that avoids commitment to previous adaptation paths and hence the need for feedback propagation.作者: endure 時間: 2025-3-31 10:37 作者: ACTIN 時間: 2025-3-31 15:02
Mathematical Fundamentals of Optimal Control out within T., a CBR system that searches cooking recipes satisfying constraints given by a user, or adapts recipes by substituting certain ingredients for others. The ingredient ontology of T. has been enriched thanks to ingredient properties extracted from recipe texts.作者: 網(wǎng)絡添麻煩 時間: 2025-3-31 18:12 作者: 顧客 時間: 2025-3-31 22:54
Mathematical Fundamentals of Optimal Controlsing case-base coverage, including a new Monte-Carlo method for prediction early in case-base growth. It evaluates the performance of these approaches for three tasks: estimating competence, predicting the incremental benefit of acquiring new cases, and predicting the total number of cases required 作者: Clumsy 時間: 2025-4-1 02:15
https://doi.org/10.1007/978-1-4757-3341-9ogical proportion. An extension to multiple-valued features has also been defined, reinforcing their scope of applications. It is then possible to complete, in a deterministic manner, some incomplete proportions where the last item . is missing. In this paper, we show how this can be the basis of a