research-article

Public Access

Diversified Subgraph Query Generation with Group Fairness

Authors:

Christopher Toomey,

Yinghui WuAuthors Info & Claims

WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining

Pages 686 - 694

https://doi.org/10.1145/3488560.3498525

Published: 15 February 2022 Publication History

Abstract

This paper investigates the problem of subgraph query generation with output that satisfies both diversity and fairness constraints. Given a set of groups with associated cardinality requirements, it is to compute subgraph queries with diversified output that meanwhile covers the groups with the desired cardinality. Such need is evident in web and social search with fairness constraints. We formalize subgraph query generation as a bi-criteria optimization problem on the diversity and fairness properties of queries, and verify its hardness and approximability. We show that the problem is in Σp2, and remains NP-complete even for single-node queries. Despite the hardness, (1) we show that approximations exist whenever a corresponding subset selection process provides good solutions, and provide feasible algorithms with performance guarantees for two practical query generation scenarios. We also present a fast heuristic algorithm for the general problem, which early terminates without enumerating queries. We experimentally verify that our algorithms can efficiently generate queries with desired diversity and coverage properties for targeted groups.

Supplementary Material

MP4 File (WSDM-QGenP-Video.mp4)

Presentation video - short version

Download
39.41 MB

References

[1]

Z. Abbassi, V. Mirrokni, and M. Thakur. Diversity maximization under matroid constraints. In KDD, 2013.

Digital Library

[2]

A. Asudeh and H. Jagadish. Fairly evaluating and scoring items in a data set. Proceedings of the VLDB Endowment, 13(12):3445--3448, 2020.

Digital Library

[3]

G. Bagan, A. Bonifati, R. Ciucanu, G. H. Fletcher, A. Lemay, and N. Advokaat. Controlling diversity in benchmarking graph databases. arXiv preprint arXiv:1511.08386, 11, 2015.

[4]

G. Bagan, A. Bonifati, R. Ciucanu, G. H. Fletcher, A. Lemay, and N. Advokaat. gmark: Schema-driven generation of graphs and queries. IEEE Transactions on Knowledge and Data Engineering, 29(4):856--869, 2016.

Digital Library

[5]

A. Bonifati, I. Holubová, A. Prat-Pérez, and S. Sakr. Graph generators: State of the art and open challenges. ACM Computing Surveys (CSUR), 53(2):1--30, 2020.

[6]

A. Borodin, H. C. Lee, and Y. Ye. Max-sum diversification, monotone submodular functions and dynamic updates. PODS, 2012.

Digital Library

[7]

S. Bouhenni, S. Yahiaoui, N. Nouali-Taboudjemat, and H. Kheddouci. A survey on distributed graph pattern matching in massive graphs. CSUR, 54(2):1--35, 2021.

Digital Library

[8]

R. D. Carr, S. Doddi, G. Konjevod, and M. Marathe. On the red-blue set cover problem. In SODA, 2000.

[9]

S. Chaudhuri, H. Lee, and V. R. Narasayya. Variance aware optimization of parameterized queries. In SIGMOD, 2010.

Digital Library

[10]

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence, 26(10):1367--1372, 2004.

Digital Library

[11]

Y. Dong, Y. Yang, J. Tang, Y. Yang, and N. V. Chawla. Inferring user demographics and social strategies in mobile social networks. In KDD, 2014.

Digital Library

[12]

T. Draws, N. Tintarev, and U. Gadiraju. Assessing viewpoint diversity in search results using ranking fairness metrics. ACM SIGKDD Explorations Newsletter, 23(1):50--58, 2021.

Digital Library

[13]

M. Ehrgott. Multicriteria optimization, volume 491. Springer Science & Business Media, 2005.

[14]

W. Fan, X. Wang, and Y. Wu. Diversified top-k graph pattern matching. VLDB, 2013.

Digital Library

[15]

Y. Ge, S. Zhao, H. Zhou, C. Pei, F. Sun, W. Ou, and Y. Zhang. Understanding echo chambers in e-commerce recommender systems. In SIGIR, pages 2261--2270, 2020.

Digital Library

[16]

S. C. Geyik, S. Ambler, and K. Kenthapadi. Fairness-aware ranking in search & recommendation systems with application to linkedin talent search. In KDD, 2019.

Digital Library

[17]

S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In WWW, 2009.

Digital Library

[18]

T. F. Gonzalez. Handbook of approximation algorithms and metaheuristics. CRC Press, 2007.

[19]

N. Jayaram, A. Khan, C. Li, X. Yan, and R. Elmasri. Querying knowledge graphs by example entity tuples. IEEE Transactions on Knowledge and Data Engineering, 27(10):2797--2811, 2015.

Digital Library

[20]

N. Koudas, S. Sarawagi, and D. Srivastava. Record linkage: similarity measures and algorithms. In SIGMOD, 2006.

Digital Library

[21]

W. Le, A. Kementsietsidis, S. Duan, and F. Li. Scalable multi-query optimization for sparql. In ICDE, pages 666--677, 2012.

Digital Library

[22]

M. Lissandrini, D. Mottin, T. Palpanas, and Y. Velegrakis. Graph-query suggestions for knowledge graph exploration. In The Web Conference, 2020.

Digital Library

[23]

J. Lu, J. Chen, and C. Zhang. Helsinki Multi-Model Data Repository. https://www2.helsinki.fi/en/researchgroups/unified-database-management-systems-udbms/, 2018.

[24]

T. Ma, S. Yu, J. Cao, Y. Tian, A. Al-Dhelaan, and M. Al-Rodhaan. A comparative study of subgraph matching isomorphic methods in social networks. IEEE Access, 6:66621--66631, 2018.

[25]

D. Mottin, F. Bonchi, and F. Gullo. Graph query reformulation with diversity. In KDD, 2015.

Digital Library

[26]

Z. Moumoulidou, A. McGregor, and A. Meliou. Diverse data selection under fairness constraints. In ICDT, 2021.

[27]

M. H. Namaki, Q. Song, Y. Wu, and S. Yang. Answering why-questions by exemplars in attributed graphs. In SIGMOD, 2019.

Digital Library

[28]

D. Peleg. Approximation algorithms for the label-covermax and red-blue set cover problems. Journal of Discrete Algorithms, 5(1):55--64, 2007.

Digital Library

[29]

A. Sinha, Z. Shen, Y. Song, H. Ma, D. Eide, B.-J. P. Hsu, and K. Wang. An overview of microsoft academic service (mas) and applications. WWW, 2015.

Digital Library

[30]

Q. Song, M. H. Namaki, and Y. Wu. Answering why-questions for subgraph queries in multi-attributed graphs. In ICDE, 2019.

[31]

J. Stoyanovich, K. Yang, and H. Jagadish. Online set selection with fairness and diversity constraints. In Proceedings of the EDBT Conference, 2018.

[32]

V. V. Vazirani. Approximation algorithms. Springer, 2013.

[33]

Y. Wang, Y. Li, J. Fan, C. Ye, and M. Chai. A survey of typical attributed graph queries. World Wide Web, 24(1):297--346, 2021.

[34]

Y. Zhang, J. Tang, Z. Yang, J. Pei, and P. S. Yu. Cosnet: Connecting heterogeneous social networks with local and global consistency. In KDD, 2015.

Digital Library

[35]

E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary computation, 8(2):173--195, 2000.

Digital Library

Cited By

Wang YTao ZFang Y(2024)A Unified Meta-Learning Framework for Fair Ranking With Curriculum LearningIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.337764436:9(4386-4397)Online publication date: Sep-2024
https://doi.org/10.1109/TKDE.2024.3377644
Ma HGuan SWang MSong QWu Y(2023)Fair Group Summarization with Graph Patterns2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00154(1982-1994)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00154
Yin ZZhang QZhang WLi RWang G(2023)Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00131(1665-1677)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00131
Show More Cited By

Index Terms

Diversified Subgraph Query Generation with Group Fairness
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing
      1. Query reformulation
      2. Query suggestion
    2. Retrieval models and ranking
      1. Information retrieval diversity

Recommendations

Time-Aware Diversified Query Suggestion
JCDL '18: Proceedings of the 18th ACM/IEEE on Joint Conference on Digital Libraries

In this paper, we study query suggestion diversi cation for time- aware queries, where query suggestions are diversified from multiple dimensions (e.g., topic and time). More precisely, we introduce the method of Time-aware Diversified Query Suggestion (...
Visual query suggestion: Towards capturing user intent in internet image search

Query suggestion is an effective approach to bridge the Intention Gap between the users' search intents and queries. Most existing search engines are able to automatically suggest a list of textual query terms based on users' current query input, which ...
Visual query suggestion
MM '09: Proceedings of the 17th ACM international conference on Multimedia

Query suggestion is an effective approach to improve the usability of image search. Most existing search engines are able to automatically suggest a list of textual query terms based on users' current query input, which can be called Textual Query ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining

February 2022

1690 pages

ISBN:9781450391320

DOI:10.1145/3488560

General Chairs:
K. Selcuk Candan
Arizona State University, USA
,
Huan Liu
Arizona State University, USA
,
Program Chairs:
Leman Akoglu
Carnegie Mellon University, USA
,
Xin Luna Dong
Meta Platforms, Inc. (former Facebook), USA
,
Jiliang Tang
Michigan State University, USA

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 February 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

WSDM '22

Sponsor:

WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining

February 21 - 25, 2022

AZ, Virtual Event, USA

Acceptance Rates

Overall Acceptance Rate 498 of 2,863 submissions, 17%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
384
Total Downloads

Downloads (Last 12 months)118
Downloads (Last 6 weeks)21

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang YTao ZFang Y(2024)A Unified Meta-Learning Framework for Fair Ranking With Curriculum LearningIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.337764436:9(4386-4397)Online publication date: Sep-2024
https://doi.org/10.1109/TKDE.2024.3377644
Ma HGuan SWang MSong QWu Y(2023)Fair Group Summarization with Graph Patterns2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00154(1982-1994)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00154
Yin ZZhang QZhang WLi RWang G(2023)Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00131(1665-1677)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00131
Ma HGuan SWang MChang YWu Y(2022)Subgraph Query Generation with Fairness and Diversity Constraints2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00278(3106-3118)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00278

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents