A central principle in the design of large-scale distributed systems is that components should be organized to place those that interact frequently close together. This is essentially a basic clustering problem, but the context creates new challenges. Traditional clustering algorithms are designed to work on relatively simple units of information stored in a centralized database. This work explores the consequences of clustering autonomous entities, each with individual, possibly different, criteria defining similarity and cluster composition requirements. In this setting clustering is transformed from being mainly a catagorization task, into a problem of discovering similarity criteria and classification categories. Original research results define a general model of decentralized clustering of autonomous entities, and present simulations investigating key process, from matchmaking, to catagorization, to learning behaviors needed for adaptive cluster discovery.
具体描述
读后感
评分
评分
评分
评分
用户评价
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有