Results 111 to 120 of about 1,352 (208)

RAG construction method for heterogeneous graph-hierarchical text corpus analysis

open access: yesНаучно-технический вестник информационных технологий, механики и оптики
Analysis of document corpora with complex internal and inter-document links requires not only retrieval of relevant texts but also construction of a compact, verifiable and traceable set of fragments sufficient for downstream reasoning and citation.
M. V. Ulizko   +4 more
doaj   +1 more source

On the Reducibility of Submodular Functions

open access: yesCoRR, 2016
The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that enables us to reduce the solution space of submodular optimization problems without performance loss. We introduce the concept of reducibility using marginal gains.
Jincheng Mei, Hao Zhang, Bao-Liang Lu
openaire   +4 more sources

Stochastic Relaxation as a Unifying Approach in 0/1 Programming

open access: yes, 2009
Poster. NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity &
PISTONE, Giovanni   +5 more
core  

Revisiting Matching Pursuit: Beyond Approximate Submodularity [PDF]

open access: yes, 2023
We study the problem of selecting a subset of vectors from a large set, to obtain the best signal representation over a family of functions. Although greedy methods have been widely used for tackling this problem and many of those have been analyzed ...
Gesbert, David   +2 more
core  

Is submodularity testable?

open access: yes, 2011
We initiate the study of property testing of submodularity on the boolean hypercube. Sub-modular functions come up in a variety of applications in combinatorial optimization.
C. Seshadhri, Jan Vondrák
core  

A Mutual Independent Cascade Model for Customer Behavior Propagation

open access: yesInternational Journal of Information and Communication Technology Research, 2013
Model of spreading behaviors, influences, new trends and innovations through social networks has been studied in a number of domains. These may include the diffusion of medical and technological innovations, the sudden and widespread adoption of ...
Ali Nazemian, Fattaneh Taghiyareh
doaj  

Submodularity of some classes of the combinatorial optimization games [PDF]

open access: yes, 2018
.: Submodularity (or concavity) is considered as an important property in the field of cooperative game theory. In this article, we characterize submodular minimum coloring games and submodular minimum vertex cover games.
Okamoto, Yoshio
core  

Consistent Submodular Maximization

open access: yesCoRR
Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper we study this problem in a dynamic environment with consistency constraints: elements arrive in a streaming fashion and the goal is maintaining a constant approximation to the
Dutting P.   +4 more
openaire   +4 more sources

Minimization on submodular flows

open access: yesDiscrete Applied Mathematics, 1982
AbstractEdmonds and Giles [1] discuss functions on the arcs of a digraph satisfying submodular set constraints. We call such functions submodular flows, show that the difference of group-valued submodular flows is a network circulation in a certain auxiliary digraph, and derive a criterion for the existence of group-valued submodular flows.
openaire   +2 more sources

Temporal multi-path marginal coverage for finite-horizon influence maximization

open access: yesJournal of King Saud University: Computer and Information Sciences
Influence maximization seeks a limited seed set that maximizes diffusion spread. Topology-based rankings are efficient but often ignore finite-horizon dynamics and seed-set redundancy, whereas simulation-assisted greedy methods can be computationally ...
Tianfu Zhang, Baojun Fu
doaj   +1 more source

Home - About - Disclaimer - Privacy