default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartino Ciaperoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Martino Ciaperoni:
Efficient and trustworthy methods for knowledge discovery. Aalto University, Espoo, Finland, 2023
Journal Articles
- 2024
- [j3]Martino Ciaperoni, Aristides Gionis, Heikki Mannila:
The Hadamard decomposition problem. Data Min. Knowl. Discov. 38(4): 2306-2347 (2024) - 2023
- [j2]Martino Ciaperoni, Han Xiao, Aristides Gionis:
Concise and interpretable multi-label rule sets. Knowl. Inf. Syst. 65(12): 5657-5694 (2023) - 2021
- [j1]Edoardo Galimberti, Martino Ciaperoni, Alain Barrat, Francesco Bonchi, Ciro Cattuto, Francesco Gullo:
Span-core Decomposition for Temporal Networks: Algorithms and Applications. ACM Trans. Knowl. Discov. Data 15(1): 2:1-2:44 (2021)
Conference and Workshop Papers
- 2024
- [c5]Martino Ciaperoni
, Han Xiao, Aristides Gionis:
Efficient Exploration of the Rashomon Set of Rule-Set Models. KDD 2024: 478-489 - 2022
- [c4]Martino Ciaperoni, Çigdem Aslay, Aristides Gionis, Michael Mathioudakis:
Workload-Aware Materialization of Junction Trees. EDBT 2022: 1:65-1:77 - [c3]Martino Ciaperoni, Han Xiao, Aristides Gionis:
Concise and interpretable multi-label rule sets. ICDM 2022: 71-80 - [c2]Martino Ciaperoni, Aristides Gionis, Athanasios Katsamanis, Panagiotis Karras:
SIEVE: A Space-Efficient Algorithm for Viterbi Decoding. SIGMOD Conference 2022: 1136-1145 - 2021
- [c1]Çigdem Aslay, Martino Ciaperoni, Aristides Gionis, Michael Mathioudakis:
Workload-aware Materialization for Efficient Variable Elimination on Bayesian Networks. ICDE 2021: 1152-1163
Informal and Other Publications
- 2024
- [i4]Martino Ciaperoni, Han Xiao, Aristides Gionis:
Efficient Exploration of the Rashomon Set of Rule Set Models. CoRR abs/2406.03059 (2024) - 2022
- [i3]Martino Ciaperoni, Han Xiao, Aristides Gionis:
Concise and interpretable multi-label rule sets. CoRR abs/2210.01533 (2022) - 2021
- [i2]Martino Ciaperoni, Çigdem Aslay, Aristides Gionis, Michael Mathioudakis:
Workload-Aware Materialization of Junction Trees. CoRR abs/2110.03475 (2021) - 2019
- [i1]Edoardo Galimberti, Martino Ciaperoni, Alain Barrat, Francesco Bonchi, Ciro Cattuto, Francesco Gullo:
Span-core Decomposition for Temporal Networks: Algorithms and Applications. CoRR abs/1910.03645 (2019)
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-09-10 02:11 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:
