Construction efficace du treillis des motifs fermés fréquents et extraction simultanée des bases génériques de règles

Hamrouni, Tarek; Yahia, Sadok Ben; Nguifo, Engelbert Mephu

doi:10.4000/msh.12081

Cited by 1 publication

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This method allows the discovery of possible combinations of elements, organized hierarchically, with characteristics in common. It proved to be a useful tool in many applied domains: knowledge discovery (Chekol et al, 2013), (Kumar, 2011), (Pfaltz et al, 2002), data mining (Hamrouni et al, 2011), information retrieval (Sakji et al, 2008), web services (Aversano et al, 2006;Azmeh, 2011;Chen, 2008), robotics (Zenou et al, 2004), etc.…”

Section: Preliminarymentioning

confidence: 99%

Efficient Incremental Algorithm for Building Swiftly Concepts Lattices

Bakhta

Belalem

Branci

et al. 2014

International Journal of Web Portals

View full text Add to dashboard Cite

Efficient tool and platform for several areas, concept lattice are widely used in many fields of research. Dynamic environment requires an incremental algorithm to build formal concepts. It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts. Algorithmic complexity is studied both theoretically (in the worst case) and experimentally. It presents a complexity of at most (|M|.|G|.|L|) where M is set of attributes, G is set of objects and L is set of concepts of the lattice. Irrespective of the lattice, the algorithm computes incrementally all formal concepts without increasing time complexity. Algorithmic complexity of the most important incremental algorithms is compared theoretically, and an experimental study based on density/ sparseness of underlying formal contexts is performed with Norris' algorithm classified the most one efficient incremental in practice.

show abstract