{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T12:54:49Z","timestamp":1747313689791,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466700"},{"type":"electronic","value":"9783031466717"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46671-7_16","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T11:02:26Z","timestamp":1699095746000},"page":"231-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dominance Maximization in\u00a0Uncertain Graphs"],"prefix":"10.1007","author":[{"given":"Atharva","family":"Tekawade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suman","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 29\u201338 (2009)","DOI":"10.1145\/1557019.1557030"},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TKDE.2008.190","volume":"21","author":"CC Aggarwal","year":"2008","unstructured":"Aggarwal, C.C., Philip, S.Y.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng. 21(5), 609\u2013623 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-09174-7_4","volume-title":"Combinatorial Optimization","author":"M Ba\u00efou","year":"2014","unstructured":"Ba\u00efou, M., Barahona, F.: The dominating set polytope via facility location. In: Fouilhoux, P., Gouveia, L.E.N., Mahjoub, A.R., Paschos, V.T. (eds.) ISCO 2014. LNCS, vol. 8596, pp. 38\u201349. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09174-7_4"},{"issue":"7","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1007\/s10115-022-01681-w","volume":"64","author":"S Banerjee","year":"2022","unstructured":"Banerjee, S.: A survey on mining and analysis of uncertain graphs. Knowl. Inf. Syst. 64(7), 1653\u20131689 (2022)","journal-title":"Knowl. Inf. Syst."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.knosys.2015.09.025","volume":"90","author":"G Chen","year":"2015","unstructured":"Chen, G., Zhang, X., Wang, Z.J., Li, F.: Robust support vector data description for outlier detection with noise or uncertain data. Knowl.-Based Syst. 90, 129\u2013137 (2015)","journal-title":"Knowl.-Based Syst."},{"key":"16_CR6","unstructured":"Dai, F., Wu, J.: On constructing K-connected K-dominating set in wireless networks. In: 19th IEEE International Parallel and Distributed Processing Symposium, p. 10. IEEE (2005)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discovery Data (TKDD) 1(1), 2-es (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1287\/ijoc.2021.1144","volume":"34","author":"S Raghavan","year":"2022","unstructured":"Raghavan, S., Zhang, R.: Rapid influence maximization on social networks: the positive influence dominating set problem. INFORMS J. Comput. 34(3), 1345\u20131365 (2022)","journal-title":"INFORMS J. Comput."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Tomar, D., Sathappan, S.: A method for handling clustering of uncertain data. In: 2016 International Conference on Advances in Human Machine Interaction (HMI), pp. 1\u20135. IEEE (2016)","DOI":"10.1109\/HMI.2016.7449198"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.datak.2018.07.004","volume":"117","author":"Z Xie","year":"2018","unstructured":"Xie, Z., Xu, Y., Hu, Q.: Uncertain data classification with additive kernel support vector machine. Data Knowl. Eng. 117, 87\u201397 (2018)","journal-title":"Data Knowl. Eng."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 555\u2013564 (2017)","DOI":"10.1145\/3097983.3098069"},{"key":"16_CR15","unstructured":"Zhou, T., Ouyang, H., Bilmes, J., Chang, Y., Guestrin, C.: Scaling submodular maximization via pruned submodularity graphs. In: Artificial Intelligence and Statistics, pp. 316\u2013324. PMLR (2017)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46671-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T11:05:15Z","timestamp":1699095915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46671-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466700","9783031466717"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46671-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. 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":"503","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":"216","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":"43% - 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.97","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.77","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)"}}]}}