{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:23:07Z","timestamp":1743002587016,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478420"},{"type":"electronic","value":"9783031478437"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_19","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"273-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Fairness-Aware (k,\u00a0r)-Core Identification in Large Graphs"],"prefix":"10.1007","author":[{"given":"Xingyu","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengyuan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Beutel, A., et al.: Fairness in recommendation ranking through pairwise comparisons. In: KDD, pp. 2212\u20132220 (2019)","DOI":"10.1145\/3292500.3330745"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"28005","DOI":"10.1209\/0295-5075\/84\/28005","volume":"79","author":"S Carmi","year":"2007","unstructured":"Carmi, S., Church, B., Cohen, S., Havlin, S., Rutenberg, A.: A geographical k-core decomposition. EPL (Europhys. Lett.) 79(2), 28005 (2007)","journal-title":"EPL (Europhys. Lett.)"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1541880.1541882","volume":"41","author":"V Chandola","year":"2009","unstructured":"Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: a survey. ACM Comput. Surv. (CSUR) 41(3), 1\u201358 (2009)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"19_CR4","first-page":"1791","volume":"35","author":"C Chen","year":"2021","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$\\theta $$-clique identification in large signed graphs. IEEE Trans. Knowl. Data Eng. 35, 1791\u20131802 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s11280-021-00933-z","volume":"25","author":"C Chen","year":"2022","unstructured":"Chen, C., Zhang, M., Sun, R., Wang, X., Zhu, W., Wang, X.: Locating pivotal connections: the k-truss minimization and maximization problems. World Wide Web 25(2), 899\u2013926 (2022)","journal-title":"World Wide Web"},{"issue":"1","key":"19_CR6","first-page":"390","volume":"35","author":"C Chen","year":"2021","unstructured":"Chen, C., Zhu, Q., Sun, R., Wang, X., Wu, Y.: Edge manipulation approaches for k-core minimization: metrics and analytics. IEEE Trans. Knowl. Data Eng. 35(1), 390\u2013403 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR7","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Advances in Neural Information Processing Systems, pp. 5029\u20135037 (2017)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, C., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB (2016)","DOI":"10.14778\/2994509.2994538"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"102054","DOI":"10.1016\/j.ipm.2019.102054","volume":"57","author":"A Khan","year":"2020","unstructured":"Khan, A., Golab, L., Kargar, M., Szlichta, J., Zihayat, M.: Compact group discovery in attributed graphs and social networks. Inf. Process. Manage. 57(2), 102054 (2020)","journal-title":"Inf. Process. Manage."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2019.10.004","volume":"832","author":"YX Kong","year":"2019","unstructured":"Kong, Y.X., Shi, G.Y., Wu, R.J., Zhang, Y.C.: k-core: theories and applications. Phys. Rep. 832, 1\u201332 (2019)","journal-title":"Phys. Rep."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Li, Y., Sha, C., Huang, X., Zhang, Y.: Community detection in attributed graphs: an embedding approach. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11274"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: VAC: vertex-centric attributed community search. In: ICDE, pp. 937\u2013948 (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Pan, M., Li, R.H., Zhang, Q., Dai, Y., Tian, Q., Wang, G.: Fairness-aware maximal clique enumeration. In: ICDE, pp. 259\u2013271 (2022)","DOI":"10.1109\/ICDE53745.2022.00024"},{"key":"19_CR14","unstructured":"Sankar, G.S., Louis, A., Nasre, M., Nimbhorkar, P.: Matchings with group fairness constraints: online and offline algorithms. arXiv preprint arXiv:2105.09522 (2021)"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s11280-021-00904-4","volume":"25","author":"R Sun","year":"2022","unstructured":"Sun, R., Chen, C., Wang, X., Wu, Y., Zhang, M., Liu, X.: The art of characterization in large networks: finding the critical attributes. World Wide Web 25(2), 655\u2013677 (2022)","journal-title":"World Wide Web"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, W., Zhang, Y., Lin, X.: Efficient maximum signed biclique identification. In: ICDE, pp. 1313\u20131325 (2023)","DOI":"10.1109\/ICDE55515.2023.00105"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Clique identification in signed graphs: a balance theory based model. IEEE Trans. Knowledge Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3272636"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Verma, S., Rubin, J.: Fairness definitions explained. In: Proceedings of the International Workshop on Software Fairness, pp. 1\u20137 (2018)","DOI":"10.1145\/3194770.3194776"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Wu, Y., Sun, R., Chen, C., Wang, X., Zhu, Q.: Maximum signed (k, r)-truss identification in signed networks. In: CIKM, pp. 3337\u20133340 (2020)","DOI":"10.1145\/3340531.3417457"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s41019-021-00163-3","volume":"6","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310\u2013322 (2021)","journal-title":"Data Sci. Eng."},{"key":"19_CR22","unstructured":"Yao, S., Huang, B.: Beyond parity: fairness objectives for collaborative filtering. In: Advances in Neural Information Processing Systems, pp. 2921\u20132930 (2017)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., Baeza-Yates, R.: Fa* ir: A fair top-k ranking algorithm. In: CIKM, pp. 1569\u20131578 (2017)","DOI":"10.1145\/3132847.3132938"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"11368","DOI":"10.1109\/TKDE.2022.3232165","volume":"35","author":"Q Zhang","year":"2023","unstructured":"Zhang, Q., Li, R.H., Pan, M., Dai, Y., Tian, Q., Wang, G.: Fairness-aware maximal clique in large graphs: concepts and algorithms. IEEE Trans. Knowl. Data Eng. 35, 11368\u201311387 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: ICDE, pp. 337\u2013348 (2017)","DOI":"10.1109\/ICDE.2017.93"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47843-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:34:10Z","timestamp":1699306450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}