default search action
Thi-Bich-Hanh Dao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Franck Anaël Mbiaya, Christel Vrain, Frédéric Ros, Thi-Bich-Hanh Dao, Yves Lucas:
Knowledge graph-based image classification. Data Knowl. Eng. 151: 102285 (2024) - [j9]Thi-Bich-Hanh Dao, Christel Vrain:
A review on declarative approaches for constrained clustering. Int. J. Approx. Reason. 171: 109135 (2024) - [i2]Mathieu Guilbert, Christel Vrain, Thi-Bich-Hanh Dao:
Towards Explainable Clustering: A Constrained Declarative based Approach. CoRR abs/2403.18101 (2024) - 2023
- [c34]Aymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni, Christel Vrain:
Incremental Constrained Clustering by Minimal Weighted Modification. CP 2023: 10:1-10:22 - [c33]Franck Anaël Mbiaya, Christel Vrain, Frédéric Ros, Thi-Bich-Hanh Dao, Yves Lucas:
KGIC : Intégration de graphe de connaissances pour la classification d'images. EGC 2023: 259-272 - [c32]Olivier Gracianne, Anaïs Halftermeyer, Thi-Bich-Hanh Dao:
Identifying relevant descriptors for tweet sets. ICTAI 2023: 263-268 - 2022
- [c31]Olivier Gracianne, Anaïs Halftermeyer, Thi-Bich-Hanh Dao:
Presenting an event through the description of related tweets clusters. ICTAI 2022: 1283-1290 - [c30]Mathieu Guilbert, Christel Vrain, Thi-Bich-Hanh Dao, Marcilio C. P. de Souto:
Anchored Constrained Clustering Ensemble. IJCNN 2022: 1-8 - [c29]Nguyen-Viet-Dung Nghiem, Christel Vrain, Thi-Bich-Hanh Dao:
Knowledge Integration in Deep Clustering. ECML/PKDD (1) 2022: 174-190 - 2020
- [c28]Nguyen-Viet-Dung Nghiem, Christel Vrain, Thi-Bich-Hanh Dao, Ian Davidson:
Constrained Clustering via Post-processing. DS 2020: 53-67 - [c27]Nguyen-Viet-Dung Nghiem, Christel Vrain, Thi-Bich-Hanh Dao, Ian Davidson:
Post-traitement pour la classification probabiliste non supervisée sous contraintes. EGC 2020: 169-180 - [p1]Pierre Gançarski, Thi-Bich-Hanh Dao, Bruno Crémilleux, Germain Forestier, Thomas Andrew Lampert:
Constrained Clustering: Current and New Trends. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 447-484
2010 – 2019
- 2019
- [j8]Thomas Andrew Lampert, Baptiste Lafabregue, Thi-Bich-Hanh Dao, Nicolas Serrette, Christel Vrain, Pierre Gançarski:
Constrained Distance-Based Clustering for Satellite Image Time-Series. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 12(11): 4606-4621 (2019) - 2018
- [b1]Thi-Bich-Hanh Dao:
Constraint Programming for Data Mining and for Natural Language Processing. University of Orléans, France, 2018 - [j7]Thomas Andrew Lampert, Thi-Bich-Hanh Dao, Baptiste Lafabregue, Nicolas Serrette, Germain Forestier, Bruno Crémilleux, Christel Vrain, Pierre Gançarski:
Constrained distance based clustering for time-series: a comparative and experimental study. Data Min. Knowl. Discov. 32(6): 1663-1707 (2018) - [c26]Thi-Bich-Hanh Dao, Chia-Tung Kuo, S. S. Ravi, Christel Vrain, Ian Davidson:
Descriptive Clustering: ILP and CP Formulations with Applications. IJCAI 2018: 1263-1269 - 2017
- [j6]Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
Constrained clustering by constraint programming. Artif. Intell. 244: 70-94 (2017) - [c25]Chia-Tung Kuo, S. S. Ravi, Thi-Bich-Hanh Dao, Christel Vrain, Ian Davidson:
A Framework for Minimal Clustering Modification via Constraint Programming. AAAI 2017: 1389-1395 - 2016
- [c24]Thi-Bich-Hanh Dao, Christel Vrain, Khanh-Chuong Duong, Ian Davidson:
A Framework for Actionable Clustering Using Constraint Programming. ECAI 2016: 453-461 - [c23]Tias Guns, Thi-Bich-Hanh Dao, Christel Vrain, Khanh-Chuong Duong:
Repetitive Branch-and-Bound Using Constraint Programming for Constrained Minimum Sum-of-Squares Clustering. ECAI 2016: 462-470 - 2015
- [c22]Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
Constrained Minimum Sum of Squares Clustering by Constraint Programming. CP 2015: 557-573 - 2014
- [j5]Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier:
Model-theory and implementation of property grammars with features. J. Log. Comput. 24(2): 491-509 (2014) - [j4]Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
Un nouveau modèle pour la classification non supervisée sous contraintes. Rev. d'Intelligence Artif. 28(5): 523-545 (2014) - 2013
- [c21]Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
Une approche en programmation par contraintes pour la classification non supervisée. EGC 2013: 55-66 - [c20]Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
A Filtering Algorithm for Constrained Clustering with Within-Cluster Sum of Dissimilarities Criterion. ICTAI 2013: 1060-1067 - [c19]Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
A Declarative Framework for Constrained Clustering. ECML/PKDD (3) 2013: 419-434 - 2011
- [c18]Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier:
Model-Theory of Property Grammars with Features. IWPT 2011: 75-79 - [c17]Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat:
Characterizing Conclusive Approximations by Logical Formulae. RP 2011: 72-84 - 2010
- [c16]Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier, Willy Lesaint:
Property Grammar Parsing Seen as a Constraint Optimization Problem. FG 2010: 82-96
2000 – 2009
- 2009
- [c15]Denys Duchier, Jean-Philippe Prost, Thi-Bich-Hanh Dao:
A Model-Theoretic Framework for Grammaticality Judgements. FG 2009: 17-30 - 2008
- [j3]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth:
Theory of finite or infinite trees revisited. Theory Pract. Log. Program. 8(4): 431-489 (2008) - 2007
- [c14]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth:
Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees. SAC 2007: 58-64 - [i1]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth:
Theory of Finite or Infinite Trees Revisited. CoRR abs/0706.4323 (2007) - 2006
- [c13]Khalil Djelloul, Thi-Bich-Hanh Dao:
Extension of First-Order Theories into Trees. AISC 2006: 53-67 - [c12]Thi-Bich-Hanh Dao, Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees. CSCLP 2006: 108-123 - [c11]Thi-Bich-Hanh Dao, Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees. ICLP 2006: 423-424 - [c10]Khalil Djelloul, Thi-Bich-Hanh Dao:
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories. SAC 2006: 7-14 - [c9]Khalil Djelloul, Thi-Bich-Hanh Dao:
Complete First-Order Axiomatization of Finite or Infinite M-extended Trees. WLP 2006: 111-119 - 2003
- [j2]Alain Colmerauer, Thi-Bich-Hanh Dao:
Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees. Constraints An Int. J. 8(3): 283-302 (2003) - [j1]AbdelAli Ed-Dbali, Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko:
Apprentissage de solveurs de contraintes sur les domaines finis. Tech. Sci. Informatiques 22(1): 125-138 (2003) - [c8]Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Intermediate (Learned) Consistencies. CP 2003: 889-893 - [c7]Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Learning Approximate Consistencies. CSCLP 2003: 87-106 - [c6]Arnaud Lallouet, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Language, Definition and Optimal Computation of CSP Approximations. FLAIRS 2003: 182-186 - [c5]Arnaud Lallouet, Thi-Bich-Hanh Dao, Andrei Legtchenko, AbdelAli Ed-Dbali:
Finite Domain Constraint Solver Learning. IJCAI 2003: 1379-1380 - [c4]Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
Apprentissage de solveurs de contraintes sur les domaines finis. JFPLC 2003: 125-138 - 2002
- [c3]Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin:
Indexical-Based Solver Learning. CP 2002: 541-555 - 2000
- [c2]Alain Colmerauer, Thi-Bich-Hanh Dao:
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees. CP 2000: 172-186 - [c1]Thi-Bich-Hanh Dao:
Résolution de contraintes du premier ordre dans la théorie des arbres finis ou infinis. JFPLC 2000: 225-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint