Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Gan, Junhao"'
Question answering on free-form tables (a.k.a. TableQA) is a challenging task because of the flexible structure and the complex schema of tables. Recent studies use Large Language Models (LLMs) for this task, exploiting their capability in understand
Externí odkaz:
http://arxiv.org/abs/2410.12846
In this paper, we study the Dynamic Parameterized Subset Sampling (DPSS) problem in the Word RAM model. In DPSS, the input is a set,~$S$, of~$n$ items, where each item,~$x$, has a non-negative integer weight,~$w(x)$. Given a pair of query parameters,
Externí odkaz:
http://arxiv.org/abs/2409.18036
We consider the Max Unique Coverage problem, including applications to the data stream model. The input is a universe of $n$ elements, a collection of $m$ subsets of this universe, and a cardinality constraint, $k$. The goal is to select a subcollect
Externí odkaz:
http://arxiv.org/abs/2407.09368
Publikováno v:
Approximation and Online Algorithms, vol. 14297, p. 219. Springer Nature, 2023
Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence maximization. Though t
Externí odkaz:
http://arxiv.org/abs/2311.13123
Detecting beneficial feature interactions is essential in recommender systems, and existing approaches achieve this by examining all the possible feature interactions. However, the cost of examining all the possible higher-order feature interactions
Externí odkaz:
http://arxiv.org/abs/2206.13764
Personalized PageRank (PPR) is a popular node proximity metric in graph mining and network research. Given a graph G=(V,E) and a source node $s \in V$, a single-source PPR (SSPPR) query asks for the PPR value $\vpi(u)$ with respect to s, which repres
Externí odkaz:
http://arxiv.org/abs/2203.07937
Structural Clustering ($DynClu$) is one of the most popular graph clustering paradigms. In this paper, we consider $StrClu$ under two commonly adapted similarities, namely Jaccard similarity and cosine similarity on a dynamic graph, $G = \langle V, E
Externí odkaz:
http://arxiv.org/abs/2108.11549
User and item attributes are essential side-information; their interactions (i.e., their co-occurrence in the sample data) can significantly enhance prediction accuracy in various recommender systems. We identify two different types of attribute inte
Externí odkaz:
http://arxiv.org/abs/2105.04067
Personalized PageRank (PPR) is a critical measure of the importance of a node t to a source node s in a graph. The Single-Source PPR (SSPPR) query computes the PPR's of all the nodes with respect to s on a directed graph $G$ with $n$ nodes and $m$ ed
Externí odkaz:
http://arxiv.org/abs/2101.03652
Inspired by the great success of machine learning in the past decade, people have been thinking about the possibility of improving the theoretical results by exploring data distribution. In this paper, we revisit a fundamental problem called Distribu
Externí odkaz:
http://arxiv.org/abs/2006.12943