default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTao-Yuan Jen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c15]Inès Hilali, Tao-Yuan Jen, Dominique Laurent, Claudia Marinica
, Sadok Ben Yahia:
Mining Frequent and Homogeneous Closed Itemsets. ISIP 2014: 51-65- [c14]Tao-Yuan Jen, Claudia Marinica, Abir Ghariani:
Mining Frequent Itemsets with Vertical Data Layout in MapReduce. ISIP 2014: 66-82 - 2013
- [j3]Cheikh Tidiane Dieng, Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos:
Mining frequent conjunctive queries using functional and inclusion dependencies. VLDB J. 22(2): 125-150 (2013) - [c13]Inès Hilali, Tao-Yuan Jen, Dominique Laurent, Claudia Marinica, Sadok Ben Yahia:
Mining Interesting Disjunctive Association Rules from Unfrequent Items. ISIP 2013: 84-99 - 2012
- [c12]Inès Hilali-Jaghdam, Tao-Yuan Jen, Dominique Laurent, Sadok Ben Yahia:
Fouille de règles d'association généralisées à travers les disjonctions : Application aux données génomiques. EGC 2012: 237-242 - 2011
- [c11]Inès Hilali-Jaghdam, Tao-Yuan Jen, Dominique Laurent, Sadok Ben Yahia:
Mining Frequent Disjunctive Selection Queries. DEXA (2) 2011: 90-96 - 2010
- [j2]Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos:
Computing Supports of Conjunctive Queries on Relational Tables with Functional Dependencies. Fundam. Informaticae 99(3): 263-292 (2010) - [c10]Cheikh Tidiane Dieng, Tao-Yuan Jen, Dominique Laurent:
An Efficient Computation of Frequent Queries in a Star Schema. DEXA (2) 2010: 225-239
2000 – 2009
- 2009
- [c9]Tao-Yuan Jen, Dominique Laurent, Gorgoumack Sambe:
Utilisation de règles d'association pour la prédiction de valeurs manquantes. EDA 2009: 79-90 - [c8]Lucie Copin, Nicolas Pecheur, Anne Laurent, Yudi Augusta, Budi Sentana, Dominique Laurent, Tao-Yuan Jen:
DBFrequentQueries: Extraction de requêtes fréquentes. EGC 2009: 499 - [c7]Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos:
Mining frequent conjunctive queries in star schemas. IDEAS 2009: 97-108 - 2008
- [c6]Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos:
Mining all frequent projection-selection queries from a relational table. EDBT 2008: 368-379 - 2005
- [j1]Sylvie Irene Jami, Tao-Yuan Jen, Dominique Laurent, George Loizou, Oumar Sy:
Extraction de règles d'association pour la prédiction de valeurs manquantes. ARIMA J. 3: 6 (2005) - [c5]Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos, Oumar Sy:
Mining Frequent Queries in Star Schemes. EGC 2005: 331-342 - [c4]Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos, Oumar Sy:
Towards Mining Frequent Queries in Star Schemes. KDID 2005: 104-123 - 2004
- [c3]Tao-Yuan Jen, Rafik Taouil, Dominique Laurent:
A Dichotomous Algorithm for Association Rule Mining. DEXA Workshops 2004: 567-571 - [c2]Béatrice Bouchou, Ahmed Cheriat, Mirian Halfeld Ferrari Alves, Tao-Yuan Jen, Dominique Laurent:
XRM: An XML-Based Language for Rule Mining Systems. ICEIS (1) 2004: 441-446 - 2002
- [c1]Tao-Yuan Jen, Nicolas Spyratos, Yuzuru Tanaka:
Règles d'association significatives. BDA 2002
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-11-07 20:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
