找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Intelligent Systems Design and Applications; 16th International C Ana Maria Madureira,Ajith Abraham,Paulo Novais Conference proceedings 201

[复制链接]
楼主: FAULT
发表于 2025-3-25 04:22:11 | 显示全部楼层
发表于 2025-3-25 10:56:38 | 显示全部楼层
Conference proceedings 2017lligent systems, intelligent technologies, and applications. The papers included address a wide variety of themes ranging from theories to applications of intelligent systems and computational intelligence area and provide a valuable resource for students and researchers in academia and industry alike.. .
发表于 2025-3-25 15:25:33 | 显示全部楼层
Agglomerative and Divisive Approaches to Unsupervised Learning in , Clusters,omerative (and three of its variants) and the other divisive, focusing on their performance in unsupervised learning tasks related to . clusters. Taking into account that the point sets considered are representative of gestalt clusters, the experiments show that the best results have been obtained when the agglomerative approach was used.
发表于 2025-3-25 16:38:26 | 显示全部楼层
Radial Basis Function Neural Networks for Datasets with Missing Values,rk, the RBFNN is modified to deal with missing data. For that, the expected squared distance approach is used to compute the RBF Kernel. The proposed approach showed promising results when compared to standard missing data strategies.
发表于 2025-3-25 21:56:06 | 显示全部楼层
Evaluation Method for an Adaptive Web Interface: GOMS Model,adaptive Web interface using a Bayesian networks approach. Then, a formal GOMS model approach was applied to the evaluation of our user interface for a specialized web application. The evaluation shows that the adaptive user interface was more comfortable than the fixed user interface.
发表于 2025-3-26 00:55:10 | 显示全部楼层
发表于 2025-3-26 05:03:53 | 显示全部楼层
发表于 2025-3-26 10:21:05 | 显示全部楼层
发表于 2025-3-26 15:52:12 | 显示全部楼层
Agglomerative and Divisive Approaches to Unsupervised Learning in , Clusters,lated to the desired level of granularity the partition should have. The work described in this paper approaches two hierarchical algorithms, one agglomerative (and three of its variants) and the other divisive, focusing on their performance in unsupervised learning tasks related to . clusters. Taki
发表于 2025-3-26 18:14:18 | 显示全部楼层
Improving Imputation Accuracy in Ordinal Data Using Classification,ferences between instances with and without missing data. This is a particular problem with ordinal data, where for example a sample of a population may have all failed to answer a specific question in a questionnaire. The existing methods such as listwise deletion, mean attribute substitution, and
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 20:34
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表