default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGemma C. Garriga
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[r2]Gemma C. Garriga:
Formal Concept Analysis. Encyclopedia of Machine Learning and Data Mining 2017: 522-523- 2016
- [e1]Bettina Berendt, Björn Bringmann, Élisa Fromont, Gemma C. Garriga, Pauli Miettinen
, Nikolaj Tatti, Volker Tresp:
Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part III. Lecture Notes in Computer Science 9853, Springer 2016, ISBN 978-3-319-46130-4 [contents] - 2013
- [b1]Gemma C. Garriga:
Formal Methods for Mining Structured Objects. Studies in Computational Intelligence 475, Springer 2013, ISBN 978-3-642-36680-2, pp. 1-100 - [j7]Gemma C. Garriga, Roni Khardon, Luc De Raedt:
Mining closed patterns in relational, graph and network data. Ann. Math. Artif. Intell. 69(4): 315-342 (2013) - [c21]Thomas Ricatte, Gemma C. Garriga, Rémi Gilleron, Marc Tommasi:
Learning from Multiple Graphs Using a Sigmoid Kernel. ICMLA (2) 2013: 140-145 - 2012
- [c20]Antonino Freno, Mikaela Keller, Gemma C. Garriga, Marc Tommasi:
Spectral Estimation of Conditional Random Graph Models for Large-Scale Network Data. UAI 2012: 265-274 - [i3]Antonino Freno, Mikaela Keller, Gemma C. Garriga, Marc Tommasi:
Spectral Estimation of Conditional Random Graph Models for Large-Scale Network Data. CoRR abs/1210.4860 (2012) - 2011
- [j6]Gemma C. Garriga, Esa Junttila, Heikki Mannila:
Banded structure in binary matrices. Knowl. Inf. Syst. 28(1): 197-226 (2011) - [c19]Jens Humrich, Thomas Gärtner, Gemma C. Garriga:
A Fixed Parameter Tractable Integer Program for Finding the Maximum Order Preserving Submatrix. ICDM 2011: 1098-1103 - 2010
- [j5]Markus Ojala, Gemma C. Garriga:
Permutation Tests for Studying Classifier Performance. J. Mach. Learn. Res. 11: 1833-1863 (2010) - [c18]Markus Ojala, Gemma C. Garriga, Aristides Gionis, Heikki Mannila:
Evaluating Query Result Significance in Databases via Randomizations. SDM 2010: 906-917 - [r1]Gemma C. Garriga:
Formal Concept Analysis. Encyclopedia of Machine Learning 2010: 416-418
2000 – 2009
- 2009
- [j4]Thomas Gärtner, Gemma C. Garriga:
Guest editors' introduction: special issue on mining and learning with graphs. Mach. Learn. 75(1): 1-2 (2009) - [c17]Markus Ojala, Gemma C. Garriga:
Permutation Tests for Studying Classifier Performance. ICDM 2009: 908-913 - [c16]Sami Hanhijärvi, Gemma C. Garriga, Kai Puolamäki:
Randomization Techniques for Graphs. SDM 2009: 780-791 - [i2]Markus Ojala, Gemma C. Garriga, Aristides Gionis, Heikki Mannila:
Query Significance in Databases via Randomizations. CoRR abs/0906.5485 (2009) - 2008
- [j3]Kai Puolamäki, Sami Hanhijärvi, Gemma C. Garriga:
An approximation ratio for biclustering. Inf. Process. Lett. 108(2): 45-49 (2008) - [j2]Gemma C. Garriga, Petra Kralj, Nada Lavrac:
Closed Sets for Labeled Data. J. Mach. Learn. Res. 9: 559-580 (2008) - [c15]Gemma C. Garriga, Antti Ukkonen, Heikki Mannila:
Feature Selection in Taxonomies with Applications to Paleontology. Discovery Science 2008: 112-123 - [c14]Gemma C. Garriga, Esa Junttila, Heikki Mannila:
Banded structure in binary matrices. KDD 2008: 292-300 - 2007
- [j1]José L. Balcázar, Gemma C. Garriga:
Horn axiomatizations for sequential data. Theor. Comput. Sci. 371(3): 247-264 (2007) - [c13]Thomas Gärtner, Gemma C. Garriga:
The Cost of Learning Directed Cuts. ECML 2007: 152-163 - [c12]José L. Balcázar, Gemma C. Garriga:
Characterizing Implications of Injective Partial Orders. ICCS 2007: 492-495 - [c11]Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Seppänen:
Cross-Mining Binary and Numerical Attributes. ICDM 2007: 481-486 - [c10]Gemma C. Garriga, Roni Khardon, Luc De Raedt:
On Mining Closed Sets in Multi-Relational Data. IJCAI 2007: 804-809 - [c9]Thomas Gärtner, Gemma C. Garriga:
The Cost of Learning Directed Cuts. MLG 2007 - [i1]Kai Puolamäki, Sami Hanhijärvi, Gemma C. Garriga:
An Approximation Ratio for Biclustering. CoRR abs/0712.2682 (2007) - 2006
- [c8]Gemma C. Garriga, Petra Kralj, Nada Lavrac:
Closed Sets for Labeled Data. PKDD 2006: 163-174 - 2005
- [c7]José L. Balcázar, Gemma Casas-Garriga:
On Horn Axiomatizations for Sequential Data. ICDT 2005: 215-229 - [c6]Gemma Casas-Garriga:
Summarizing Sequential Data with Closed Partial Orders. SDM 2005: 380-391 - 2004
- [c5]Gemma Casas-Garriga:
Statistical Strategies for Pruning All the Uninteresting Association Rules. ECAI 2004: 430-434 - [c4]Gemma Casas-Garriga, José L. Balcázar:
Coproduct Transformations on Lattices of Closed Partial Orders. ICGT 2004: 336-351 - 2003
- [c3]Jaume Baixeries, Gemma Casas-Garriga:
Sampling Strategies for Finding Frequent Sets. EGC 2003: 159-170 - [c2]Gemma Casas-Garriga:
Discovering Unbounded Episodes in Sequential Data. PKDD 2003: 83-94 - 2002
- [c1]Jaume Baixeries, Gemma Casas-Garriga, José L. Balcázar:
A Best-First Strategy for Finding Frequent Sets. EGC 2002: 101-106
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 2025-01-09 12:59 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:
