An Efficient Preprocessing Transformation for Functional Dependencies Sets Based on the Substitution Paradigm

uncategorised

Authors

Ángel Mora

Manuel Enciso

Pablo Cordero

Inmaculada Perez de Guzmán

Published

1 January 2003

Publication details

Current Topics in Artificial Intelligence, 10th Conference of the Spanish Association for Artificial Intelligence, {CAEPIA} 2003, and 5th Conference on Technology Transfer, {TTIA} 2003, San Sebastian, Spain, November 12-14, 2003. Revised Selected Papers , Lecture Notes in Computer Science vol. 3040, pages 136–146.

Links

Abstract

Citation

Please, cite this work as:

[Mor+03] Á. Mora, M. Enciso, P. Cordero, et al. “An Efficient Preprocessing Transformation for Functional Dependencies Sets Based on the Substitution Paradigm”. In: Current Topics in Artificial Intelligence, 10th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2003, and 5th Conference on Technology Transfer, TTIA 2003, San Sebastian, Spain, November 12-14, 2003. Revised Selected Papers. Ed. by R. Conejo, M. Urretavizcaya and J. Pérez-de-la-Cruz. Vol. 3040. Lecture Notes in Computer Science. Springer, 2003, pp. 136-146. DOI: 10.1007/978-3-540-25945-9_14. URL: https://doi.org/10.1007/978-3-540-25945-9_14.

BibTeX

@InProceedings{Mora2003,
     author = {{’A}ngel Mora and Manuel Enciso and Pablo Cordero and Inmaculada Perez {de Guzm{’a}n}},
     booktitle = {Current Topics in Artificial Intelligence, 10th Conference of the Spanish Association for Artificial Intelligence, {CAEPIA} 2003, and 5th Conference on Technology Transfer, {TTIA} 2003, San Sebastian, Spain, November 12-14, 2003. Revised Selected Papers},
     title = {An Efficient Preprocessing Transformation for Functional Dependencies Sets Based on the Substitution Paradigm},
     year = {2003},
     editor = {Ricardo Conejo and Maite Urretavizcaya and Jos{’e}-Luis P{’e}rez-de-la-Cruz},
     pages = {136–146},
     publisher = {Springer},
     series = {Lecture Notes in Computer Science},
     volume = {3040},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/conf/caepia/MoraECG03.bib},
     doi = {10.1007/978-3-540-25945-9_14},
     timestamp = {Fri, 23 Sep 2022 01:00:00 +0200},
     url = {https://doi.org/10.1007/978-3-540-25945-9_14},
}

Bibliometric data

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

Citations
CrossRef - Citation Indexes: 6
Scopus - Citation Indexes: 23

Captures
Mendeley - Readers: 8

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] G. Aguilera, P. Cordero, M. Enciso, et al. “A Non-explosive Treatment of Functional Dependencies Using Rewriting Logic”. In: Advances in Artificial Intelligence – SBIA 2004. Springer Berlin Heidelberg, 2004, p. 31–40. ISBN: 9783540286455. DOI: 10.1007/978-3-540-28645-5_4. URL: http://dx.doi.org/10.1007/978-3-540-28645-5_4.

[2] A. Bahmani, S. K. Shekofteh, M. Naghibzadeh, et al. “Parallel algorithms for automatic database normalization”. In: 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE). IEEE, Feb. 2010, p. 157–161. DOI: 10.1109/iccae.2010.5451437. URL: http://dx.doi.org/10.1109/iccae.2010.5451437.

[3] P. Cordero, M. Enciso, D. López-Rodríguez, et al. “fcaR, Formal Concept Analysis with R”. In: The R Journal 14.1 (Jun. 2022), p. 341–361. ISSN: 2073-4859. DOI: 10.32614/rj-2022-014. URL: http://dx.doi.org/10.32614/rj-2022-014.

[4] P. Cordero, M. Enciso, A. Mora, et al. “A Complete Logic for Fuzzy Functional Dependencies over Domains with Similarity Relations”. In: Bio-Inspired Systems: Computational and Ambient Intelligence. Springer Berlin Heidelberg, 2009, p. 261–269. ISBN: 9783642024788. DOI: 10.1007/978-3-642-02478-8_33. URL: http://dx.doi.org/10.1007/978-3-642-02478-8_33.

[5] 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.

[6] D. López-Rodríguez, E. Muñoz-Velasco, and M. Ojeda-Aciego. “Formal Methods in FCA and Big Data”. In: Complex Data Analytics with Formal Concept Analysis. Springer International Publishing, Dec. 2021, p. 201–224. ISBN: 9783030932787. DOI: 10.1007/978-3-030-93278-7_9. URL: http://dx.doi.org/10.1007/978-3-030-93278-7_9.

[7] A. Mora, P. Cordero, M. Enciso, et al. “Closure via functional dependence simplification”. In: International Journal of Computer Mathematics 89.4 (Mar. 2012), p. 510–526. ISSN: 1029-0265. DOI: 10.1080/00207160.2011.644275. URL: http://dx.doi.org/10.1080/00207160.2011.644275.

[8] E. Rodríguez-Lorenzo, K. Bertet, P. Cordero, et al. “Direct-optimal basis computation by means of the fusion of simplification rules”. In: Discrete Applied Mathematics 249 (Nov. 2018), p. 106–119. ISSN: 0166-218X. DOI: 10.1016/j.dam.2017.12.031. URL: http://dx.doi.org/10.1016/j.dam.2017.12.031.

[9] E. Rodríguez-Lorenzo, P. Cordero, M. Enciso, et al. “Canonical dichotomous direct bases”. In: Information Sciences 376 (Jan. 2017), p. 39–53. ISSN: 0020-0255. DOI: 10.1016/j.ins.2016.10.004. URL: http://dx.doi.org/10.1016/j.ins.2016.10.004.