default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafik Taouil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j4]Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme
, Lotfi Lakhal:
Generating a Condensed Representation for Association Rules. J. Intell. Inf. Syst. 24(1): 29-60 (2005)- 2002
- [j3]Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
Computing iceberg concept lattices with T. Data Knowl. Eng. 42(2): 189-222 (2002) - 2000
- [j2]Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal:
Mining Frequent Patterns with Counting Inference. SIGKDD Explor. 2(2): 66-75 (2000) - 1999
- [j1]Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
Efficient Mining of Association Rules Using Closed Itemset Lattices. Inf. Syst. 24(1): 25-46 (1999)
Conference and Workshop Papers
- 2018
- [c12]Rafik Taouil, Ilyass Belghannou:
Restructuring Iceberg Lattice For Multilevel Analysis. ICMCS 2018: 1-6 - 2004
- [c11]Tao-Yuan Jen, Rafik Taouil, Dominique Laurent:
A Dichotomous Algorithm for Association Rule Mining. DEXA Workshops 2004: 567-571 - 2001
- [c10]Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis. KI/ÖGAI 2001: 335-350 - 2000
- [c9]Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal:
Levelwise Search of Frequent Patterns with Counting Inference. BDA 2000 - [c8]Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal:
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. Computational Logic 2000: 972-986 - [c7]Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal:
Mining Bases for Association Rules Using Closed Sets. ICDE 2000: 307 - [c6]Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
Fast Computation of Concept lattices Using Data Mining Techniques. KRDB 2000: 129-139 - 1999
- [c5]Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
Closed Set Based Discovery of Small Covers for Association Rules. Proc. 15èmes Journées Bases de Données Avancées, BDA 1999: 361-381 - [c4]Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999: 398-416 - 1998
- [c3]Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
Pruning closed itemset lattices for associations rules. BDA 1998 - [c2]Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal:
Querying Concept Lattices in Object Databases. IADT 1998: 280-289 - 1997
- [c1]Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal:
Towards an Object Database Approach for Managing Concept Lattices. ER 1997: 299-312
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-04-24 22:57 CEST 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:
