default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLotfi Lakhal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Youssef Hmamouche, Lotfi Lakhal, Alain Casali:
A scalable framework for large time series prediction. Knowl. Inf. Syst. 63(5): 1093-1116 (2021)
2010 – 2019
- 2019
- [c54]Hana Alouaoui, Lotfi Lakhal, Rosine Cicchetti, Alain Casali:
CoSky: A Practical Method for Ranking Skylines in Databases. KDIR 2019: 508-515 - 2018
- [c53]Youssef Hmamouche, Lotfi Lakhal, Alain Casali:
Predictors Extraction in Time Series Using Authorities-Hubs Ranking. ICDM Workshops 2018: 1070-1079 - 2017
- [j16]Lotfi Lakhal, Sébastien Nedjar, Rosine Cicchetti:
Multidimensional skyline analysis based on agree concept lattices. Intell. Data Anal. 21(5): 1245-1265 (2017) - [c52]Piotr Przymus
, Youssef Hmamouche, Alain Casali, Lotfi Lakhal:
Improving Multivariate Time Series Forecasting with Random Walks with Restarts on Causality Graphs. ICDM Workshops 2017: 924-931 - [c51]Youssef Hmamouche, Piotr Przymus, Lotfi Lakhal, Alain Casali:
Finding Relevant Multivariate Models for Multi-plant Photovoltaic Energy Forecasting. DC@PKDD/ECML 2017 - 2013
- [p3]Sébastien Nedjar, Lotfi Lakhal, Rosine Cicchetti:
Emerging Data Cube Representations for OLAP Database Mining. Contrast Data Mining 2013: 109-128 - 2012
- [j15]Ghada Gasmi, Lotfi Lakhal, Yahya Slimani:
An incremental approach for maintaining functional dependencies. Intell. Data Anal. 16(3): 365-381 (2012) - 2011
- [j14]Sébastien Nedjar, Rosine Cicchetti, Lotfi Lakhal:
Extracting semantics in OLAP databases using emerging cubes. Inf. Sci. 181(10): 2036-2059 (2011) - [c50]Ghada Gasmi, Amira Béji, Yahya Slimani, Lotfi Lakhal:
Functional Dependency Mining: Harnessing Multicore Systems. ACIS-ICIS 2011: 135-139 - [c49]Sébastien Nedjar, Fabien Pesci, Lotfi Lakhal, Rosine Cicchetti:
Treillis des Concepts Skylines : analyse multidimensionnelle des Skylines fondée sur les ensembles en accords. EGC 2011: 227-238 - [c48]Sébastien Nedjar, Fabien Pesci, Lotfi Lakhal, Rosine Cicchetti:
The Agree Concept Lattice for Multidimensional Database Analysis. ICFCA 2011: 219-234 - [c47]Ghada Gasmi, Yahya Slimani, Lotfi Lakhal:
Towards a Parallel Approach for Incremental Mining of Functional Dependencies on Multi-core Systems. KES (1) 2011: 590-598 - [p2]Rosine Cicchetti, Lotfi Lakhal, Sébastien Nedjar, Noël Novelli, Alain Casali:
Summarizing Datacubes: Semantic and Syntactic Approaches. Integrations of Data Warehousing, Data Mining and Database Technologies 2011: 19-39 - 2010
- [j13]Alain Casali, Sébastien Nedjar, Rosine Cicchetti, Lotfi Lakhal:
Constrained Cube Lattices for Multidimensional Database Mining. Int. J. Data Warehous. Min. 6(3): 43-72 (2010) - [c46]Rosine Cicchetti, Lotfi Lakhal, Sébastien Nedjar:
Constrained Closed and Quotient Cubes. EGC (best of volume) 2010: 3-26 - [c45]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Cube fermés / quotients emergents. EGC 2010: 285-296 - [c44]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Constrained Closed Datacubes. ICFCA 2010: 177-192 - [i2]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Cubes convexes. CoRR abs/1003.5056 (2010) - [i1]Sébastien Nedjar, Fabien Pesci, Lotfi Lakhal, Rosine Cicchetti:
Treillis des concepts skylines : Analyse multidimensionnelle des skylines fondée sur les ensembles en accord. CoRR abs/1010.4850 (2010)
2000 – 2009
- 2009
- [j12]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Reduced representations of Emerging Cubes for OLAP database mining. Int. J. Bus. Intell. Data Min. 4(3/4): 267-300 (2009) - [j11]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Emerging Cubes: Borders, size estimations and lossless reductions. Inf. Syst. 34(6): 536-550 (2009) - [j10]Alain Casali, Sébastien Nedjar, Rosine Cicchetti, Lotfi Lakhal, Noël Novelli:
Lossless Reduction of Datacubes using Partitions. Int. J. Data Warehous. Min. 5(1): 18-35 (2009) - [p1]Alain Casali, Sébastien Nedjar, Rosine Cicchetti, Lotfi Lakhal:
Closed Cube Lattices. New Trends in Data Warehousing and Data Analysis 2009: 1-20 - 2008
- [c43]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Upper Borders for Emerging Cubes. DaWaK 2008: 45-54 - 2007
- [c42]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Résumés du Cube Emergent. BDA 2007 - [c41]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Emerging Cubes for Trends Analysis in OlapDatabases. DaWaK 2007: 135-144 - [c40]Alain Casali, Sébastien Nedjar, Rosine Cicchetti, Lotfi Lakhal:
Convex Cube: Towards a Unified Structure for Multidimensional Databases. DEXA 2007: 572-581 - 2006
- [j9]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Cubes convexes. Ingénierie des Systèmes d Inf. 11(6): 11-31 (2006) - [c39]Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Cocktail de Cubes. BDA 2006 - [c38]Alain Casali, Rosine Cicchetti, Lotfi Lakhal, Noël Novelli:
Lossless Reduction of Datacubes. DEXA 2006: 409-419 - 2005
- [j8]Alain Casali, Rosine Cicchetti, Lotfi Lakhal, Stéphane Lopes:
Couvertures parfaites des motifs fréquents. Ingénierie des Systèmes d Inf. 10(2): 117-138 (2005) - [j7]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) - [c37]Alain Casali, Rosine Cicchetti, Lotfi Lakhal, Noël Novelli:
Réduction du cube de données. BDA 2005 - [c36]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Essential Patterns: A Perfect Cover of Frequent Patterns. DaWaK 2005: 428-437 - [c35]Lotfi Lakhal, Gerd Stumme:
Efficient Mining of Association Rules Based on Formal Concept Analysis. Formal Concept Analysis 2005: 180-195 - 2004
- [j6]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Extraction de sémantiques dans les bases de données multidimensionnelles. Ingénierie des Systèmes d Inf. 9(1): 35-59 (2004) - [c34]Alain Casali, Rosine Cicchetti, Lotfi Lakhal, Stéphane Lopes:
Motifs essentiels et inférence des fréquences. BDA 2004: 535-554 - 2003
- [j5]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Treillis cubes contraints pour la fouille de bases de données multidimensionnelles. Tech. Sci. Informatiques 22(10): 1325-1352 (2003) - [c33]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Extraction de sémantiques dans les bases de données multidimensionnelles. BDA 2003 - [c32]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Extraction d'espaces de versions émergents d'une relation d'attributs catégories. EGC 2003: 57-69 - [c31]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Extracting semantics from data cubes using cube transversals and closures. KDD 2003: 69-78 - [c30]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Cube Lattices: A Framework for Multidimensional Data Mining. SDM 2003: 304-308 - 2002
- [j4]Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
Computing iceberg concept lattices with T. Data Knowl. Eng. 42(2): 189-222 (2002) - [j3]Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal:
Functional and approximate dependency mining: database and FCA points of view. J. Exp. Theor. Artif. Intell. 14(2-3): 93-114 (2002) - [c29]Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
Treillis Relationnel : Une Structure Algébrique pour le Data Mining Multi-Dimensionnel. BDA 2002 - [c28]Marc Laporte, Noël Novelli, Rosine Cicchetti, Lotfi Lakhal:
Computing Full and Iceberg Datacubes Using Partitions. ISMIS 2002: 244-254 - 2001
- [c27]Rosine Cicchetti, Noël Novelli, Lotfi Lakhal:
APIC: An Efficient Algorithm for Computing Iceberg Datacubes. BDA 2001 - [c26]Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal:
A Framework for Understanding Existing Databases. IDEAS 2001: 330-338 - [c25]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
- [j2]Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal:
Mining Frequent Patterns with Counting Inference. SIGKDD Explor. 2(2): 66-75 (2000) - [c24]Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal:
Levelwise Search of Frequent Patterns with Counting Inference. BDA 2000 - [c23]Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal:
Discovering Agree Sets for Database Relation Analysis. BDA 2000 - [c22]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 - [c21]Kitsana Waiyamai, Lotfi Lakhal:
Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices. ECML 2000: 437-445 - [c20]Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal:
Efficient Discovery of Functional Dependencies and Armstrong Relations. EDBT 2000: 350-364 - [c19]Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal:
Mining Bases for Association Rules Using Closed Sets. ICDE 2000: 307 - [c18]Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
Fast Computation of Concept lattices Using Data Mining Techniques. KRDB 2000: 129-139
1990 – 1999
- 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) - [c17]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 - [c16]Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999: 398-416 - 1998
- [c15]Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
Pruning closed itemset lattices for associations rules. BDA 1998 - [c14]Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal:
Querying Concept Lattices in Object Databases. IADT 1998: 280-289 - 1997
- [c13]A. Yahia, Lotfi Lakhal, Jean-Pierre Bordat:
Designing Class Hierarchies of Object Database Schemas. BDA 1997 - [c12]Mohammed Benattou, Lotfi Lakhal:
Incremental Inheritance Model for an OODBMS. DEXA 1997: 68-80 - [c11]Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal:
Towards an Object Database Approach for Managing Concept Lattices. ER 1997: 299-312 - 1996
- [c10]A. Yahia, Lotfi Lakhal, Rosine Cicchetti:
Building Inheritance Graphs in Object Database Design. DEXA 1996: 11-28 - [c9]A. Yahia, Lotfi Lakhal, Rosine Cicchetti, Jean-Pierre Bordat:
iO2 - An Algorithmic Method for Building Inheritance Graphs in Object Database Design. ER 1996: 422-437 - 1994
- [c8]Rosine Cicchetti, Lotfi Lakhal:
Matrix-Relation for Statistical Database Management. EDBT 1994: 31-44 - 1993
- [c7]Pascal Poncelet, Lotfi Lakhal:
Consistent Structural Updates for Object Database Design. CAiSE 1993: 1-21 - [c6]Pascal Poncelet, Maguelonne Teisseire, Rosine Cicchetti, Lotfi Lakhal:
Towards a Formal Approach for Object Database Design. VLDB 1993: 278-289 - 1992
- [c5]Pascal Poncelet, Maguelonne Teisseire, Lotfi Lakhal:
IFO2, modèle et principe pour la conception de bases de données avancées. BDA 1992: 320-
1980 – 1989
- 1989
- [c4]Rosine Cicchetti, Lotfi Lakhal, Nanh Le Thanh, Serge Miranda:
A Logical Summary-Data Model for Macro Statistical Databases. DASFAA 1989: 43-51 - [c3]Lotfi Lakhal, Rosine Cicchetti, Serge Miranda:
Complex-Statistical-Table Structure and Operators for Macro Statistical Databases. FODO 1989: 421-438 - [c2]Lotfi Lakhal, Rosine Cicchetti, Serge Miranda:
RTL - A Relation and Table Language for Statistical Databases. MFDBS 1989: 285-300 - 1987
- [c1]G. Taladoire, Serge Miranda, Nanh Le Thanh, Lotfi Lakhal:
SQL-U: A Casual-User Oriented Interface for a Relational DBMS on Micro-Computers. HCI (2) 1987: 155-166
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:33 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:
