Efficient algorithms for clone items detection

CEUR Workshop Proceedings

Volumn 162, Issue , 2005, Pages 70-81

  Medina, Raoul ^a   Noyer, Caroline ^a   Raynaud, Olivier ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RELATION; MINIMUM COVERS; TIME COMPLEXITY;

CLONING; INFORMATION ANALYSIS;

ALGORITHMS;

EID: 79551546439     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. A. Gely, R. Medina, L. Nourine, and Y. Renaud. Uncovering and reducing hidden combinatorics in guigues-duquenne covers. In ICFCA'05, 2005.
2. H. Manilla and K.J. Rähiä. On the complexity of inferring functionnal dependencies. Discret Applied Mathematics, 40(2):237-243, 1992.
3. R. Medina and L. Nourine. Clone items: a pre-processing information for knowledge discovery. submitted.