Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{558419,
author = {Blaťák, Jan},
address = {Pisa (Italy)},
booktitle = {Proceedings of ECML/PKDD Discovery Challenge 2004},
edition = {1},
keywords = {frequent patterns; relational data mining; STULONG},
language = {eng},
location = {Pisa (Italy)},
pages = {1-6},
publisher = {University of Pisa},
title = {Mining first-order frequent patterns in the STULONG database},
url = {http://lisp.vse.cz/challenge/ecmlpkdd2004/final/blatak.pdf},
year = {2004}
}
TY - JOUR
ID - 558419
AU - Blaťák, Jan
PY - 2004
TI - Mining first-order frequent patterns in the STULONG database
PB - University of Pisa
CY - Pisa (Italy)
KW - frequent patterns
KW - relational data mining
KW - STULONG
UR - http://lisp.vse.cz/challenge/ecmlpkdd2004/final/blatak.pdf
N2 - We show how RAP can be employed to answer questions concerning relations in the database STULONG. RAP is a system of inductive logic programming which is designed to search long first-order frequent patterns and association rules. The STULONG database contains information about atherosclerosis in the population of middle-aged men.We define several types of the background knowledge and outline the influence of their complexity on mining patterns.We describe the found rules and explain their meaning.
ER -
BLAŤÁK, Jan. Mining first-order frequent patterns in the STULONG database. In \textit{Proceedings of ECML/PKDD Discovery Challenge 2004}. 1. vyd. Pisa (Italy): University of Pisa, 2004, s.~1-6.
|
