Subgroup Discovery through Bump Hunting on Relational Histograms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00204898" target="_blank" >RIV/68407700:21230/12:00204898 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Subgroup Discovery through Bump Hunting on Relational Histograms
Original language description
We propose an approach to subgroup discovery in relational databases containing numerical attributes. The approach is based on detecting bumps in histograms constructed from substitution sets resulting from matching a rst-order query against the input relational database. The approach is evaluated on seven data sets, discovering interpretable subgroups. The subgroups' rate of survival from the training split to the testing split varies among the experimental data sets, but at least on three of them it is very high.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F1875" target="_blank" >GAP103/10/1875: Learning from Theories</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Inductive Logic Programming
ISBN
978-3-642-31950-1
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
76-90
Publisher name
Springer
Place of publication
Heidelberg
Event location
Cumberland Lodge, Windsor Great Park
Event date
Jul 31, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—