找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms and Models for the Web Graph; 16th International W Konstantin Avrachenkov,Paweł Prałat,Nan Ye Conference proceedings 2019 Spring

[复制链接]
楼主: lutein
发表于 2025-3-26 22:24:23 | 显示全部楼层
发表于 2025-3-27 03:51:53 | 显示全部楼层
发表于 2025-3-27 05:34:57 | 显示全部楼层
发表于 2025-3-27 11:52:29 | 显示全部楼层
Using Synthetic Networks for Parameter Tuning in Community Detection,ructural properties and communities of various nature. As a result, it is hard (or even impossible) to develop one algorithm suitable for all datasets. A standard machine learning tool is to consider a parametric algorithm and choose its parameters based on the dataset at hand. However, this approac
发表于 2025-3-27 15:20:18 | 显示全部楼层
Efficiency of Transformations of Proximity Measures for Graph Clustering,formed with a number of functions including the logarithmic function, the power function, and a family of activation functions. Transformations are tested in experiments in which several classical datasets are clustered using the .-Means, Ward, and the spectral method. The analysis of experimental r
发表于 2025-3-27 18:34:22 | 显示全部楼层
Almost Exact Recovery in Label Spreading,ve high accuracy clustering using efficient computational procedures. Our main goal is to provide a theoretical justification why the graph-based semi-supervised learning works very well. Specifically, for the Stochastic Block Model in the moderately sparse regime, we prove that popular semi-supervi
发表于 2025-3-28 01:21:31 | 显示全部楼层
发表于 2025-3-28 03:34:40 | 显示全部楼层
发表于 2025-3-28 09:48:49 | 显示全部楼层
Estimating the Parameters of the Waxman Random Graph, thus less numerous. The model has been in continuous use for over three decades with many attempts to match parameters to real networks, but only a few cases where a formal estimator was used. Even then the performance of the estimator was not evaluated. This paper presents both the first evaluatio
发表于 2025-3-28 12:33:27 | 显示全部楼层
Understanding the Effectiveness of Data Reduction in Public Transportation Networks, a selected station. Although this problem is NP-hard in general, real-world instances are regularly solved almost completely by a set of simple reduction rules. To explain this behavior, we view transportation networks as hitting set instances and identify two characteristic properties, locality an
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 00:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表