default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLoïc Cerf
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Victor Henrique Silva Ribeiro
, Loïc Cerf:
Summarizing Fuzzy Tensors with Sub-Tensors. SAC 2023: 362-364- [c18]Loïc Cerf:
Enforcement of Minimal Size and Area Constraints before and while Mining Patterns in Fuzzy Tensors. SAC 2023: 369-376 - 2022
- [j9]Bernardo A. Abreu, João Paulo Ataide Martins, Loïc Cerf:
Developing Biceps to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices. Data Min. Knowl. Discov. 36(4): 1451-1497 (2022) - 2020
- [j8]Lucas Maciel, Jônatas Alves, Vinícius Fernandes dos Santos, Loïc Cerf:
Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors. Int. J. Comput. Intell. Syst. 13(1): 1036-1047 (2020)
2010 – 2019
- 2019
- [j7]Nicolas Nadisic, Aurélien Coussat, Loïc Cerf:
Mining skypatterns in fuzzy tensors. Data Min. Knowl. Discov. 33(5): 1298-1322 (2019) - [c17]Lucas José Carneiro Maciel, Jônatas Alves, Vinícius Fernandes dos Santos, Loïc Cerf:
Bigfoot Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors. EUSFLAT Conf. 2019 - 2018
- [c16]Aurélien Coussat, Nicolas Nadisic, Loïc Cerf:
Mining High-Utility Patterns in Uncertain Tensors. KES 2018: 403-412 - 2014
- [c15]Renê Rodrigues Veloso, Loïc Cerf, Wagner Meira Jr., Mohammed J. Zaki:
Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach. EDBT 2014: 511-522 - [c14]Loïc Cerf, Wagner Meira Jr.:
Complete discovery of high-quality patterns in large numerical tensors. ICDE 2014: 448-459 - [c13]Gustavo Nascimento, Manoel Horta Ribeiro, Loïc Cerf, Natalia Cesario, Mehdi Kaytoue, Chedy Raïssi, Thiago Vasconcelos, Wagner Meira Jr.:
Modeling and Analyzing the Video Game Live-Streaming Community. LA-WEB 2014: 1-9 - [c12]Gabriel Poesia, Loïc Cerf:
A Lossless Data Reduction for Mining Constrained Patterns in n-ary Relations. ECML/PKDD (2) 2014: 581-596 - 2013
- [j6]Loïc Cerf, Jérémy Besson, Kim-Ngan Nguyen, Jean-François Boulicaut:
Closed and noise-tolerant patterns in n-ary relations. Data Min. Knowl. Discov. 26(3): 574-619 (2013) - [j5]Loïc Cerf, Dominique Gay, Nazha Selmaoui-Folcher, Bruno Crémilleux, Jean-François Boulicaut:
Parameter-free classification in multi-class imbalanced data sets. Data Knowl. Eng. 87: 109-129 (2013) - [j4]Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, Jean-François Boulicaut:
Discovering descriptive rules in relational dynamic graphs. Intell. Data Anal. 17(1): 49-69 (2013) - [j3]Israel Guerra, Loïc Cerf, João Foscarini, Michel Boaventura, Wagner Meira Jr.:
Constraint-Based Search of Straddling Biclusters and Discriminative Patterns. J. Inf. Data Manag. 4(2): 114-123 (2013) - [c11]Loïc Cerf, João Foscarini, Israel Guerra, Michel Boaventura, Wagner Meira Jr.:
Constraint-Based Search of Different Kinds of Discriminative Patterns. FLAIRS 2013 - 2012
- [c10]Israel Guerra, Loïc Cerf, João Foscarini, Michel Boaventura, Wagner Meira Jr.:
Descoberta de n-conjuntos Fechados Eficiente e Restrita a Grupos de Interesse. SBBD (Short Papers) 2012: 248-255 - [c9]Mehdi Kaytoue, Arlei Silva, Loïc Cerf, Wagner Meira Jr., Chedy Raïssi:
Watch me playing, i am a professional: a first study on video game live streaming. WWW (Companion Volume) 2012: 1181-1188 - 2011
- [j2]Pedro Henrique Calais Guerra, Loïc Cerf, Thiago C. Porto, Adriano Veloso, Wagner Meira Jr., Virgílio A. F. Almeida:
Exploiting Temporal Locality to Determine User Bias in Microblogging Platforms. J. Inf. Data Manag. 2(3): 273-288 (2011) - [c8]Renê Rodrigues Veloso, Loïc Cerf, Chedy Raïssi, Wagner Meira Jr.:
Distributed Skycube Computation with Anthill. SBAC-PAD 2011: 33-40 - [c7]Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, Jean-François Boulicaut:
Multidimensional Association Rules in Boolean Tensors. SDM 2011: 570-581 - 2010
- [b1]Loïc Cerf:
Constraint-Based Mining of Closed Patterns in Noisy n-ary Relations. (Fouille Sous Contraintes de Motifs Fermés dans des Relations n-aires Bruitées). INSA de Lyon, Lyon - Villeurbanne, France, 2010 - [c6]Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, Jean-François Boulicaut:
Discovering Inter-Dimensional Rules in Dynamic Graphs. NyNaK 2010 - [p1]Loïc Cerf, Tran Bao Nhan Nguyen, Jean-François Boulicaut:
Mining Constrained Cross-Graph Cliques in Dynamic Networks. Inductive Databases and Constraint-Based Data Mining 2010: 199-228
2000 – 2009
- 2009
- [j1]Loïc Cerf, Jérémy Besson, Céline Robardet, Jean-François Boulicaut:
Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data 3(1): 3:1-3:36 (2009) - [c5]Loïc Cerf, Pierre-Nicolas Mougel, Jean-François Boulicaut:
Agglomerating local patterns hierarchically with ALPHA. CIKM 2009: 1753-1756 - [c4]Loïc Cerf, Jérémy Besson, Jean-François Boulicaut:
Extraction de motifs fermés dans des relations n-aires bruitées. EGC 2009: 163-168 - [c3]Loïc Cerf, Tran Bao Nhan Nguyen, Jean-François Boulicaut:
Discovering Relevant Cross-Graph Cliques in Dynamic Networks. ISMIS 2009: 513-522 - 2008
- [c2]Loïc Cerf, Dominique Gay, Nazha Selmaoui, Jean-François Boulicaut:
A Parameter-Free Associative Classification Method. DaWaK 2008: 293-304 - [c1]Loïc Cerf, Jérémy Besson, Céline Robardet, Jean-François Boulicaut:
Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations. SDM 2008: 37-48
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 21:32 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:
