Advanced search
1 file | 334.84 KB Add to list
Author
Organization
Project
Abstract
Edit rules are simple tuple-level constraints that concisely model which tuples are not permitted in a consistent relation. Previously, developed algorithms mostly assumed nominal data. This implies that ordinal data either had to be discarded or discretized according to expert knowledge. We can omit this by working with the ordinal data directly. In this paper we explore the discovery of low lift pairwise ordinal edit rules and propose an efficient algorithm employing several pruning strategies derived from the lift measure. Our experiments show that we can obtain a similar precision as nominal algorithms, while having an acceptable computational cost.
Keywords
Data Quality

Downloads

  • 125960367.pdf
    • full text (Published version)
    • |
    • open access
    • |
    • PDF
    • |
    • 334.84 KB

Citation

Please use this url to cite or link to this publication:

MLA
Peelman, Milan, et al. “Discovery of Pairwise Ordinal Edit Rules.” Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP), edited by Radko Mesiar et al., vol. 3, Atlantis Press, 2021, pp. 109–16, doi:10.2991/asum.k.210827.015.
APA
Peelman, M., Bronselaer, A., & De Tré, G. (2021). Discovery of pairwise ordinal edit rules. In R. Mesiar, M. Reformat, M. Štěpnička, & P. Hurtik (Eds.), Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP) (Vol. 3, pp. 109–116). https://doi.org/10.2991/asum.k.210827.015
Chicago author-date
Peelman, Milan, Antoon Bronselaer, and Guy De Tré. 2021. “Discovery of Pairwise Ordinal Edit Rules.” In Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP), edited by Radko Mesiar, Marek Reformat, Martin Štěpnička, and Petr Hurtik, 3:109–16. Atlantis Press. https://doi.org/10.2991/asum.k.210827.015.
Chicago author-date (all authors)
Peelman, Milan, Antoon Bronselaer, and Guy De Tré. 2021. “Discovery of Pairwise Ordinal Edit Rules.” In Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP), ed by. Radko Mesiar, Marek Reformat, Martin Štěpnička, and Petr Hurtik, 3:109–116. Atlantis Press. doi:10.2991/asum.k.210827.015.
Vancouver
1.
Peelman M, Bronselaer A, De Tré G. Discovery of pairwise ordinal edit rules. In: Mesiar R, Reformat M, Štěpnička M, Hurtik P, editors. Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP). Atlantis Press; 2021. p. 109–16.
IEEE
[1]
M. Peelman, A. Bronselaer, and G. De Tré, “Discovery of pairwise ordinal edit rules,” in Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP), Bratislava, Slovakia, 2021, vol. 3, pp. 109–116.
@inproceedings{8720664,
  abstract     = {{Edit rules are simple tuple-level constraints that concisely model which tuples are not permitted in a consistent relation. Previously, developed algorithms mostly assumed nominal data. This implies that ordinal data either had to be discarded or discretized according to expert knowledge. We can omit this by working with the ordinal data directly. In this paper we explore the discovery of low lift pairwise ordinal edit rules and propose an efficient algorithm employing several pruning strategies derived from the lift measure. Our experiments show that we can obtain a similar precision as nominal algorithms, while having an acceptable computational cost.}},
  author       = {{Peelman, Milan and Bronselaer, Antoon and De Tré, Guy}},
  booktitle    = {{Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP)}},
  editor       = {{Mesiar, Radko and Reformat, Marek and Štěpnička, Martin and Hurtik, Petr}},
  isbn         = {{9789462394230}},
  issn         = {{2589-6644}},
  keywords     = {{Data Quality}},
  language     = {{eng}},
  location     = {{Bratislava, Slovakia}},
  pages        = {{109--116}},
  publisher    = {{Atlantis Press}},
  title        = {{Discovery of pairwise ordinal edit rules}},
  url          = {{http://dx.doi.org/10.2991/asum.k.210827.015}},
  volume       = {{3}},
  year         = {{2021}},
}

Altmetric
View in Altmetric