Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Maniu, Silviu"'
Reinforcement learning algorithms are usually stated without theoretical guarantees regarding their performance. Recently, Jin, Yang, Wang, and Jordan (COLT 2020) showed a polynomial-time reinforcement learning algorithm (namely, LSVI-UCB) for the se
Externí odkaz:
http://arxiv.org/abs/2411.10906
Motivated by scenarios of information diffusion and advertising in social media, we study an influence maximization problem in which little is assumed to be known about the diffusion network or about the model that determines how information may prop
Externí odkaz:
http://arxiv.org/abs/2201.05231
We establish a translation between a formalism for dynamic programming over hypergraphs and the computation of semiring-based provenance for Datalog programs. The benefit of this translation is a new method for computing provenance for a specific cla
Externí odkaz:
http://arxiv.org/abs/2112.01132
Recommender systems should adapt to user interests as the latter evolve. A prevalent cause for the evolution of user interests is the influence of their social circle. In general, when the interests are not known, online algorithms that explore the r
Externí odkaz:
http://arxiv.org/abs/2009.10135
Treewidth is a parameter that measures how tree-like a relational instance is, and whether it can reasonably be decomposed into a tree. Many computation tasks are known to be tractable on databases of small treewidth, but computing the treewidth of a
Externí odkaz:
http://arxiv.org/abs/1901.06862
Influence maximization is the problem of finding influential users, or nodes, in a graph so as to maximize the spread of information. It has many applications in advertising and marketing on social networks. In this paper, we study a highly generic v
Externí odkaz:
http://arxiv.org/abs/1702.05354
Query answering over probabilistic data is an important task but is generally intractable. However, a new approach for this problem has recently been proposed, based on structural decompositions of input databases, following, e.g., tree decomposition
Externí odkaz:
http://arxiv.org/abs/1607.05538
Autor:
Maniu, Silviu
Nous abordons dans cette thèse quelques-unes des questions soulevées par I'émergence d'applications sociales sur le Web, en se concentrant sur deux axes importants: l'efficacité de recherche sociale dans les applications Web et l'inférence de li
Externí odkaz:
http://www.theses.fr/2012ENST0053/document
Social networks are commonly used for marketing purposes. For example, free samples of a product can be given to a few influential social network users (or "seed nodes"), with the hope that they will convince their friends to buy it. One way to forma
Externí odkaz:
http://arxiv.org/abs/1506.01188
Autor:
Maniu, Silviu, Cautis, Bogdan
We consider in this paper top-k query answering in social tagging systems, also known as folksonomies. This problem requires a significant departure from existing, socially agnostic techniques. In a network-aware context, one can (and should) exploit
Externí odkaz:
http://arxiv.org/abs/1104.1605