{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:11:52Z","timestamp":1742947912281,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030669805"},{"type":"electronic","value":"9783030669812"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-66981-2_1","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T14:06:41Z","timestamp":1610633201000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trade Selection with Supervised Learning and Optimal Coordinate Ascent (OCA)"],"prefix":"10.1007","author":[{"given":"David","family":"Saltiel","sequence":"first","affiliation":[]},{"given":"Eric","family":"Benhamou","sequence":"additional","affiliation":[]},{"given":"Rida","family":"Laraki","sequence":"additional","affiliation":[]},{"given":"Jamal","family":"Atif","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0004-3702(94)90084-1","volume":"69","author":"H Almuallim","year":"1994","unstructured":"Almuallim, H., Dietterich, T.G.: Learning Boolean concepts in the presence of many irrelevant features. Artif. Intell. 69, 279\u2013305 (1994)","journal-title":"Artif. Intell."},{"key":"1_CR2","unstructured":"Alvarez-Melis, D., Jaakkola, T.S.: On the robustness of interpretability methods. CoRR (2018). http:\/\/arxiv.org\/abs\/1806.08049"},{"key":"1_CR3","unstructured":"Bach, F.R.: Exploring large feature spaces with hierarchical multiple kernel learning. In: Koller, D., Schuurmans, D., Bengio, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 21, pp. 105\u2013112 (2009)"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum, A.L., Langley, P.: Selection of relevant features and examples in machine learning. Artif. Intell. 97(1\u20132), 245\u2013271 (1997)","journal-title":"Artif. Intell."},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1111\/jofi.12186","volume":"69","author":"AP Chaboud","year":"2015","unstructured":"Chaboud, A.P., Chiquoine, B., Hjalmarsson, E., Vega, C.: Rise of the machines: algorithmic trading in the foreign exchange market. J. Finan. 69(5), 2045\u20132084 (2015)","journal-title":"J. Finan."},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118676998","volume-title":"Algorithmic Trading: Winning Strategies and Their Rationale","author":"E Chan","year":"2013","unstructured":"Chan, E.: Algorithmic Trading: Winning Strategies and Their Rationale, 1st edn. Wiley Publishing, Hoboken (2013)","edition":"1"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. CoRR abs\/1603.02754 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"1_CR9","unstructured":"Diakonikolas, J., Orecchia, L.: Alternating randomized block coordinate descent. In: Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, PMLR, 10\u201315 July 2018, Stockholmsm\u00e4ssan, Stockholm, Sweden (2018)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Fung, S.P.Y.: Optimal online two-way trading with bounded number of transactions. CoRR (2017)","DOI":"10.1007\/978-3-319-62389-4_18"},{"key":"1_CR11","unstructured":"Gaudel, R., Sebag, M.: Feature Selection as a one-player game. In: International Conference on Machine Learning, Haifa, Israel, pp. 359\u2013366, June 2010. https:\/\/hal.inria.fr\/inria-00484049"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Di Graziano, G.(D.B.A.): Optimal trading stops and algorithmic trading. SSRN (2014). https:\/\/ssrn.com\/abstract=2381830","DOI":"10.2139\/ssrn.2381830"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1111\/fire.12034","volume":"49","author":"M Goldstein","year":"2014","unstructured":"Goldstein, M., Viljoen, T., Westerholm, P.J., Zheng, H.: Algorithmic trading, liquidity, and price discovery: an intraday analysis of the SPI 200 futures. Fin. Rev. 49(2), 245\u2013270 (2014)","journal-title":"Fin. Rev."},{"key":"1_CR14","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR15","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. SSS. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-84858-7"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kira, K., Rendell, L.A.: A practical approach to feature selection. In: Proceedings of the Ninth International Workshop on Machine Learning. ML92, San Francisco, CA, USA (1992)","DOI":"10.1016\/B978-1-55860-247-2.50037-1"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1111\/jofi.12498","volume":"72","author":"A Kirilenko","year":"2017","unstructured":"Kirilenko, A., Kyle, A.S., Samadi, M., Tuzun, T.: The flash crash: high-frequency trading in an electronic market. J. Finan. 72, 967\u2013998 (2017)","journal-title":"J. Finan."},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artif. Intell. 97(1), 273\u2013324 (1997)","journal-title":"Artif. Intell."},{"key":"1_CR19","unstructured":"Koller, D., Sahami, M.: Toward optimal feature selection. In: Proceedings of the Thirteenth International Conference on International Conference on Machine Learning, pp. 284\u2013292. ICML 1996, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc., Burlington (1996)"},{"key":"1_CR20","unstructured":"Labadie, M., Lehalle, C.A.: Optimal algorithmic trading and market microstructure. Working papers (2010)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Mangal, A., Holm, E.A.: A comparative study of feature selection methods for stress hotspot classification in materials. ArXiv e-prints, April 2018","DOI":"10.1007\/s40192-018-0109-8"},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/34.990133","volume":"24","author":"P Mitra","year":"2002","unstructured":"Mitra, P., Murthy, C.A., Pal, S.K.: Unsupervised feature selection using feature similarity. IEEE Trans. Pattern Anal. Mach. Intell. 24(3), 301\u2013312 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"1_CR24","unstructured":"Ng, A.Y.: Feature selection, l1 vs. l2 regularization, and rotational invariance. In: ICML 2004 (2004)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Staniak, M., Biecek, P.: Explanations of model predictions with live and breakdown packages. R J. 10, 395 (2018)","DOI":"10.32614\/RJ-2018-072"},{"key":"1_CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1994","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. Roy. Stat. Soc. B 58, 267\u2013288 (1994)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"1_CR27","first-page":"1341","volume":"10","author":"E Tuv","year":"2009","unstructured":"Tuv, E., Borisov, A., Runger, G., Torkkola, K.: Feature selection with ensembles, artificial variables, and redundancy elimination. J. Mach. Learn. Res. 10, 1341\u20131366 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR28","first-page":"56","volume":"11","author":"D Vezeris","year":"2018","unstructured":"Vezeris, D., Kyrgos, T., Schinas, C.T.P., Loss, S.: Trading strategies comparison in combination with an MACD trading system. J. Risk Fin. Manage. 11, 56 (2018)","journal-title":"J. Risk Fin. Manage."},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Wright: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","DOI":"10.1007\/s10107-015-0892-3"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.knosys.2016.07.026","volume":"110","author":"A Zarshenas","year":"2016","unstructured":"Zarshenas, A., Suzuki, K.: Binary coordinate ascent: an efficient optimization technique for feature subset selection for machine learning. Knowl.-Based Syst. 110, 191\u2013201 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"1_CR31","unstructured":"Zhang, T.: Adaptive forward-backward greedy algorithm for sparse learning with linear models. Curran Associates, Inc. (2009)"}],"container-title":["Lecture Notes in Computer Science","Mining Data for Financial Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66981-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T23:01:41Z","timestamp":1736809301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66981-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030669805","9783030669812"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66981-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIDAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Mining Data for Financial Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"midas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/midas.portici.enea.it\/","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":"15","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":"8","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":"3","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":"53% - 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":"1","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)"}},{"value":"The workshop was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}