{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:07:49Z","timestamp":1725516469884},"publisher-location":"Boston, MA","reference-count":28,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096940"},{"type":"electronic","value":"9780387096957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09695-7_30","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T13:40:02Z","timestamp":1219153202000},"page":"309-318","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Subset Selection for Classification through SAT Encodings"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Angiulli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Basta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1_Ref","volume-title":"22nd International Conference on Machine Learning (ICML)","author":"F Angiulli","year":"2005","unstructured":"Angiulli, F. (2005). Fast condensed nearest neighbor rule. In 22nd International Conference on Machine Learning (ICML), Bonn, Germany."},{"issue":"10","key":"30_CR2_Ref","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1109\/TPAMI.2007.1086","volume":"29","author":"F. Angiulli","year":"2007","unstructured":"Angiulli, F. (2007). Condensed nearest neighbor data domain description. IEEE Trans. Pattern Anal. Mach. Intell., 29(10):1746-1758.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"30_CR3_Ref","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1109\/TKDE.2007.190645","volume":"19","author":"F. Angiulli","year":"2007","unstructured":"Angiulli, F. (2007). Fast nearest neighbor condensation for large data sets classification. IEEE Trans. Knowl. Data Eng., 19(11):1450-1464.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR4_Ref","first-page":"111","volume-title":"Proc. of the Seventh Int. Conf. on Theory and Applications of Satisifiability Testing (SAT)","author":"F Many \u00e0","year":"2004","unstructured":"Many \u00e0 , F., & Ans \u00f3tegui, C (2004). Mapping problems with finite-domain variables into problems with boolean variables. In Proc. of the Seventh Int. Conf. on Theory and Applications of Satisifiability Testing (SAT), pages 111-119, Vancouver, BC, Canada."},{"key":"30_CR5_Ref","first-page":"151","volume-title":"3rd ACM Symposium on Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A. (1971). The complexity of theorem-proving procedures. In 3rd ACM Symposium on Theory of Computing, pages 151-158, Ohio, United States."},{"issue":"1","key":"30_CR6_Ref","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"P.E. Hart","year":"1967","unstructured":"Hart P.E., & Cover, T.M. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1):21-27.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"30_CR7_Ref","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/21.278999","volume":"24","author":"B. Dasarathy","year":"1994","unstructured":"Dasarathy, B. (1994). Minimal consistent subset (mcs) identification for optimal nearest neighbor decision systems design. IEEE Transactions on Systems, Man, and Cybernetics, 24(3):511-517.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"7","key":"30_CR8_Ref","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"G. Logemann","year":"1962","unstructured":"Logemann, G., Loveland, D., & Davis, M. (1962). A machine program for theorem-proving. Communications of the ACM, 5(7):394-397.","journal-title":"Communications of the ACM"},{"issue":"2","key":"30_CR9_Ref","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0031-3203(00)00184-9","volume":"35","author":"M.N. Murty","year":"2002","unstructured":"Murty, M.N., & Devi, F.S. (2002). An incremental prototype set building technique. Pattern Recognition, 35(2):505-513.","journal-title":"Pattern Recognition"},{"key":"30_CR10_Ref","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TPAMI.1981.4767052","volume":"3","author":"L. Devroye","year":"1981","unstructured":"Devroye, L. (1981). On the inequality of cover and hart in nearest neighbor discrimination. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3:75-78.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"unstructured":"S \u00f6rensson, N., & E \u00e9n, N. (2005). Minisat a sat solver with conflict-clause minimization. In International Conference on Theory and Applications of Satisfiability Testing.","key":"30_CR11_Ref"},{"issue":"3","key":"30_CR12_Ref","first-page":"269","volume":"21","author":"M. Warmuth","year":"1995","unstructured":"Warmuth, M., & Floyd, S. (1995). Sample compression, learnability, and the vapnikchervonenkis dimension. Machine Learning, 21(3):269-304.","journal-title":"Machine Learning"},{"key":"30_CR13_Ref","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TIT.1975.1055373","volume":"21","author":"L.D Hostetler","year":"1975","unstructured":"Hostetler, L.D., & Fukunaga, K. (1975). k-nearest-neighbor bayes-risk estimation. IEEE Trans. on Information Theory, 21:285-293.","journal-title":"IEEE Trans. on Information Theory"},{"key":"30_CR14_Ref","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"D.S. Johnson","year":"1979","unstructured":"Johnson, D.S., & Garey, M.R. (1979). Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman and Comp., NY, USA."},{"issue":"3","key":"30_CR15_Ref","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"W. Gates","year":"1972","unstructured":"Gates, W. (1972). The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18(3):431-433.","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR16_Ref","volume-title":"Proc. of the Fifth Int. Conf. on Theory and Applications of Satisifiability Testing (SAT)","author":"P. Prosser","year":"2002","unstructured":"Prosser, P., & Gent, I.P. (2002). In Proc. of the Fifth Int. Conf. on Theory and Applications of Satisifiability Testing (SAT), Cincinnati, Ohio, USA."},{"key":"30_CR17_Ref","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T. (1985). Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"30_CR18_Ref","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E. (1968). The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14(3):515-516.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"30_CR19_Ref","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TNN.2002.804315","volume":"14","author":"H. Krim","year":"2003","unstructured":"Krim, H., & Kara\u00e7ali, B. (2003). Fast minimization of structural risk by nearest neighbor rule. IEEE Transactions on Neural Networks, 14(1):127-134.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"3","key":"30_CR20_Ref","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0031-3203(00)00018-2","volume":"34","author":"M. Nakagawa","year":"2001","unstructured":"Nakagawa, M., & Liu, C.L. (2001). Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition. Pattern Recognition, 34(3):601-615.","journal-title":"Pattern Recognition"},{"unstructured":"Madigan, C., Zhao, Y., Zhang, L., Malik, S., & Moskewicz, M. (2001). Engineering an efficient sat solver. In 39th Design Automation Conference (DAC).","key":"30_CR21_Ref"},{"key":"30_CR22_Ref","volume-title":"Technical Report D-153","author":"A. Darwiche","year":"2007","unstructured":"Darwiche, A., & Pipatsrisawat, K. (2007). Rsat 2.0: Sat solver description. Technical Report D-153, Automated Reasoning Group, Computer Science Department, UCLA."},{"key":"30_CR23_Ref","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"H.B. Woodruff","year":"1975","unstructured":"Woodruff, H.B., Lowry, S.R., Isenhour, T.L., & Ritter, G.L. (1975). An algorithm for a selective nearest neighbor decision rule. IEEE Transactions on Information Theory, 21:665-669.","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR24_Ref","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1214\/aos\/1176345206","volume":"8","author":"C. Stone","year":"1977","unstructured":"Stone, C. (1977). Consistent nonparametric regression. Annals of Statistics, 8:1348-1360.","journal-title":"Annals of Statistics"},{"unstructured":"Toussaint, G. (2002). Proximity graphs for nearest neighbor decision rules: Recent progress. In Proceedings of the Symposium on Computing and Statistics, Montreal, Canada, April 17-20.","key":"30_CR25_Ref"},{"key":"30_CR26_Ref","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of the statistical learning theory","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V. (1995). The Nature of the statistical learning theory. Springer Verlag, New York."},{"issue":"4","key":"30_CR27_Ref","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0218195992000226","volume":"2","author":"G. Wilfong","year":"1992","unstructured":"Wilfong, G. (1992). Nearest neighbor problems. International Journal of Computational Geometry & Applications, 2(4):383-416.","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"3","key":"30_CR28_Ref","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"T.R. Martinez","year":"2000","unstructured":"Martinez, T.R., & Wilson, D.R. (2000). Reduction techniques for instance-based learning algorithms. Machine Learning, 38(3):257-286.","journal-title":"Machine Learning"}],"container-title":["IFIP \u2013 The International Federation for Information Processing","Artificial Intelligence in Theory and Practice II"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09695-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:45:19Z","timestamp":1619574319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09695-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096940","9780387096957"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09695-7_30","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}