標(biāo)題: Titlebook: Computational Data and Social Networks; 10th International C David Mohaisen,Ruoming Jin Conference proceedings 2021 Springer Nature Switzer [打印本頁(yè)] 作者: 離開(kāi)浮于空中 時(shí)間: 2025-3-21 17:29
書(shū)目名稱Computational Data and Social Networks影響因子(影響力)
書(shū)目名稱Computational Data and Social Networks影響因子(影響力)學(xué)科排名
書(shū)目名稱Computational Data and Social Networks網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Computational Data and Social Networks網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Computational Data and Social Networks被引頻次
書(shū)目名稱Computational Data and Social Networks被引頻次學(xué)科排名
書(shū)目名稱Computational Data and Social Networks年度引用
書(shū)目名稱Computational Data and Social Networks年度引用學(xué)科排名
書(shū)目名稱Computational Data and Social Networks讀者反饋
書(shū)目名稱Computational Data and Social Networks讀者反饋學(xué)科排名
作者: Adjourn 時(shí)間: 2025-3-21 20:33 作者: FLIC 時(shí)間: 2025-3-22 01:12
Die beobachteten Eigenschaften der Sterne,dentifiability or unidentifiability of parameters for several special structures including the Markovian IC model, semi-Markovian IC model, and IC model with a global unobserved variable. Parameter identifiability is important for other tasks such as influence maximization under the diffusion networks with unobserved confounding factors.作者: invert 時(shí)間: 2025-3-22 05:38 作者: RECUR 時(shí)間: 2025-3-22 09:05
Conference proceedings 2021easurements of insight from data; complex networks analytics; special track on fact-checking, fake news and malware detection in online social networks; and special track on information spread in social and data networks. ..?.作者: 掙扎 時(shí)間: 2025-3-22 14:11
0302-9743 systems; measurements of insight from data; complex networks analytics; special track on fact-checking, fake news and malware detection in online social networks; and special track on information spread in social and data networks. ..?.978-3-030-91433-2978-3-030-91434-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 掙扎 時(shí)間: 2025-3-22 17:34
Sterne G?tter, Mensch und Mythenhe edges with negative labels within clusters. In this paper, we propose the lower bounded correlation clustering problem and formulate the problem as an integer program. Furthermore, we provide two polynomial time algorithms with constant approximate ratios for the lower bounded correlation clustering problem on some special graphs.作者: 努力趕上 時(shí)間: 2025-3-22 22:51
https://doi.org/10.1007/978-3-7091-6773-1algorithm, which implements the . approximation of the maximizing unconstrained non-negative weakly-monotone function problem. When ., the algorithm achieves an approximate guarantee of 1/3, achieving the same ratio as the deterministic algorithm for the unconstrained submodular maximization problem.作者: 食料 時(shí)間: 2025-3-23 05:03 作者: Choreography 時(shí)間: 2025-3-23 05:47 作者: 包裹 時(shí)間: 2025-3-23 11:35 作者: arthroplasty 時(shí)間: 2025-3-23 15:45 作者: Multiple 時(shí)間: 2025-3-23 18:31 作者: Ejaculate 時(shí)間: 2025-3-23 22:54 作者: 衣服 時(shí)間: 2025-3-24 03:20 作者: 希望 時(shí)間: 2025-3-24 09:29 作者: 圣人 時(shí)間: 2025-3-24 12:14
Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Latticehing-return (DR) ratio ., we present a one pass streaming algorithm that gives a .-approximation, requires at most . space and . . update time per element. To the best of our knowledge, this is the first streaming algorithm on the integer lattice for this constrained maximization problem.作者: Itinerant 時(shí)間: 2025-3-24 15:38
Causal Inference for Influence Propagation—Identifiability of the Independent Cascade Modeldentifiability or unidentifiability of parameters for several special structures including the Markovian IC model, semi-Markovian IC model, and IC model with a global unobserved variable. Parameter identifiability is important for other tasks such as influence maximization under the diffusion networks with unobserved confounding factors.作者: insincerity 時(shí)間: 2025-3-24 20:11
Detecting Hate Speech Contents Using Embedding Modelsdictionary in a semi-supervised fashion. We conduct experiments on two popular datasets, which show that the combination of word embeddings and hate speech embeddings can produce promising results when compared with the methods that employ large-scale pre-trained language models.作者: Fillet,Filet 時(shí)間: 2025-3-24 23:31
Die beobachteten Eigenschaften der Sterne,terministic streaming algorithm which provides an approximation ratio of . when . is monotone and . when . is non-monotone. For the general case, we propose a random streaming algorithm that provides an approximation ratio of . when . is monotone and . when . is non-monotone in expectation, where . and . are fixed inputs.作者: Somber 時(shí)間: 2025-3-25 06:40 作者: 干旱 時(shí)間: 2025-3-25 09:10 作者: Abbreviate 時(shí)間: 2025-3-25 15:05
A. S. Eddington M. A., L.L.D., D.SC., F.R.S.s to mislead the target DNNs and deceive their combined interpretation models. We evaluate the proposed attacks against two DNN model architectures coupled with four representatives of different categories of interpretation models. The experimental results demonstrate our attacks’ effectiveness in deceiving the DNN models and their interpreters.作者: fibroblast 時(shí)間: 2025-3-25 19:48 作者: Antagonism 時(shí)間: 2025-3-25 21:11
Differentially Private Submodular Maximization over Integer Latticen problem over the integer lattice. Our main contributions are to present differentially private approximation algorithms for both DR-submodular and integer submodular function maximization problems under cardinality constraints and analyze the sensitivity of our algorithms.作者: 懸掛 時(shí)間: 2025-3-26 02:01
A Framework for Accelerating Graph Convolutional Networks on Massive Datasetss that we refer to as GraphSage++, ClusterGCN++, and GraphSaint++. Using graphs with order of 100 million edges, we demonstrate that we reduce the overall training time by up?to 30%, while not having a noticeable reduction in F1 scores in most cases.作者: famine 時(shí)間: 2025-3-26 05:54 作者: Confirm 時(shí)間: 2025-3-26 09:34
0302-9743 which was held online during November 15-17, 2021. The conference was initially planned to take place in Montreal, Quebec, Canada, but changed to an online event due to the COVID-19 pandemic.?.The 24 full and 8 short papers included in this book were carefully reviewed and selected from 57 submissio作者: EXCEL 時(shí)間: 2025-3-26 16:26 作者: CLAMP 時(shí)間: 2025-3-26 19:17 作者: CUB 時(shí)間: 2025-3-27 00:43 作者: 噱頭 時(shí)間: 2025-3-27 03:36
Die Elemente des Himmelsbildes,ounded identification of most vulnerable lines. The goals are achieved by first constructing a novel connection between cascading failures and natural languages, and then adapting the powerful transformer model in NLP to learn from cascading failure data. Our trained transformer models have good acc作者: Hypomania 時(shí)間: 2025-3-27 09:11 作者: GIST 時(shí)間: 2025-3-27 11:29 作者: overture 時(shí)間: 2025-3-27 14:13
Power Grid Cascading Failure Prediction Based on Transformerounded identification of most vulnerable lines. The goals are achieved by first constructing a novel connection between cascading failures and natural languages, and then adapting the powerful transformer model in NLP to learn from cascading failure data. Our trained transformer models have good acc作者: 小教堂 時(shí)間: 2025-3-27 21:46 作者: Mundane 時(shí)間: 2025-3-27 21:59
Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Latticeeger lattice has received a lot of recent attention. In this paper, we study streaming algorithms for the problem of maximizing a monotone non-submodular functions with cardinality constraint on the integer lattice. For a monotone non-submodular function . defined on the integer lattice with diminis作者: neoplasm 時(shí)間: 2025-3-28 05:42 作者: extemporaneous 時(shí)間: 2025-3-28 09:00 作者: ALIBI 時(shí)間: 2025-3-28 10:55 作者: LAVA 時(shí)間: 2025-3-28 15:02
Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functionsions in practice do not fully meet the characteristics of diminishing returns. In this paper, we consider the problem of maximizing unconstrained non-negative weakly-monotone non-submodular set function. The generic submodularity ratio . is a bridge connecting the non-negative monotone functions and作者: DAMN 時(shí)間: 2025-3-28 21:02 作者: 災(zāi)禍 時(shí)間: 2025-3-29 02:35
Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Kna of the sum of a supermodular function and a monotone DR-submodular function on the integer lattice. As our main contribution, we present a streaming algorithm under the assumption that the optimum is known, and a two-pass streaming algorithm in general case. The proposed algorithms are proved to ha作者: 象形文字 時(shí)間: 2025-3-29 04:56
A Framework for Accelerating Graph Convolutional Networks on Massive Datasetsicularly among them, because of massive scale of graphs, there is not only a large computation time, but also the need for partitioning and loading data multiple times. This paper presents a different framework in which existing GCN methods can be accelerated for execution on large graphs. Building 作者: 簡(jiǎn)潔 時(shí)間: 2025-3-29 07:51
AdvEdge: Optimizing Adversarial Perturbations Against Interpretable Deep Learningion for a given task is derived from the correct problem representation and not from the misuse of artifacts in the data. Hence, interpretation models have become a key ingredient in developing deep learning models. Utilizing interpretation models enables a better understanding of how DNN models wor作者: cochlea 時(shí)間: 2025-3-29 12:10 作者: 高度表 時(shí)間: 2025-3-29 18:18 作者: refine 時(shí)間: 2025-3-29 21:03 作者: BIDE 時(shí)間: 2025-3-30 02:54 作者: Spina-Bifida 時(shí)間: 2025-3-30 05:14
MIC Model for Cervical Cancer Risk Factors Deep Association Analysisrs for CC including the direct risk factors and indirect risk factors that may be caused by other diseases or reasons. In this paper, we proposed a MIC (Multiple Indicators Correlation) model to resolve the problem of analyzing risk factors by establishing the indicators structure. Based on the clos作者: 沙發(fā) 時(shí)間: 2025-3-30 09:18
Power Grid Cascading Failure Prediction Based on Transformerure. Because of the importance of smart grids in modern society, it is crucial to protect them against cascading failures. Simulation of cascading failures can help identify the most vulnerable transmission lines and guide prioritization in protection planning, hence, it is an effective approach to 作者: Locale 時(shí)間: 2025-3-30 13:44 作者: Assignment 時(shí)間: 2025-3-30 20:11
