IDA - Intelligent Data Analysis Research Group

BibTeX Entry

@inproceedings{__65,
  file = {Karel_KES_06_QAR.pdf},
  category = {ida-publications},
  author = {Filip Karel},
  title = {Quantitative and Ordinal Association Rules Mining (QAR Mining)},
  booktitle = {Knowledge-Based Intelligent Information and Engineering Systems},
  editor = {Bogdan Gabrys and Robert J. Howlett and Lakhmi C. Jain},
  series = {LNAI},
  volume = {4251},
  year = {2006},
  publisher = {Springer},
  pages = {195--202},
  abstract = {Association rules have exhibited an excellent ability to identify interesting association relationships among a set of binary variables describing huge amount of transactions. Although the rules can be relatively easily generalized to other variable types, the generalization can result in a computationally expensive algorithm generating a prohibitive number of redundant rules of little significance. This danger especially applies to quantitative and ordinal variables. This paper presents and verifies an alternative approach to the quantitative and ordinal association rule mining. In this approach, quantitative or ordinal variables are not immediately transformed into a set of binary variables. Instead, it applies simple arithmetic operations in order to construct the cedents and searches for areas of increased association which are finally decomposed into conjunctions of literals. This scenario outputs rules that do not syntactically differentiate from classical association rules.},
  vvvs = {1},
}


Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.