Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Michel Liquière"'
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:
Applied Artificial Intelligence. 17:399-417
This article presents a new approach for structural rule extraction and knowledge discovery by means of Structural Galois Lattice and genetic algorithms. The approach synthesizes symbolic learning in feature extraction as a pre-processing and a subsy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::205bd1d625188b96bda2caedbdfba3fb
https://doi.org/10.1080/713827174
https://doi.org/10.1080/713827174
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 14:75-79
(2002). Concept lattice-based knowledge discovery in databases. Journal of Experimental & Theoretical Artificial Intelligence: Vol. 14, No. 2-3, pp. 75-79.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::213d3347881d7328b49ef443ce7e82a1
https://doi.org/10.1080/095281302320898361
https://doi.org/10.1080/095281302320898361
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
Autor:
Marc Ricordeau, Michel Liquière
Publikováno v:
ICHSA'06: International Conference on Hybrid Systems and Applications
ICHSA'06: International Conference on Hybrid Systems and Applications, Lafayette, LA, USA, pp.N/A
ICHSA'06: International Conference on Hybrid Systems and Applications, Lafayette, LA, USA, pp.N/A
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a set of examples or searching for regularities is a problem which has alr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da0b475071f8f9133556becf588aacef
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00378912
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00378912
Autor:
Michel Liquière
Publikováno v:
Conceptual Structures: Knowledge Architectures for Smart Applications ISBN: 9783540736806
ICCS
15th International Conference on Conceptual Structures
ICCS: International Conference on Conceptual Structures
ICCS: International Conference on Conceptual Structures, Jul 2007, Sheffield, United Kingdom. pp.333-346, ⟨10.1007/978-3-540-73681-3_25⟩
ICCS
15th International Conference on Conceptual Structures
ICCS: International Conference on Conceptual Structures
ICCS: International Conference on Conceptual Structures, Jul 2007, Sheffield, United Kingdom. pp.333-346, ⟨10.1007/978-3-540-73681-3_25⟩
International audience; The projection problem (conceptual graph projection, homomorphism, injective morphism, θ-subsumption, OI-subsumption) is crucial to the efficiency of relational learning systems. How to manage this complexity has motivated nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a281141899f30c16601bdc6cb0ae15f
https://doi.org/10.1007/978-3-540-73681-3_25
https://doi.org/10.1007/978-3-540-73681-3_25
Autor:
Michel Liquière
Publikováno v:
Mining Graph Data
Cook, Diane J. / Holder, Lawrence B. Mining Graph Data, John Wiley & Sons, pp.227-252, 2006, ISBN-10: 0471731900 ISBN-13: 978-0471731900
Cook, Diane J. / Holder, Lawrence B. Mining Graph Data, John Wiley & Sons, pp.227-252, 2006, ISBN-10: 0471731900 ISBN-13: 978-0471731900
en pdf pre-version du papier; International audience; This chapter presents a formal model to learning from examples represented by labelled graphs. This formal model is based upon lattice theory and in particular Galois lattices. We widen the domain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9d95e7379f17e158cbc2ac9b2f57000
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00137035
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00137035
Publikováno v:
n.d.
pp.200, 2004
HAL
pp.200, 2004
HAL
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b12d1ef46051d9823adfdab64998bb55
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00109163
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00109163