{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:47:55Z","timestamp":1730281675437,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T00:00:00Z","timestamp":1624406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T00:00:00Z","timestamp":1624406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,23]]},"DOI":"10.1109\/memea52024.2021.9478696","type":"proceedings-article","created":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T21:51:23Z","timestamp":1626126683000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Biological Data Classification via Faster MAXimum Feasible Subsystem Algorithm"],"prefix":"10.1109","author":[{"given":"Fereshteh Fakhar","family":"Firouzeh","sequence":"first","affiliation":[{"name":"Carleton University,Faculty of Engineering,Systems and Computer Engineering Department,Ottawa,Canada"}]},{"given":"John W.","family":"Chinneck","sequence":"additional","affiliation":[{"name":"Carleton University,Faculty of Engineering,Systems and Computer Engineering Department,Ottawa,Canada"}]},{"given":"Sreeraman","family":"Rajan","sequence":"additional","affiliation":[{"name":"Carleton University,Faculty of Engineering,Systems and Computer Engineering Department,Ottawa,Canada"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TENSYMP50017.2020.9230877"},{"key":"ref11","article-title":"From finding maximum feasible subsystems of linear systems to feedforward neural network design","author":"amaldi","year":"1994","journal-title":"PhD dissertation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.13.3.210.12632"},{"article-title":"Faster maximum feasible subsystem solutions for dense constraint matrices","year":"2021","author":"firouzeh","key":"ref13"},{"key":"ref14","first-page":"3","article-title":"Supervised machine learning: A review of classification techniques","volume":"160","author":"kotsiantis","year":"2007","journal-title":"Emerging Artificial Intelligence Applications in Computer Engineering"},{"key":"ref15","first-page":"60","volume":"18","author":"murphy","year":"2006","journal-title":"Naive Bayes Classifier"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2019.1607715"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990155"},{"key":"ref18","first-page":"1","article-title":"Maximum feasible subsystem recovery of compressed ecg signals","author":"firouzeh","year":"2020","journal-title":"2020 IEEE International Symposium on Medical Measurements and Applications (MeMeA)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88843-9_19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.radonc.2018.05.030"},{"year":"0","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICATCCT.2016.7912076"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2020.2995518"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25465-X_9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/risks7010029"},{"journal-title":"Roundup of Machine Learning Forecasts and Market Estimates","year":"2020","key":"ref2"},{"key":"ref9","first-page":"1310","article-title":"A review of supervised machine learning algorithms","author":"singh","year":"2016","journal-title":"2016 3rd International Conference on Computing for Sustainable Global Development (INDIACom)"},{"key":"ref1","article-title":"Idc: Expect 175 zettabytes of data worldwide by 2025","author":"patrizio","year":"2018","journal-title":"Network World"},{"article-title":"UCI machine learning repository","year":"2017","author":"dua","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.07.061"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.10.118"},{"year":"2018","key":"ref24","article-title":"The mosek optimization software"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5121\/ijdkp.2015.5201","article-title":"A review on evaluation metrics for data classification evaluations","volume":"5","author":"hossin","year":"2015","journal-title":"International Journal of Data Mining & Knowledge Management Process"},{"key":"ref25","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"Journal of Machine Learning Research"}],"event":{"name":"2021 IEEE International Symposium on Medical Measurements and Applications (MeMeA)","start":{"date-parts":[[2021,6,23]]},"location":"Lausanne, Switzerland","end":{"date-parts":[[2021,6,25]]}},"container-title":["2021 IEEE International Symposium on Medical Measurements and Applications (MeMeA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9478589\/9478590\/09478696.pdf?arnumber=9478696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:20:50Z","timestamp":1659486050000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9478696\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,23]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/memea52024.2021.9478696","relation":{},"subject":[],"published":{"date-parts":[[2021,6,23]]}}}