Parcourir par auteur Valtchev, Petko

Regrouper par Type Sans regrouement |

Nombre de documents archivés : 7.

Szathmary, Laszlo; Valtchev, Petko; Napoli, Amedeo; Godin, Robert; Boc, Alix et Makarenkov, Vladimir (2014). « A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes ». Annals of Mathematics and Artificial Intelligence, 70(1-2), pp. 81-105.

Nayrolles, Mathieu; Moha, Naouel et Valtchev, Petko (2013). « Improving SOA antipatterns detection in Service Based Systems by mining execution traces » (20th Working Conference on Reverse Engineering, WCRE 2013, Koblenz, Germany, October 14-17, 2013, Klobenz, Allemagne, 14-17 octobre 2013) pp. 321-330.

Moha, Naouel; Hacene, Amine M. R.; Valtchev, Petko et Yann-Gaël Guéhéneuc, (2008). « Refactorings of Design Defects using Relational Concept Analysis » (Proceedings of the 4th International Conference on Formal Concept Analysis (ICFCA'08), ), sous la dir. de Medina, Raoul et Obiedkov, Sergei. pp. 289-304.

Valtchev, Petko; Missaoui, Rokia et Lebrun, Pierre (2002). « A partition-based approach towards constructing Galois (concept) lattices ». Discrete Mathematics, 256(3), pp. 801-829.

Valtchev, Petko; Missaoui, Rokia; Godin, Robert et Meridji, Mohamed (2002). « Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory ». Journal of Experimental & Theoretical Artificial Intelligence, 14(2-3), pp. 115-142.

Valtchev, Petko (1999). « Building Classes in Object-Based Languages by Automatic Clustering », dans Advances in Intelligent Data Analysis, sous la dir. de Hand, David J.; Kok, Joost N. et Berthold, Michael R.. Heidelberg, Springer Berlin Heidelberg, coll. «Lecture Notes in Computer Science », vol. 1642, no 1642, pp. 303-314.

Valtchev, Petko (1999). « An Algorithm for Minimal Insertion in a Type Lattice ». Computational Intelligence, 15(1), pp. 63-78.

Cette liste a été générée le Wed Dec 6 18:15:24 2023 EST.