Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Brahim Douar"'
Autor:
Brahim, Douar1 brahim.douar@univ-ghardaia.dz, Amal, Kalbaza2 kalbaza.amal@univ-ghardaia.dz
Publikováno v:
Journal of Economic Reforms & Integration in the Economic World. 2020, Vol. 14 Issue 3, p1-10. 10p.
Publikováno v:
Knowledge and Information Systems (KAIS)
Knowledge and Information Systems (KAIS), Springer, 2015, 44 (1), pp.1-25. ⟨10.1007/s10115-014-0769-4⟩
Knowledge and Information Systems (KAIS), Springer, 2015, 44 (1), pp.1-25. ⟨10.1007/s10115-014-0769-4⟩
International audience; Developing algorithms that discover all frequently occurring subgraphs in a large graph database is computationally extensive, as graph and subgraph isomorphisms play a key role throughout the computations. Since subgraph isom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e784084c3ea6cbae77e0debeaca3298a
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01275709/file/KAIS20141.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01275709/file/KAIS20141.pdf
Publikováno v:
International Journal on Artificial Intelligence Tools
International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2014, 23 (5), pp.#1450005. ⟨10.1142/S0218213014500055⟩
International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2014, 23 (5), pp.#1450005. ⟨10.1142/S0218213014500055⟩
International audience; The aim of the frequent subgraph mining task is to find frequently occurring subgraphs in a large graph database. However, this task is a thriving challenge, as graph and subgraph isomorphisms play a key role throughout the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68d1d67dde78fad4622e686741b59ec5
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01275714/file/IJAIT2014.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01275714/file/IJAIT2014.pdf
Publikováno v:
21st International Conference on Inductive Logic Programmin
ILP: Inductive Logic Programming
ILP: Inductive Logic Programming, Jul 2011, Cumberland Lodge, United Kingdom. pp.98-112
Inductive Logic Programming ISBN: 9783642319501
ILP
ILP: Inductive Logic Programming
ILP: Inductive Logic Programming, Jul 2011, Cumberland Lodge, United Kingdom. pp.98-112
Inductive Logic Programming ISBN: 9783642319501
ILP
International audience; The paper presents a new projection operator for graphs, named AC- projection, which exhibits good complexity properties as opposed to the graph isomorphism (Θ-subsumption) operator typically used in graph mining. We study th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bccdf847c61646e495ac52320c9f7517
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00757471/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00757471/document
Publikováno v:
CIDM
CIDM'11: IEEE Symposium on Computational Intelligence and Data Mining
CIDM'11: IEEE Symposium on Computational Intelligence and Data Mining, Apr 2011, France. pp.112-119
CIDM'11: IEEE Symposium on Computational Intelligence and Data Mining
CIDM'11: IEEE Symposium on Computational Intelligence and Data Mining, Apr 2011, France. pp.112-119
International audience; With the important growth of requirements to analyze large amount of structured data such as chemical compounds, proteins structures, XML documents, to cite but a few, graph mining has become an attractive track and a real cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::299c7507db23f73cd5e235816facd36f
https://doi.org/10.1109/cidm.2011.5949436
https://doi.org/10.1109/cidm.2011.5949436