Dynamic programming approach for construction of association rule systems

Fawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work.

Original languageEnglish (US)
Title of host publicationConcurrency, Specification and Programming - 24th InternationalWorkshop, CS and P 2015, Proceedings
EditorsZbigniew Suraj, Ludwik Czaja, Ludwik Czaja
PublisherCEUR-WS
Pages12-21
Number of pages10
ISBN (Electronic)9788379961818
StatePublished - Jan 1 2015
Event24th International Workshop on Concurrency, Specification and Programming, CS and P 2015 - Rzeszow, Poland
Duration: Sep 28 2015Sep 30 2015

Publication series

NameCEUR Workshop Proceedings
Volume1492
ISSN (Print)1613-0073

Other

Other24th International Workshop on Concurrency, Specification and Programming, CS and P 2015
CountryPoland
CityRzeszow
Period09/28/1509/30/15

Keywords

  • Association rules
  • Decision rules
  • Dynamic programming
  • Rough sets
  • Set cover problem

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Dynamic programming approach for construction of association rule systems'. Together they form a unique fingerprint.

Cite this