找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Intelligent Information Processing VII; 8th IFIP TC 12 Inter Zhongzhi Shi,Zhaohui Wu,Uli Sattler Conference proceedings 2014 IFIP Internati

[复制链接]
发表于 2025-3-23 14:57:00 | 显示全部楼层
Conference proceedings 2014 Hangzhou, China, in October 2014. The 32 revised papers presented were carefully reviewed and selected from more than 70 submissions. They are organized in topical sections on machine learning, data mining, web mining, multi-agent systems, automatic reasoning, decision algorithms, multimedia, patte
发表于 2025-3-23 21:54:39 | 显示全部楼层
发表于 2025-3-23 23:09:29 | 显示全部楼层
Improved Hierarchical K-means Clustering Algorithm without Iteration Based on Distance Measurementithm iHK. Its basic idea is that the each layer of the . data objects constructs . clusters by running K-means algorithm, and the mean vector of each cluster is used as the input of the next layer. iHK algorithm is tested on many different types of dataset and excellent experimental results are got.
发表于 2025-3-24 05:44:55 | 显示全部楼层
An Optimized Tag Recommender Algorithm in Folksonomyr retrieval motivation with k-means++ algorithm and recommend the most relevant resources to users. The experimental results show that our proposed algorithm with user retrieval motivation can have higher accuracy and stability than traditional retrieval algorithms in folksonomy system.
发表于 2025-3-24 06:38:02 | 显示全部楼层
发表于 2025-3-24 13:47:36 | 显示全部楼层
发表于 2025-3-24 18:23:44 | 显示全部楼层
发表于 2025-3-24 22:22:35 | 显示全部楼层
Using Bat Algorithm with Levy Walk to Solve Directing Orbits of Chaotic Systemsussian sample. In this paper, we want to further investigate the performance with Levy sampling manner. To test its performance, three other variants of bat algorithms are employed to compare, simulation results show our modification is superior to other algorithms.
发表于 2025-3-25 01:33:37 | 显示全部楼层
发表于 2025-3-25 06:30:06 | 显示全部楼层
Collecting Valuable Information from Fast Text Streamsraditional search engine principle, we consider the documents as a query by building the indexes for the whole query base. The experimental results show that it has the strong adaption ability, low latency and high quality support for the complex query combination compared with the conventional methods.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-4 15:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表