{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:01Z","timestamp":1742914141196,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031171130"},{"type":"electronic","value":"9783031171147"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-17114-7_4","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T11:05:35Z","timestamp":1663412735000},"page":"35-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Classifying COVID-19 Related Meta Ads Using Discourse Representation Through a Hypergraph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5467-0374","authenticated-orcid":false,"given":"Ujun","family":"Jeong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5763-2103","authenticated-orcid":false,"given":"Zeyad","family":"Alghamdi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6684-6752","authenticated-orcid":false,"given":"Kaize","family":"Ding","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2503-2522","authenticated-orcid":false,"given":"Lu","family":"Cheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6365-3082","authenticated-orcid":false,"given":"Baoxin","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3264-7904","authenticated-orcid":false,"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Andreou, A., Silva, M., Benevenuto, F., Goga, O., Loiseau, P., Mislove, A.: Measuring the Facebook advertising ecosystem. In: Network and Distributed System Security Symposium (2019)","DOI":"10.14722\/ndss.2019.23280"},{"key":"4_CR2","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets. Elsevier, Amsterdam (1984)"},{"key":"4_CR3","unstructured":"Bernardi, D.L., Cheong, P.H., Lundry, C., Ruston, S.W.: Narrative landmines. In: Narrative Landmines. Rutgers University Press (2012)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cho, K., Van Merri\u00ebnboer, B., Bahdanau, D., Bengio, Y.: On the properties of neural machine translation: encoder-decoder approaches. arXiv (2014)","DOI":"10.3115\/v1\/W14-4012"},{"key":"4_CR5","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. arXiv (2018)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ding, K., Wang, J., Caverlee, J., Liu, H.: Meta propagation networks for graph few-shot semi-supervised learning. In: AAAI (2022)","DOI":"10.1609\/aaai.v36i6.20605"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ding, K., Wang, J., Li, J., Li, D., Liu, H.: Be more with less: hypergraph attention networks for inductive text classification. arXiv (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.399"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Ding, K., Wang, J., Li, J., Shu, K., Liu, C., Liu, H.: Graph prototypical networks for few-shot learning on attributed networks. In: ACM International Conference on Information and Knowledge Management (2020)","DOI":"10.1145\/3340531.3411922"},{"key":"4_CR9","unstructured":"Edelson, L., Sakhuja, S., Dey, R., McCoy, D.: An analysis of united states online political advertising transparency. arXiv (2019)"},{"key":"4_CR10","unstructured":"Gutierrez, B.J., Zeng, J., Zhang, D., Zhang, P., Su, Y.: Document classification for COVID-19 literature. arXiv (2020)"},{"key":"4_CR11","unstructured":"Jeong, U., Ding, K., Liu, H.: FbadtTacker: an interactive data collection and analysis tool for Facebook advertisements. arXiv (2021)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kim, Y.: Convolutional neural networks for sentence classification. Empirical Methods Nat. Lang. Process. (2014)","DOI":"10.3115\/v1\/D14-1181"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Silva, M., Benevenuto, F.: COVID-19 ads as political weapon. In: Annual ACM Symposium on Applied Computing (2021)","DOI":"10.1145\/3412841.3442043"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Silva, M., Santos de Oliveira, L., Andreou, A., Vaz de Melo, P.O., Goga, O., Benevenuto, F.: Facebook ads monitor: an independent auditing system for political ads on Facebook. In: The Web Conference (2020)","DOI":"10.1145\/3366423.3380109"},{"key":"4_CR15","unstructured":"Speicher, T., et al.: Potential for discrimination in online targeted advertising. In: Conference on Fairness, Accountability and Transparency. PMLR (2018)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Wang, J., Ding, K., Zhu, Z., Caverlee, J.: Session-based recommendation with hypergraph attention networks. In: SIAM International Conference on Data Mining (SDM) (2021)","DOI":"10.1137\/1.9781611976700.10"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Yang, Z., Yang, D., Dyer, C., He, X., Smola, A., Hovy, E.: Hierarchical attention networks for document classification. In: NAACL (2016)","DOI":"10.18653\/v1\/N16-1174"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Yao, L., Mao, C., Luo, Y.: Graph convolutional networks for text classification. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: NIPS (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Lecture Notes in Computer Science","Social, Cultural, and Behavioral Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17114-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:03:22Z","timestamp":1726729402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17114-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171130","9783031171147"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17114-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBP-BRiMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Social Computing, Behavioral-Cultural Modeling and Prediction and Behavior Representation in Modeling and Simulation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pittsburgh, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sbp-brims.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"25","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":"50% - 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":"2","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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}