{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:28:22Z","timestamp":1759332502737,"version":"3.38.0"},"reference-count":37,"publisher":"Tech Science Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.32604\/cmc.2024.058656","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T07:02:16Z","timestamp":1734505336000},"page":"675-712","source":"Crossref","is-referenced-by-count":1,"title":["Federated Learning\u2019s Role in Next-Gen TV Ad Optimization"],"prefix":"10.32604","volume":"82","author":[{"given":"Gabriela","family":"Dobri\u021ba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adela","family":"B\u00e2ra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona-Vasilica","family":"Oprea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"17807","published-online":{"date-parts":[[2025]]},"reference":[{"key":"ref1","first-page":"122","article-title":"The future of TV advertising targeting young slovak consumers","volume":"2","author":"Miklos\u00edk","year":"2020","journal-title":"Mark. Manag. Innov."},{"key":"ref2","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s11747-019-00691-5","article-title":"Competitive advertising strategies for programmatic television","volume":"48","author":"Guitart","year":"2020","journal-title":"J. Acad. Mark. Sci."},{"key":"ref3","article-title":"Should TV advertisers maximize immediate online response?","author":"Du","year":"2017","journal-title":"SSRN Electron. J."},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3339474","article-title":"Federated machine learning: Concept and applications","volume":"10","author":"Yang","year":"2019","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref5","article-title":"A survey on federated learning","volume":"216","author":"Zhang","year":"15 Mar. 2021","journal-title":"Knowl.-Based Syst."},{"key":"ref6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s13042-022-01647-y","article-title":"A survey on federated learning: Challenges and applications","volume":"14","author":"Wen","year":"2023","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref7","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s10115-022-01664-x","article-title":"From distributed machine learning to federated learning: A survey","volume":"64","author":"Liu","year":"2022","journal-title":"Knowl. Inf. Syst."},{"key":"ref8","doi-asserted-by":"crossref","first-page":"3951","DOI":"10.1007\/s10462-022-10271-9","article-title":"Securing federated learning with blockchain: A systematic literature review","volume":"56","author":"Qammar","year":"2023","journal-title":"Artif. Intell. Rev."},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3412357","article-title":"Federated learning in a medical context: A systematic literature review","volume":"21","author":"Pfitzner","year":"2021","journal-title":"ACM Trans. Internet Technol."},{"key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41666-020-00082-4","article-title":"Federated learning for healthcare informatics","volume":"5","author":"Xu","year":"2021","journal-title":"J. Healthc. Informatics Res."},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1109\/TSP.2022.3153135","article-title":"Robust aggregation for federated learning","volume":"70","author":"Pillutla","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"ref12","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ins.2022.11.031","article-title":"Heterogeneity-aware fair federated learning","volume":"619","author":"Li","year":"Jan. 2023","journal-title":"Inf. Sci."},{"key":"ref13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.0022-1821.2004.00228.x","article-title":"The choice of commercial breaks in television programs: The number, length and timing","volume":"52","author":"Zhou","year":"2004","journal-title":"J. Ind. Econ."},{"key":"ref14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/mnsc.44.1.83","article-title":"SPOT: Scheduling programs optimally for television","volume":"44","author":"Reddy","year":"1998","journal-title":"Manage. Sci."},{"key":"ref15","article-title":"Commercial advertisements scheduling problem","author":"Li","year":"2020","journal-title":"DEStech Trans. Comput. Sci. Eng."},{"key":"ref16","unstructured":"S. Seshadri, S. Subramanian, and S. Souyris, \u201cScheduling Spots on Television,\u201d 2015. Accessed: Oct. 29, 2024. [Online]. Available: https:\/\/api.semanticscholar.org\/CorpusID:55687110"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.future.2018.02.003","article-title":"An efficient cost optimized scheduling for spot instances in heterogeneous cloud environment","volume":"84","author":"Domanal","year":"Jul. 2018","journal-title":"Futur. Gener. Comput. Syst."},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.3496039","article-title":"Finding the sweet spot: Ad scheduling on streaming media","author":"Rajaram","year":"2019","journal-title":"SSRN Electron. J."},{"key":"ref19","series-title":"Proc. ACM SIGKDD Int. Conf. Know. Disc. Data Min.","first-page":"3071","article-title":"TV advertisement scheduling by learning expert intentions","author":"Suzuki","year":"2019"},{"key":"ref20","series-title":"Proc. ACM Symp. Appl. Comput.","first-page":"1056","article-title":"A new reference-based algorithm based on non-euclidean geometry for multi-stakeholder media planning","author":"Benali","year":"2022"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1111\/itor.12481","article-title":"A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising","volume":"27","author":"Evangelista","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.2207140","article-title":"Core-pricing in large multi-object auctions: A market design for selling TV-ads","author":"Goetzendorff","year":"2013","journal-title":"SSRN Electron. J."},{"key":"ref23","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1177\/14707853231175085","article-title":"Reaching voters on social media: Planning political advertising on snapchat","volume":"65","author":"Tanusondjaja","year":"2023","journal-title":"Int. J. Mark. Res."},{"key":"ref24","series-title":"2021 IEEE 33rd Int. Conf. Tools Artif. Intell. (ICTAI)","article-title":"An enhanced R-NSGA-II for multiple brands advertising campaign allocation problem","author":"Benali","year":"2021"},{"key":"ref25","first-page":"185","article-title":"TV advertising and online sales: A case study of intertemporal substitution effects for an online travel platform","volume":"61","author":"Lambrecht","year":"2023","journal-title":"J. Mark. Res."},{"key":"ref26","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/opre.1110.0996","article-title":"The planning of guaranteed targeted display advertising","volume":"60","author":"Turner","year":"2012","journal-title":"Oper. Res."},{"key":"ref27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1177\/0022242919847192","article-title":"Immediate responses of online brand search and price search to TV ads","volume":"83","author":"Du","year":"2019","journal-title":"J. Mark."},{"key":"ref28","article-title":"Advertisement scheduling on commercial radio station using genetics algorithm","volume":"978","author":"Purnamawati","year":"2018","journal-title":"J. Phy.: Conf. Ser."},{"key":"ref29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/jos.74","article-title":"Scheduling space-sharing for internet advertising","volume":"5","author":"Adler","year":"2002","journal-title":"J. Sched."},{"key":"ref30","series-title":"Proc. 9th Int. IPCO Conf. Integer Programm. Combinat. Optimiz.","first-page":"415","article-title":"Approximating the advertisement placement problem","author":"Freund","year":"2004"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1109\/TKDE.2007.190640","article-title":"Optimal scheduling and placement of internet banner advertisements","volume":"19","author":"Kumar","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.106226","article-title":"Online banner advertisement scheduling for advertising effectiveness","volume":"140","author":"Kim","year":"Feb. 2020","journal-title":"Comput. Ind. Eng."},{"key":"ref33","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s00224-024-10170-2","article-title":"Approximation algorithms for the MAXSPACE advertisement problem","volume":"68","author":"Pedrosa","year":"2024","journal-title":"Theory Comput. Syst."},{"key":"ref34","first-page":"905","article-title":"Ad revenue optimization in live broadcasting","volume":"62","author":"Popescu","year":"2016","journal-title":"Manage. Sci."},{"key":"ref35","first-page":"1","article-title":"Optimal data construction in supervised machine learning for financial prediction","volume":"58","author":"Kim","year":"2024","journal-title":"Econ. Comput. Econ. Cybern. Stud. Res."},{"journal-title":"31st Conf. Neural Inf. Process. Syst. (NIPS 2017)","year":"2017","author":"Ke","key":"ref36"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.bdr.2017.07.003","article-title":"Random forests for big data","volume":"9","author":"Genuer","year":"Sep. 2017","journal-title":"Big Data Res."}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/file.techscience.com\/files\/cmc\/2025\/TSP_CMC-82-1\/TSP_CMC_58656\/TSP_CMC_58656.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:07:21Z","timestamp":1741331241000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v82n1\/59251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":37,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2024.058656","relation":{},"ISSN":["1546-2226"],"issn-type":[{"type":"electronic","value":"1546-2226"}],"subject":[],"published":{"date-parts":[[2025]]}}}