Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Submodularity in machine learning and artificial intelligence
J Bilmes - ar** (SLAM) algorithms, with …
Classification under human assistance
Most supervised learning models are trained for full automation. However, their predictions
are sometimes worse than those by human experts on some specific instances. Motivated by …
are sometimes worse than those by human experts on some specific instances. Motivated by …
Fast adaptive non-monotone submodular maximization subject to a knapsack constraint
Constrained submodular maximization problems encompass a wide variety of applications,
including personalized recommendation, team formation, and revenue maximization via …
including personalized recommendation, team formation, and revenue maximization via …
Robust Gaussian Processes via Relevance Pursuit
Gaussian processes (GPs) are non-parametric probabilistic regression models that are
popular due to their flexibility, data efficiency, and well-calibrated uncertainty estimates …
popular due to their flexibility, data efficiency, and well-calibrated uncertainty estimates …
Submodularity in action: From machine learning to signal processing applications
Submodularity is a discrete domain functional property that can be interpreted as mimicking
the role of well-known convexity/concavity properties in the continuous domain. Submodular …
the role of well-known convexity/concavity properties in the continuous domain. Submodular …
Influence maximization problem with echo chamber effect in social network
An echo chamber effect describes the situation in which opinions are amplified by
communication and repetition inside a relatively closed social system. In this article, we will …
communication and repetition inside a relatively closed social system. In this article, we will …
Distributed Pareto optimization for large-scale noisy subset selection
C Qian - IEEE Transactions on Evolutionary Computation, 2019 - ieeexplore.ieee.org
Subset selection, aiming to select the best subset from a ground set with respect to some
objective function, is a fundamental problem with applications in many areas, such as …
objective function, is a fundamental problem with applications in many areas, such as …
Randomized greedy methods for weak submodular sensor selection with robustness considerations
EC Kaya, M Hibbard, T Tanaka, U Topcu, A Hashemi - Automatica, 2025 - Elsevier
We study a pair of budget-and performance-constrained weak submodular maximization
problems. For computational efficiency, we explore the use of stochastic greedy algorithms …
problems. For computational efficiency, we explore the use of stochastic greedy algorithms …