找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Research and Development in Intelligent Systems XVII; Proceedings of ES200 Max Bramer,Alun Preece,Frans Coenen Conference proceedings 2001

[復(fù)制鏈接]
31#
發(fā)表于 2025-3-26 23:43:38 | 只看該作者
Formal Concept Analysis as a Support Technique for CBRowledge embedded in the cases. FCA applied on a case library provides an internal sight of the conceptual structure and allows finding patterns, regularities and exceptions among the cases. Moreover, it extracts certain dependence rules between the attributes describing the cases, that will be used
32#
發(fā)表于 2025-3-27 03:10:57 | 只看該作者
33#
發(fā)表于 2025-3-27 07:26:25 | 只看該作者
An Instance-Based Approach to Pattern Association Learning with Application to the English Past Tensieve exemplars, we introduce a distance metric for pattern association, PAMELA, which extends that used in PEBLS for classification. The associated pattern is then built by adapting that of the retrieved exemplar(s). We show that our algorithm IBPA-3, which uses exemplar distance weighting and attri
34#
發(fā)表于 2025-3-27 09:30:21 | 只看該作者
35#
發(fā)表于 2025-3-27 15:23:32 | 只看該作者
Grouping Multivariate Time Series Variables: Applications to Chemical Process and Visual Field Datas possible. Within this paper, we present a method for decomposing high dimensional MTS into mutually exclusive subsets of variables where within-group dependencies are high and between-group dependencies are low. The method involves the use of two evolutionary computation techniques, which find an
36#
發(fā)表于 2025-3-27 20:42:58 | 只看該作者
Genetic Algorithm Behaviour in the Task of Finding the Multi — Maximum Domain global optimum point but also to determine a whole parameter region. Parametric optimisation task is solved and the behaviour of several different real-number genetic algorithms is compared during the solution process. Real number genetic algorithm steps are described and their meaning is explained
37#
發(fā)表于 2025-3-28 01:37:14 | 只看該作者
38#
發(fā)表于 2025-3-28 03:36:40 | 只看該作者
Intelligible AI Planning — Generating Plans Represented as a Set of Constraintstraint reasoners can also be of great help in parts of the planning process. A new more intelligible approach to using AI planning is needed which can use the best “open” styles of planning based on shared plan representations and hierarchical task networks (HTN) and which still allow the use of powerful constraint representations and solvers.
39#
發(fā)表于 2025-3-28 06:38:15 | 只看該作者
Incremental Footprint-Based Retrieval and achieves near-optimal competence and quality characteristics. In this paper we describe a simple but important extension to footprint-based retrieval. Empirically we show that this new algorithm can deliver optimal retrieval performance while at the same time retaining the efficiency benefits of the original footprint-based retrieval method.
40#
發(fā)表于 2025-3-28 14:15:42 | 只看該作者
Macro and Micro Applications of Case-Based Reasoning to Feature-Based Product Selectionearches, while the macro approach is based on the traditional CBR-cycle but substitutes crisp constraint relaxation for similarity based retrieval. While the discussion is set against the background of a specific case study, the results have a wider applicability across a number of problem domains.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 11:25
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
农安县| 桦南县| 乌鲁木齐市| 彩票| 德州市| 福安市| 蒙山县| 石河子市| 义乌市| 阳谷县| 韶山市| 天长市| 涿鹿县| 桐梓县| 三穗县| 德安县| 高清| 应城市| 桦川县| 栾城县| 三穗县| 静宁县| 永新县| 大田县| 肥东县| 南江县| 禄劝| 宁化县| 攀枝花市| 张家川| 新密市| 日土县| 巍山| 新泰市| 从江县| 禄丰县| 永仁县| 田阳县| 扬中市| 广东省| 凌云县|