Titlebook: Computational Data and Social Networks; 8th International Co Andrea Tagarelli,Hanghang Tong Conference proceedings 2019 Springer Nature Swi

详细目录

overweight

Conference proceedings 2019 Chi Minh City, Vietnam, in November 2019...The 22 full and 8 short papers presented in this book were carefully reviewed and selected from 120 submissions. The papers appear under the following topical headings: Combinatorial Optimization and Learning; Influence Modeling, Propagation, and Maximizati

Pudendal-Nerve

Agnosia

Herd-Immunity

VOK

A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problemabilistic divide and conquer algorithm with a provable upper bound of . on the expected runtime for finding an optimal solution. Here, . is the number of edges of the network, and . the number of tolled roads in an optimal solution. Initial experiments indicate that in practice significantly less time is necessary.

发源

Outlier Detection Forest for Large-Scale Categorical Data Setse-scale data sets. In this paper, we propose a tree-based outlier detection algorithm for large-scale categorical data sets, Outlier Detection Forest (ODF). Our experimental results indicate that, compared with the state-of-the-art outlier detection schemes, ODF can achieve the same level of outlier detection precision and much better scalability.

dragon

consent

https://doi.org/10.1007/978-3-642-99700-6(ILS). The proposed algorithm is tested on the DMPTW benchmark instances from the literature. The results indicate that the developed algorithm has improved the best solutions for 34 instances in a reasonable computation time.

焦虑