Skip to main content

2018 | OriginalPaper | Buchkapitel

5. Optimization of Decision Rules Relative to Length Based on Modified Dynamic Programming Approach

verfasst von : Beata Zielosko, Krzysztof Żabiński

Erschienen in: Advances in Feature Selection for Data and Pattern Recognition

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This chapter is devoted to the modification of an extension of dynamic programming approach for optimization of decision rules relative to length. “Classical” dynamic programming approach allows one to obtain optimal rules, i.e., rules with the minimum length. This fact is important from the point of view of knowledge representation. The idea of the dynamic programming approach for optimization of decision rules is based on a partitioning of a decision table into subtables. The algorithm constructs a directed acyclic graph. Basing on the constructed graph, sets of rules with the minimum length, attached to each row of a decision table, can be described. Proposed modification is based on the idea that not the complete graph is constructed but its part. It allows one to obtain values of length of decision rules close to optimal ones, and the size of the graph is smaller than in case of “classical” dynamic programming approach. The chapter also contains results of experiments with decision tables from UCI Machine Learning Repository.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Dagger: a tool for analysis and optimization of decision trees and rules. In: Ficarra, F.V.C. (ed.) Computational Informatics, Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiences in the Era of Communicability Expansion, pp. 29–39. Blue Herons, Bergamo, Italy (2011) Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Dagger: a tool for analysis and optimization of decision trees and rules. In: Ficarra, F.V.C. (ed.) Computational Informatics, Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiences in the Era of Communicability Expansion, pp. 29–39. Blue Herons, Bergamo, Italy (2011)
2.
Zurück zum Zitat Amin, T., Chikalov, I., Moshkov, M., Zielosko, B.: Dynamic programming approach to optimization of approximate decision rules. Inf. Sci. 119, 403–418 (2013)CrossRefMATHMathSciNet Amin, T., Chikalov, I., Moshkov, M., Zielosko, B.: Dynamic programming approach to optimization of approximate decision rules. Inf. Sci. 119, 403–418 (2013)CrossRefMATHMathSciNet
3.
Zurück zum Zitat Ang, J., Tan, K., Mamun, A.: An evolutionary memetic algorithm for rule extraction. Expert Syst. Appl. 37(2), 1302–1315 (2010)CrossRef Ang, J., Tan, K., Mamun, A.: An evolutionary memetic algorithm for rule extraction. Expert Syst. Appl. 37(2), 1302–1315 (2010)CrossRef
4.
Zurück zum Zitat An, A., Cercone, N.: Rule quality measures improve the accuracy of rule induction: An experimental approach. In: Raś, Z.W., Ohsuga, S. (eds.) ISMIS. Lecture Notes in Computer Science, vol. 1932, pp. 119–129. Springer (2000) An, A., Cercone, N.: Rule quality measures improve the accuracy of rule induction: An experimental approach. In: Raś, Z.W., Ohsuga, S. (eds.) ISMIS. Lecture Notes in Computer Science, vol. 1932, pp. 119–129. Springer (2000)
6.
Zurück zum Zitat Błaszczyński, J., Słowiński, R., Susmaga, R.: Rule-based estimation of attribute relevance. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS, vol. 6954, pp. 36–44. Springer (2011) Błaszczyński, J., Słowiński, R., Susmaga, R.: Rule-based estimation of attribute relevance. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS, vol. 6954, pp. 36–44. Springer (2011)
7.
Zurück zum Zitat Błaszczyński, J., Słowiński, R., Szela̧g, M.: Sequential covering rule induction algorithm for variable consistency rough set approaches. Inf. Sci. 181(5), 987–1002 (2011)CrossRefMathSciNet Błaszczyński, J., Słowiński, R., Szela̧g, M.: Sequential covering rule induction algorithm for variable consistency rough set approaches. Inf. Sci. 181(5), 987–1002 (2011)CrossRefMathSciNet
8.
Zurück zum Zitat Clark, P., Niblett, T.: The cn2 induction algorithm. Mach. Learn. 3(4), 261–283 (1989) Clark, P., Niblett, T.: The cn2 induction algorithm. Mach. Learn. 3(4), 261–283 (1989)
9.
Zurück zum Zitat Dembczyński, K., Kotłowski, W., Słowiński, R.: Ender: a statistical framework for boosting decision rules. Data Min. Knowl. Discov. 21(1), 52–90 (2010)CrossRefMathSciNet Dembczyński, K., Kotłowski, W., Słowiński, R.: Ender: a statistical framework for boosting decision rules. Data Min. Knowl. Discov. 21(1), 52–90 (2010)CrossRefMathSciNet
10.
Zurück zum Zitat Fürnkranz, J.: Separate-and-conquer rule learning. Artif. Intell. Rev. 13(1), 3–54 (1999)CrossRefMATH Fürnkranz, J.: Separate-and-conquer rule learning. Artif. Intell. Rev. 13(1), 3–54 (1999)CrossRefMATH
11.
Zurück zum Zitat Grzymała-Busse, J.W.: Lers – a system for learning from examples based on rough sets. In: Słowiński, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory, pp. 3–18. Kluwer Academic Publishers (1992) Grzymała-Busse, J.W.: Lers – a system for learning from examples based on rough sets. In: Słowiński, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory, pp. 3–18. Kluwer Academic Publishers (1992)
12.
Zurück zum Zitat Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157–1182 (2003)MATH Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157–1182 (2003)MATH
13.
Zurück zum Zitat Guyon, I., Gunn, S., Nikravesh, M., Zadeh, L. (eds.): Feature Extraction: Foundations and Applications, Studies in Fuzziness and Soft Computing, vol. 207. Physica, Springer (2006) Guyon, I., Gunn, S., Nikravesh, M., Zadeh, L. (eds.): Feature Extraction: Foundations and Applications, Studies in Fuzziness and Soft Computing, vol. 207. Physica, Springer (2006)
14.
Zurück zum Zitat Janusz, A., Ślȩzak, D.: Rough set methods for attribute clustering and selection. Appl. Artif. Intell. 28(3), 220–242 (2014)CrossRef Janusz, A., Ślȩzak, D.: Rough set methods for attribute clustering and selection. Appl. Artif. Intell. 28(3), 220–242 (2014)CrossRef
15.
Zurück zum Zitat Jensen, R., Shen, Q.: Computational Intelligence and Feature Selection: Rough and Fuzzy Approaches. IEEE Press Series on Computational Intelligence. Wiley, New York (2008)CrossRef Jensen, R., Shen, Q.: Computational Intelligence and Feature Selection: Rough and Fuzzy Approaches. IEEE Press Series on Computational Intelligence. Wiley, New York (2008)CrossRef
16.
Zurück zum Zitat Kozak, J., Juszczuk, P.: Association ACDT as a tool for discovering the financial data rules. In: Jedrzejowicz, P., Yildirim, T., Czarnowski, I. (eds.) IEEE International Conference on INnovations in Intelligent SysTems and Applications, INISTA 2017, Gdynia, Poland, July 3–5 2017, pp. 241–246. IEEE (2017) Kozak, J., Juszczuk, P.: Association ACDT as a tool for discovering the financial data rules. In: Jedrzejowicz, P., Yildirim, T., Czarnowski, I. (eds.) IEEE International Conference on INnovations in Intelligent SysTems and Applications, INISTA 2017, Gdynia, Poland, July 3–5 2017, pp. 241–246. IEEE (2017)
17.
Zurück zum Zitat Liu, B., Abbass, H.A., McKay, B.: Classification rule discovery with ant colony optimization. In: IAT 2003, pp. 83–88. IEEE Computer Society (2003) Liu, B., Abbass, H.A., McKay, B.: Classification rule discovery with ant colony optimization. In: IAT 2003, pp. 83–88. IEEE Computer Society (2003)
18.
Zurück zum Zitat Liu, H., Motoda, H.: Guest editors’ introduction: feature transformation and subset selection. IEEE Intell. Syst. 13(2), 26–28 (1998)CrossRef Liu, H., Motoda, H.: Guest editors’ introduction: feature transformation and subset selection. IEEE Intell. Syst. 13(2), 26–28 (1998)CrossRef
19.
Zurück zum Zitat Liu, H., Motoda, H.: Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series). Chapman & Hall/CRC, Boca Raton (2007) Liu, H., Motoda, H.: Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series). Chapman & Hall/CRC, Boca Raton (2007)
21.
Zurück zum Zitat Moshkov, M., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications, Studies in Computational Intelligence, vol. 145. Springer, Heidelberg (2008)MATH Moshkov, M., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications, Studies in Computational Intelligence, vol. 145. Springer, Heidelberg (2008)MATH
22.
Zurück zum Zitat Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach, Studies in Computational Intelligence, vol. 360. Springer, Heidelberg (2011)CrossRefMATH Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach, Studies in Computational Intelligence, vol. 360. Springer, Heidelberg (2011)CrossRefMATH
23.
Zurück zum Zitat Nguyen, H.S., Ślȩzak, D.: Approximate reducts and association rules - correspondence and complexity results. In: RSFDGrC 1999, LNCS, vol. 1711, pp. 137–145. Springer (1999) Nguyen, H.S., Ślȩzak, D.: Approximate reducts and association rules - correspondence and complexity results. In: RSFDGrC 1999, LNCS, vol. 1711, pp. 137–145. Springer (1999)
24.
Zurück zum Zitat Nguyen, H.S.: Approximate boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) T. Rough Sets. LNCS, vol. 4100, pp. 334–506. Springer (2006) Nguyen, H.S.: Approximate boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) T. Rough Sets. LNCS, vol. 4100, pp. 334–506. Springer (2006)
27.
Zurück zum Zitat Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc, Massachusetts (1993) Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc, Massachusetts (1993)
28.
Zurück zum Zitat Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465–471 (1978)CrossRefMATH Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465–471 (1978)CrossRefMATH
29.
Zurück zum Zitat Sikora, M., Wróbel, Ł.: Data-driven adaptive selection of rule quality measures for improving rule induction and filtration algorithms. Int. J. General Syst. 42(6), 594–613 (2013)CrossRef Sikora, M., Wróbel, Ł.: Data-driven adaptive selection of rule quality measures for improving rule induction and filtration algorithms. Int. J. General Syst. 42(6), 594–613 (2013)CrossRef
30.
Zurück zum Zitat Ślȩzak, D., Wróblewski, J.: Order based genetic algorithms for the search of approximate entropy reducts. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS, vol. 2639, pp. 308–311. Springer (2003) Ślȩzak, D., Wróblewski, J.: Order based genetic algorithms for the search of approximate entropy reducts. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS, vol. 2639, pp. 308–311. Springer (2003)
31.
Zurück zum Zitat Stańczyk, U.: Feature evaluation by filter, wrapper, and embedded approaches. In: Stańczyk, U., Jain, L.C. (eds.) Feature Selection for Data and Pattern Recognition. Studies in Computational Intelligence, vol. 584, pp. 29–44. Springer (2015) Stańczyk, U.: Feature evaluation by filter, wrapper, and embedded approaches. In: Stańczyk, U., Jain, L.C. (eds.) Feature Selection for Data and Pattern Recognition. Studies in Computational Intelligence, vol. 584, pp. 29–44. Springer (2015)
32.
Zurück zum Zitat Stańczyk, U., Zielosko, B.: On combining discretisation parameters and attribute ranking for selection of decision rules. In: Polkowski, L., Yao, Y., Artiemjew, P., Ciucci, D., Liu, D., Ślȩzak, D., Zielosko, B. (eds.) Proceedings of Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, 3–7 July 2017, Part I. Lecture Notes in Computer Science, vol. 10313, pp. 329–349. Springer (2017) Stańczyk, U., Zielosko, B.: On combining discretisation parameters and attribute ranking for selection of decision rules. In: Polkowski, L., Yao, Y., Artiemjew, P., Ciucci, D., Liu, D., Ślȩzak, D., Zielosko, B. (eds.) Proceedings of Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, 3–7 July 2017, Part I. Lecture Notes in Computer Science, vol. 10313, pp. 329–349. Springer (2017)
33.
Zurück zum Zitat Stańczyk, U., Jain, L.C. (eds.): Feature Selection for Data and Pattern Recognition. Studies in Computational Intelligence, vol. 584. Springer, Berlin (2015) Stańczyk, U., Jain, L.C. (eds.): Feature Selection for Data and Pattern Recognition. Studies in Computational Intelligence, vol. 584. Springer, Berlin (2015)
34.
Zurück zum Zitat Stefanowski, J., Vanderpooten, D.: Induction of decision rules in classification and discovery-oriented perspectives. Int. J. Intell. Syst. 16(1), 13–27 (2001) Stefanowski, J., Vanderpooten, D.: Induction of decision rules in classification and discovery-oriented perspectives. Int. J. Intell. Syst. 16(1), 13–27 (2001)
35.
Zurück zum Zitat Wieczorek, A., Słowiński, R.: Generating a set of association and decision rules with statistically representative support and anti-support. Inf. Sci. 277, 56–70 (2014)CrossRef Wieczorek, A., Słowiński, R.: Generating a set of association and decision rules with statistically representative support and anti-support. Inf. Sci. 277, 56–70 (2014)CrossRef
36.
Zurück zum Zitat Zielosko, B., Chikalov, I., Moshkov, M., Amin, T.: Optimization of decision rules based on dynamic programming approach. In: Faucher, C., Jain, L.C. (eds.) Innovations in Intelligent Machines-4 - Recent Advances in Knowledge Engineering. Studies in Computational Intelligence, vol. 514, pp. 369–392. Springer (2014) Zielosko, B., Chikalov, I., Moshkov, M., Amin, T.: Optimization of decision rules based on dynamic programming approach. In: Faucher, C., Jain, L.C. (eds.) Innovations in Intelligent Machines-4 - Recent Advances in Knowledge Engineering. Studies in Computational Intelligence, vol. 514, pp. 369–392. Springer (2014)
37.
Zurück zum Zitat Zielosko, B.: Optimization of approximate decision rules relative to coverage. In: Kozielski, S., Mrózek, D., Kasprowski, P., Małysiak-Mrózek, B., Kostrzewa, D. (eds.) Proceedings of Beyond Databases, Architectures, and Structures - 10th International Conference, BDAS 2014, Ustron, Poland, 27–30 May 2014. Communications in Computer and Information Science, vol. 424, pp. 170–179. Springer (2014) Zielosko, B.: Optimization of approximate decision rules relative to coverage. In: Kozielski, S., Mrózek, D., Kasprowski, P., Małysiak-Mrózek, B., Kostrzewa, D. (eds.) Proceedings of Beyond Databases, Architectures, and Structures - 10th International Conference, BDAS 2014, Ustron, Poland, 27–30 May 2014. Communications in Computer and Information Science, vol. 424, pp. 170–179. Springer (2014)
38.
Zurück zum Zitat Zielosko, B.: Optimization of exact decision rules relative to length. In: Czarnowski, I., Howlett, R.J., Jain, L.C. (eds.) Intelligent Decision Technologies 2017: Proceedings of the 9th KES International Conference on Intelligent Decision Technologies (KES-IDT 2017) – Part I, pp. 149–158. Springer (2018) Zielosko, B.: Optimization of exact decision rules relative to length. In: Czarnowski, I., Howlett, R.J., Jain, L.C. (eds.) Intelligent Decision Technologies 2017: Proceedings of the 9th KES International Conference on Intelligent Decision Technologies (KES-IDT 2017) – Part I, pp. 149–158. Springer (2018)
Metadaten
Titel
Optimization of Decision Rules Relative to Length Based on Modified Dynamic Programming Approach
verfasst von
Beata Zielosko
Krzysztof Żabiński
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-67588-6_5