default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsther Galbrun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Maiju Karjalainen
, Esther Galbrun, Pauli Miettinen:
Fast Redescription Mining Using Locality-Sensitive Hashing. ECML/PKDD (7) 2024: 124-142- [i6]Maiju Karjalainen, Esther Galbrun, Pauli Miettinen:
Fast Redescription Mining Using Locality-Sensitive Hashing. CoRR abs/2406.04148 (2024) - 2022
- [j12]Esther Galbrun:
The minimum description length principle for pattern mining: a survey. Data Min. Knowl. Discov. 36(5): 1679-1727 (2022) - [j11]Antonis Matakos, Çigdem Aslay, Esther Galbrun, Aristides Gionis:
Maximizing the Diversity of Exposure in a Social Network. IEEE Trans. Knowl. Data Eng. 34(9): 4357-4370 (2022) - [c16]Maiju Karjalainen, Esther Galbrun, Pauli Miettinen:
Serenade: An Approach for Differentially Private Greedy Redescription Mining. KDID 2022: 31-46 - 2021
- [j10]Esther Galbrun, Hui Tang, Anu Kaakinen, Indre Zliobaite:
Redescription mining for analyzing local limiting conditions: A case study on the biogeography of large mammals in China and southern Asia. Ecol. Informatics 63: 101314 (2021) - [c15]Erwan Bourrand, Luis Galárraga, Esther Galbrun, Élisa Fromont, Alexandre Termier:
Discovering Useful Compact Sets of Sequential Rules in a Long Sequence. ICTAI 2021: 1295-1299 - [i5]Erwan Bourrand, Luis Galárraga, Esther Galbrun, Élisa Fromont, Alexandre Termier:
Discovering Useful Compact Sets of Sequential Rules in a Long Sequence. CoRR abs/2109.07519 (2021) - 2020
- [i4]Esther Galbrun:
The Minimum Description Length Principle for Pattern Mining: A Survey. CoRR abs/2007.14009 (2020)
2010 – 2019
- 2018
- [j9]Janis Kalofolias, Esther Galbrun, Pauli Miettinen:
From sets of good redescriptions to good sets of redescriptions. Knowl. Inf. Syst. 57(1): 21-54 (2018) - [j8]Esther Galbrun, Pauli Miettinen:
Mining Redescriptions with Siren. ACM Trans. Knowl. Discov. Data 12(1): 6:1-6:30 (2018) - [c14]Justine Reynaud, Esther Galbrun, Mehwish Alam, Yannick Toussaint, Amedeo Napoli:
Définir les catégories de DBpédia avec des règles d'associations et des redescriptions. EGC 2018: 335-340 - [c13]Çigdem Aslay, Antonis Matakos, Esther Galbrun, Aristides Gionis:
Maximizing the Diversity of Exposure in a Social Network. ICDM 2018: 863-868 - [c12]Esther Galbrun, Peggy Cellier, Nikolaj Tatti, Alexandre Termier, Bruno Crémilleux:
Mining Periodic Patterns with a MDL Criterion. ECML/PKDD (2) 2018: 535-551 - [i3]Esther Galbrun, Peggy Cellier, Nikolaj Tatti, Alexandre Termier, Bruno Crémilleux:
Mining Periodic Patterns with a MDL Criterion. CoRR abs/1807.01706 (2018) - [i2]Çigdem Aslay, Antonis Matakos, Esther Galbrun, Aristides Gionis:
Maximizing the Diversity of Exposure in a Social Network. CoRR abs/1809.04393 (2018) - 2017
- [b2]Esther Galbrun, Pauli Miettinen:
Redescription Mining. Springer Briefs in Computer Science, Springer 2017, ISBN 978-3-319-72888-9, pp. 1-80 - [j7]Esther Galbrun, Pauli Miettinen:
Redescription Mining: An Overview. IEEE Intell. Informatics Bull. 18(2): 7-12 (2017) - [c11]Esther Galbrun, Behzad Golshan, Aristides Gionis, Evimaria Terzi:
Finding low-tension communities. SDM 2017: 336-344 - [i1]Esther Galbrun, Behzad Golshan, Aristides Gionis, Evimaria Terzi:
Finding low-tension communities. CoRR abs/1701.05352 (2017) - 2016
- [j6]Esther Galbrun, Aristides Gionis, Nikolaj Tatti:
Top-k overlapping densest subgraphs. Data Min. Knowl. Discov. 30(5): 1134-1165 (2016) - [j5]Esther Galbrun, Konstantinos Pelechrinis, Evimaria Terzi:
Urban navigation beyond shortest route: The case of safe paths. Inf. Syst. 57: 160-171 (2016) - [c10]Matthijs van Leeuwen, Esther Galbrun:
Association discovery in two-view data. ICDE 2016: 1480-1481 - [c9]Janis Kalofolias, Esther Galbrun, Pauli Miettinen:
From Sets of Good Redescriptions to Good Sets of Redescriptions. ICDM 2016: 211-220 - [c8]Esther Galbrun, Pauli Miettinen:
Analysing Political Opinions Using Redescription Mining. ICDM Workshops 2016: 422-427 - 2015
- [j4]Matthijs van Leeuwen, Esther Galbrun:
Association Discovery in Two-View Data. IEEE Trans. Knowl. Data Eng. 27(12): 3190-3202 (2015) - [c7]Tetiana Zinchenko, Esther Galbrun, Pauli Miettinen:
Mining Predictive Redescriptions with Trees. ICDM Workshops 2015: 1672-1675 - 2014
- [j3]Esther Galbrun, Aristides Gionis, Nikolaj Tatti:
Overlapping community detection in labeled graphs. Data Min. Knowl. Discov. 28(5-6): 1586-1610 (2014) - [j2]Esther Galbrun, Angelika Kimmig:
Finding relational redescriptions. Mach. Learn. 96(3): 225-248 (2014) - [c6]Esther Galbrun, Pauli Miettinen:
Interactive redescription mining. SIGMOD Conference 2014: 1079-1082 - 2013
- [b1]Esther Galbrun:
Methods for Redescription Mining. (Menetelmiä jälleenkuvausten louhintaan / Méthodes pour la fouille de redescriptions). University of Helsinki, Finland, 2013 - [c5]Vidit Jain, Esther Galbrun:
Topical organization of user comments and application to content recommendation. WWW (Companion Volume) 2013: 61-62 - 2012
- [j1]Esther Galbrun, Pauli Miettinen:
From black and white to full color: extending redescription mining outside the Boolean world. Stat. Anal. Data Min. 5(4): 284-303 (2012) - [c4]Esther Galbrun, Angelika Kimmig:
Towards Finding Relational Redescriptions. Discovery Science 2012: 52-66 - [c3]Esther Galbrun, Pauli Miettinen:
Siren: an interactive tool for mining and visualizing geospatial redescriptions. KDD 2012: 1544-1547 - [p1]Angelika Kimmig, Esther Galbrun, Hannu Toivonen, Luc De Raedt:
Patterns and Logic for Reasoning with Networks. Bisociative Knowledge Discovery 2012: 122-143 - 2011
- [c2]Esther Galbrun, Pauli Miettinen:
From Black and White to Full Colour: Extending Redescription Mining Outside the Boolean World. SDM 2011: 546-557
2000 – 2009
- 2009
- [c1]Sándor Szedmák, Esther Galbrun, Craig Saunders, Yizhao Ni:
Large scale maximum margin regression based, structural learning approach to phrase translations. SMART@EAMT 2009
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:57 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:
