找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ;

[复制链接]
查看: 42806|回复: 43
发表于 2025-3-21 17:37:33 | 显示全部楼层 |阅读模式
书目名称Grouping Multidimensional Data
编辑Jacob Kogan,Charles Nicholas,Marc Teboulle
视频video
图书封面Titlebook: ;
出版日期Book 2006
版次1
doihttps://doi.org/10.1007/3-540-28349-8
isbn_softcover978-3-642-06654-2
isbn_ebook978-3-540-28349-2
The information of publication is updating

书目名称Grouping Multidimensional Data影响因子(影响力)




书目名称Grouping Multidimensional Data影响因子(影响力)学科排名




书目名称Grouping Multidimensional Data网络公开度




书目名称Grouping Multidimensional Data网络公开度学科排名




书目名称Grouping Multidimensional Data被引频次




书目名称Grouping Multidimensional Data被引频次学科排名




书目名称Grouping Multidimensional Data年度引用




书目名称Grouping Multidimensional Data年度引用学科排名




书目名称Grouping Multidimensional Data读者反馈




书目名称Grouping Multidimensional Data读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:26:49 | 显示全部楼层
发表于 2025-3-22 04:14:41 | 显示全部楼层
https://doi.org/10.1007/978-1-4684-7009-3ghted graph partitioning), on a variety of high dimension sparse vector data sets representing text documents as bags of words. Performance is measured based on mutual information with a human-imposed classification. Our key findings are that in the quasiorthogonal space of word frequencies: (i) Cos
发表于 2025-3-22 06:24:07 | 显示全部楼层
A. K. Raychaudhuri,J. M. Peech,R. O. Pohled to the development of a number of new and novel algorithms with different complexity-quality trade-offs. Among them, a class of clustering algorithms that have relatively low computational requirements are those that treat the clustering problem as an optimization process, which seeks to maximize
发表于 2025-3-22 10:37:36 | 显示全部楼层
发表于 2025-3-22 15:44:44 | 显示全部楼层
发表于 2025-3-22 17:11:06 | 显示全部楼层
发表于 2025-3-22 23:54:35 | 显示全部楼层
Clustering Very Large Data Sets with Principal Direction Divisive Partitioning,ginal data in a factored form with much less memory, while preserving the individuality of each of the original samples. The scalable clustering algorithm Principal Direction Divisive Partitioning (PDDP) can use the factored form in a natural way to obtain a clustering of the original dataset..The r
发表于 2025-3-23 04:05:28 | 显示全部楼层
发表于 2025-3-23 06:09:48 | 显示全部楼层
Sampling Methods for Building Initial Partitions, two new approaches for building such initial partitions. The first approach applies a procedure for selecting appropriate samples in the spirit of the Cross-Entropy (CE) method, and the second is based on a sequential summarizing schema. In the first approach, we use a sequential sample clustering
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 14:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表