research
∙
07/22/2023
Spectral Normalized-Cut Graph Partitioning with Fairness Constraints
Normalized-cut graph partitioning aims to divide the set of nodes in a g...
share
research
∙
01/05/2023
Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms
Diversity maximization aims to select a diverse and representative subse...
research
∙
11/23/2022
SAH: Shifting-aware Asymmetric Hashing for Reverse k-Maximum Inner Product Search
This paper investigates a new yet challenging problem called Reverse k-M...
research
∙
11/22/2022
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
A great variety of complex systems, from user interactions in communicat...
research
∙
11/08/2022
Graph Summarization via Node Grouping: A Spectral Algorithm
Graph summarization via node grouping is a popular method to build conci...
research
∙
11/02/2022
Balancing Utility and Fairness in Submodular Maximization (Technical Report)
Submodular function maximization is central in numerous data science app...
research
∙
08/13/2022
Happiness Maximizing Sets under Group Fairness Constraints (Technical Report)
Finding a happiness maximizing set (HMS) from a database, i.e., selectin...
research
∙
07/30/2022
Streaming Algorithms for Diversity Maximization with Fairness Constraints
Diversity maximization is a fundamental problem with wide applications i...
research
∙
02/13/2022
StoryBuddy: A Human-AI Collaborative Chatbot for Parent-Child Interactive Storytelling with Flexible Parental Involvement
Despite its benefits for children's skill development and parent-child b...
research
∙
02/01/2022
Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways
Recommender systems typically suggest to users content similar to what t...
research
∙
12/12/2020
Query-free Black-box Adversarial Attacks on Graphs
Many graph-based machine learning models are known to be vulnerable to a...
research
∙
10/09/2020
Streaming Submodular Maximization with Fairness Constraints
We study the problem of extracting a small subset of representative item...
research
∙
07/28/2020
Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)
A great variety of complex systems ranging from user interactions in com...
research
∙
07/19/2020
GRMR: Generalized Regret-Minimizing Representatives
Extracting a small subset of representative tuples from a large database...
research
∙
05/29/2020
A Fully Dynamic Algorithm for k-Regret Minimizing Sets
Selecting a small set of representatives from a large database is import...
research
∙
05/09/2019
Coresets for Minimum Enclosing Balls over Sliding Windows
Coresets are important tools to generate concise summaries of massive da...
research
∙
01/29/2019