no code implementations • 21 Feb 2024 • Qiang Huang, Yanhao Wang, Yiqun Sun, Anthony K. H. Tung
To bridge this gap, we revisit and refine the diversity-aware $k$MIPS (D$k$MIPS) problem by incorporating two well-known diversity objectives -- minimizing the average and maximum pairwise item similarities within the results -- into the original relevance objective.
no code implementations • 6 Oct 2023 • Sachith Pai, Michael Mathioudakis, Yanhao Wang
Specifically, we first formulate a cost function to measure the performance of a Z-index on a dataset for a range-query workload.
1 code implementation • 22 Jul 2023 • Jia Li, Yanhao Wang, Arpit Merchant
Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters.
no code implementations • 5 Jan 2023 • Yanhao Wang, Michael Mathioudakis, Jia Li, Francesco Fabbri
Diversity maximization aims to select a diverse and representative subset of items from a large dataset.
1 code implementation • 23 Nov 2022 • Qiang Huang, Yanhao Wang, Anthony K. H. Tung
To speed up the Maximum Inner Product Search (MIPS) on item vectors, we design a shifting-invariant asymmetric transformation and develop a novel sublinear-time Shifting-Aware Asymmetric Locality Sensitive Hashing (SA-ALSH) scheme.
1 code implementation • 8 Nov 2022 • Arpit Merchant, Michael Mathioudakis, Yanhao Wang
By initially allowing relaxed (fractional) solutions for integer maximization, we analytically expose the underlying connections to the spectral properties of the adjacency matrix.
1 code implementation • 2 Nov 2022 • Yanhao Wang, Yuchen Li, Francesco Bonchi, Ying Wang
Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation.
1 code implementation • 30 Jul 2022 • Yanhao Wang, Francesco Fabbri, Michael Mathioudakis
Given a set $X$ of $n$ elements, it asks to select a subset $S$ of $k \ll n$ elements with maximum \emph{diversity}, as quantified by the dissimilarities among the elements in $S$.
1 code implementation • 13 Feb 2022 • Zheng Zhang, Ying Xu, Yanhao Wang, Bingsheng Yao, Daniel Ritchie, Tongshuang Wu, Mo Yu, Dakuo Wang, Toby Jia-Jun Li
Despite its benefits for children's skill development and parent-child bonding, many parents do not often engage in interactive storytelling by having story-related dialogues with their child due to limited availability or challenges in coming up with appropriate questions.
1 code implementation • 1 Feb 2022 • Francesco Fabbri, Yanhao Wang, Francesco Bonchi, Carlos Castillo, Michael Mathioudakis
Hence, we define the problem of reducing the prevalence of radicalization pathways by selecting a small number of edges to "rewire", so to minimize the maximum of segregation scores among all radicalized nodes, while maintaining the relevance of the recommendations.
no code implementations • 12 Dec 2020 • Jiarong Xu, Yizhou Sun, Xin Jiang, Yanhao Wang, Yang Yang, Chunping Wang, Jiangang Lu
To bridge the gap between theoretical graph attacks and real-world scenarios, in this work, we propose a novel and more realistic setting: strict black-box graph attack, in which the attacker has no knowledge about the victim model at all and is not allowed to send any queries.
1 code implementation • 9 Oct 2020 • Yanhao Wang, Francesco Fabbri, Michael Mathioudakis
We study the problem of extracting a small subset of representative items from a large data stream.
1 code implementation • 28 Jul 2020 • Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, Kian-Lee Tan
We first propose a generic edge sampling (ES) algorithm for estimating the number of instances of any temporal motif.
no code implementations • 19 Jul 2020 • Yanhao Wang, Michael Mathioudakis, Yuchen Li, Kian-Lee Tan
Extracting a small subset of representative tuples from a large database is an important task in multi-criteria decision making.
Data Structures and Algorithms Databases
1 code implementation • 29 May 2020 • Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan
Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation.
Databases Data Structures and Algorithms
1 code implementation • 9 May 2019 • Yanhao Wang, Yuchen Li, Kian-Lee Tan
This paper investigates the problem of maintaining a coreset to preserve the minimum enclosing ball (MEB) for a sliding window of points that are continuously updated in a data stream.
1 code implementation • 15 Jun 2017 • Yanhao Wang, Yuchen Li, Kian-Lee Tan
By keeping much fewer checkpoints, KW$^{+}$ achieves higher efficiency than KW while still guaranteeing a $\frac{1-\varepsilon'}{2+2d}$-approximate solution for SMDK.
no code implementations • 6 Feb 2017 • Yanhao Wang, Qi Fan, Yuchen Li, Kian-Lee Tan
Influence maximization (IM), which selects a set of $k$ users (called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications such as viral marketing and network monitoring.
Social and Information Networks Data Structures and Algorithms