![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Michael Mampaey
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i2]Nikolaj Tatti, Michael Mampaey:
Using Background Knowledge to Rank Itemsets. CoRR abs/1902.03102 (2019) - [i1]Michael Mampaey, Jilles Vreeken, Nikolaj Tatti:
Summarizing Data Succinctly with the Most Informative Itemsets. CoRR abs/1904.11134 (2019) - 2015
- [j4]Michael Mampaey, Siegfried Nijssen
, Ad Feelders, Rob M. Konijn, Arno J. Knobbe
:
Efficient algorithms for finding optimal binary features in numeric and nominal labeled data. Knowl. Inf. Syst. 42(2): 465-492 (2015) - 2013
- [j3]Michael Mampaey, Jilles Vreeken
:
Summarizing categorical data by clustering attributes. Data Min. Knowl. Discov. 26(1): 130-173 (2013) - [c7]Mario Boley
, Michael Mampaey, Bo Kang, Pavel Tokmakov, Stefan Wrobel:
One click mining: interactive local pattern discovery through implicit preference and performance learning. IDEA@KDD 2013: 27-35 - 2012
- [j2]Michael Mampaey, Jilles Vreeken
, Nikolaj Tatti
:
Summarizing data succinctly with the most informative itemsets. ACM Trans. Knowl. Discov. Data 6(4): 16:1-16:42 (2012) - [c6]Michael Mampaey, Siegfried Nijssen
, Ad Feelders, Arno J. Knobbe
:
Efficient Algorithms for Finding Richer Subgroup Descriptions in Numeric and Nominal Data. ICDM 2012: 499-508 - 2011
- [b1]Michael Mampaey:
Summarizing data with infromative patterns. University of Antwerp, Belgium, 2011 - [c5]Michael Mampaey, Nikolaj Tatti
, Jilles Vreeken
:
Tell me what i need to know: succinctly summarizing data with itemsets. KDD 2011: 573-581 - 2010
- [j1]Nikolaj Tatti
, Michael Mampaey:
Using background knowledge to rank itemsets. Data Min. Knowl. Discov. 21(2): 293-309 (2010) - [c4]Michael Mampaey:
Mining Non-redundant Information-Theoretic Dependencies between Itemsets. DaWak 2010: 130-141 - [c3]Michael Mampaey, Jilles Vreeken
:
Summarising Data by Clustering Items. ECML/PKDD (2) 2010: 321-336 - [c2]Bart Goethals
, Wim Le Page, Michael Mampaey:
Mining interesting sets and rules in relational databases. SAC 2010: 997-1001
2000 – 2009
- 2007
- [c1]Toon Calders, Bart Goethals
, Michael Mampaey:
Mining itemsets in the presence of missing values. SAC 2007: 404-408
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint