An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data

 

Abstract

Citation

Please, cite this work as:

[Bel+12] R. Belohlávek, P. Cordero, M. Enciso, et al. “An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data”. In: Modeling Decisions for Artificial Intelligence - 9th International Conference, MDAI 2012, Girona, Catalonia, Spain, November 21-23, 2012. Proceedings. Ed. by V. Torra, Y. Narukawa, B. López and M. Villaret. Vol. 7647. Lecture Notes in Computer Science. Springer, 2012, pp. 408-419. DOI: 10.1007/978-3-642-34620-0_36. URL: https://doi.org/10.1007/978-3-642-34620-0_36.

BibTeX

@InProceedings{Belohlavek2012,
     author = {Radim Belohl{’a}vek and Pablo Cordero and Manuel Enciso and {’A}ngel Mora and Vil{’e}m Vychodil},
     booktitle = {Modeling Decisions for Artificial Intelligence - 9th International Conference, {MDAI} 2012, Girona, Catalonia, Spain, November 21-23, 2012. Proceedings},
     title = {An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data},
     year = {2012},
     editor = {Vicen{} Torra and Yasuo Narukawa and Beatriz L{’o}pez and Mateu Villaret},
     pages = {408–419},
     publisher = {Springer},
     series = {Lecture Notes in Computer Science},
     volume = {7647},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/mdai/BelohlavekCEMV12.bib},
     doi = {10.1007/978-3-642-34620-0_36},
     timestamp = {Tue, 07 May 2024 20:11:44 +0200},
     url = {https://doi.org/10.1007/978-3-642-34620-0_36},
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

[1] M. J. Benítez-Caballero, J. Medina, E. Ramírez-Poussa, et al. “Bireducts with tolerance relations”. In: Information Sciences 435 (Apr. 2018), p. 26–39. ISSN: 0020-0255. DOI: 10.1016/j.ins.2017.12.037. URL: http://dx.doi.org/10.1016/j.ins.2017.12.037.

[2] P. Cordero, M. Enciso, A. Mora, et al. “Computing non-redundant sets of functional dependencies via simplification”. In: 2013 IEEE Symposium on Foundations of Computational Intelligence (FOCI). IEEE, Apr. 2013, p. 9–14. DOI: 10.1109/foci.2013.6602449. URL: http://dx.doi.org/10.1109/foci.2013.6602449.

[3] J. L. Leiva, M. Enciso, C. Rossi, et al. “Improving Recommender Systems with Simplification Logic to Manage Implications with Grades”. In: Software Technologies. Springer Berlin Heidelberg, 2014, p. 290–305. ISBN: 9783662449202. DOI: 10.1007/978-3-662-44920-2_18. URL: http://dx.doi.org/10.1007/978-3-662-44920-2_18.

[4] J. L. Leiva, M. Enciso, C. Rossi, et al. “Improving Recommender Systems with Simplification Logic to Manage Implications with Grades”. In: Software Technologies. Springer Berlin Heidelberg, 2014, p. 290–305. ISBN: 9783662449202. DOI: 10.1007/978-3-662-44920-2_18. URL: http://dx.doi.org/10.1007/978-3-662-44920-2_18.

[5] J. Rodriguez-Jimenez, E. Rodriguez-Lorenzo, P. Cordero, et al. “A Normal Form for Fuzzy Functional Dependencies”. In: 2015 IEEE Symposium Series on Computational Intelligence. IEEE, Dec. 2015, p. 984–989. DOI: 10.1109/ssci.2015.143. URL: http://dx.doi.org/10.1109/ssci.2015.143.

[6] V. Vychodil. “Computing sets of graded attribute implications with witnessed non-redundancy”. In: Information Sciences 351 (Jul. 2016), p. 90–100. ISSN: 0020-0255. DOI: 10.1016/j.ins.2016.03.004. URL: http://dx.doi.org/10.1016/j.ins.2016.03.004.