找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪(fǎng)問(wèn)微社區(qū)

123456
返回列表
打印 上一主題 下一主題

Titlebook: Classification, Clustering, and Data Mining Applications; Proceedings of the M David Banks,Frederick R. McMorris,Wolfgang Gaul Conference p

[復(fù)制鏈接]
樓主: burgeon
51#
發(fā)表于 2025-3-30 11:28:08 | 只看該作者
https://doi.org/10.1057/9781137346667se objects that belong to the same class. We present some preliminary results, compared to results of other techniques, such as simulated annealing, genetic algorithms, tabu search, and k-means. Our results are as good as the best of the above methods.
52#
發(fā)表于 2025-3-30 13:18:54 | 只看該作者
53#
發(fā)表于 2025-3-30 20:34:22 | 只看該作者
Computer-Mediated Peer Response, show that spatial pyramids can converge towards geometrical pyramids. We indicate finally that spatial pyramids can give better results than Kohonen mappings and can produce a geometrical representation of conceptual lattices.
54#
發(fā)表于 2025-3-30 22:31:08 | 只看該作者
Clustering by Ant Colony Optimizationse objects that belong to the same class. We present some preliminary results, compared to results of other techniques, such as simulated annealing, genetic algorithms, tabu search, and k-means. Our results are as good as the best of the above methods.
55#
發(fā)表于 2025-3-31 03:39:16 | 只看該作者
56#
發(fā)表于 2025-3-31 06:06:55 | 只看該作者
Spatial Pyramidal Clustering Based on a Tessellation show that spatial pyramids can converge towards geometrical pyramids. We indicate finally that spatial pyramids can give better results than Kohonen mappings and can produce a geometrical representation of conceptual lattices.
57#
發(fā)表于 2025-3-31 12:04:10 | 只看該作者
Thinking Ultrametrically space. Ultrametric distance is defined from p-adic valuation. It is known that ultrametricity is a natural property of spaces that are sparse. Here we look at the quantification of ultrametricity. We also look at data compression based on a new ultrametric wavelet transform. We conclude with comput
58#
發(fā)表于 2025-3-31 13:37:14 | 只看該作者
59#
發(fā)表于 2025-3-31 21:09:16 | 只看該作者
60#
發(fā)表于 2025-4-1 01:31:11 | 只看該作者
A Dynamic Cluster Algorithm Based on , , Distances for Quantitative Datae representation of each cluster simultaneously. In its adaptive version, at each iteration of these algorithms there is a different distance for the comparison of each cluster with its representation. In this paper, we present a dynamic cluster method based on .. distances for quantitative data.
123456
返回列表
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-20 22:57
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
邮箱| 屏山县| 女性| 赤峰市| 临澧县| 苏州市| 汝南县| 漠河县| 方正县| 北票市| 沙田区| 宝鸡市| 招远市| 维西| 正宁县| 黄冈市| 武乡县| 麻阳| 志丹县| 香港| 磐石市| 南华县| 盖州市| 内乡县| 申扎县| 安远县| 瑞安市| 祥云县| 怀柔区| 平度市| 万盛区| 喀什市| 盱眙县| 汕头市| 当雄县| 边坝县| 宝鸡市| 个旧市| 宁城县| 玉田县| 辽源市|