Type
Conference PaperKAUST Department
Applied Mathematics and Computational Science ProgramComputer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Date
2012Permanent link to this record
http://hdl.handle.net/10754/564503
Metadata
Show full item recordAbstract
Authors present algorithms for optimization of inhibitory rules relative to the length and coverage. Inhibitory rules have a relation "attribute ≠ value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. Paper contains also comparison of length and coverage of inhibitory rules constructed by a greedy algorithm and by the dynamic programming algorithm. © 2012 Springer-Verlag.Citation
Alsolami, F., Chikalov, I., Moshkov, M., & Zielosko, B. M. (2012). Length and Coverage of Inhibitory Decision Rules. Lecture Notes in Computer Science, 325–334. doi:10.1007/978-3-642-34707-8_33Publisher
Springer NatureConference/Event name
4th International Conference on Computational Collective Intelligence, ICCCI 2012ISBN
9783642347061ae974a485f413a2113503eed53cd6c53
10.1007/978-3-642-34707-8_33