{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:42:55Z","timestamp":1725745375736},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_40","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"445-456","source":"Crossref","is-referenced-by-count":2,"title":["A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Froese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"van Bevern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"van Bevern, R.: Towards optimal and expressive kernelization for d-hitting set. Algorithmica (2013)","key":"40_CR1","DOI":"10.1007\/s00453-013-9774-3"},{"issue":"1-2","key":"40_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"A. Blum","year":"1997","unstructured":"Blum, A., Langley, P.: Selection of relevant features and examples in machine learning. Artificial Intelligence\u00a097(1-2), 245\u2013271 (1997)","journal-title":"Artificial Intelligence"},{"issue":"7","key":"40_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.dam.2010.05.022","volume":"159","author":"A. Brandst\u00e4dt","year":"2011","unstructured":"Brandst\u00e4dt, A., Mosca, R.: On distance-3 matchings and induced matchings. Discrete Appl. Math.\u00a0159(7), 509\u2013520 (2011)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Suchy\u030c, O.: A multivariate complexity analysis of lobbying in multiple referenda. In: Proc. 26th AAAI, pp. 1292\u20131298 (2012)","key":"40_CR4","DOI":"10.1609\/aaai.v26i1.8248"},{"unstructured":"Charikar, M., Guruswami, V., Kumar, R., Rajagopalan, S., Sahai, A.: Combinatorial feature selection problems. In: Proc. 41st FOCS, pp. 631\u2013640 (2000)","key":"40_CR5"},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J. Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation\u00a0201(2), 216\u2013231 (2005)","journal-title":"Information and Computation"},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R. Christian","year":"2007","unstructured":"Christian, R., Fellows, M.R., Rosamond, F., Slinko, A.: On complexity of lobbying in multiple referenda. Review of Economic Design\u00a011(3), 217\u2013224 (2007)","journal-title":"Review of Economic Design"},{"doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Drineas, P., Harb, B., Josifovski, V., Mahoney, M.W.: Feature selection methods for text classification. In: Proc. 13th ACM SIGKDD, pp. 230\u2013239 (2007)","key":"40_CR8","DOI":"10.1145\/1281192.1281220"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","key":"40_CR10","DOI":"10.1007\/978-1-4612-0515-9"},{"unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)","key":"40_CR11"},{"key":"40_CR12","first-page":"1289","volume":"3","author":"G. Forman","year":"2003","unstructured":"Forman, G.: An extensive empirical study of feature selection metrics for text classification. J. Mach. Learn. Res.\u00a03, 1289\u20131305 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"40_CR13","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.\u00a03, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Koller, D., Sahami, M.: Towards optimal feature selection. In: Proc. 13th ICML, pp. 284\u2013292 (1996)","key":"40_CR14"},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2008.09.005","volume":"7","author":"H. Moser","year":"2009","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms\u00a07(2), 181\u2013190 (2009)","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","key":"40_CR16","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic (1991)","key":"40_CR17","DOI":"10.1007\/978-94-011-3534-4"},{"doi-asserted-by":"crossref","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support\u2014Handbook of Applications and Advances of the Rough Sets Theory, pp. 331\u2013362. Kluwer Academic (1992)","key":"40_CR18","DOI":"10.1007\/978-94-015-7975-9_21"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T18:35:16Z","timestamp":1688409316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}