俗艳
发表于 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
http://reply.papertrans.cn/47/4698/469712/469712_13.png
QUAIL
发表于 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
http://reply.papertrans.cn/47/4698/469712/469712_16.png
染色体
发表于 2025-3-24 13:47:36
http://reply.papertrans.cn/47/4698/469712/469712_17.png
cardiovascular
发表于 2025-3-24 18:23:44
http://reply.papertrans.cn/47/4698/469712/469712_18.png
突变
发表于 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.
Essential
发表于 2025-3-25 01:33:37
http://reply.papertrans.cn/47/4698/469712/469712_20.png
放大
发表于 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.