OU Portal
Log In
Welcome
Applicants
Z6_60GI02O0O8IDC0QEJUJ26TJDI4
Error:
Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.
{}
Close
Publikační činnost
Probíhá načítání, čekejte prosím...
publicationId :
tempRecordId :
actionDispatchIndex :
navigationBranch :
pageMode :
tabSelected :
isRivValid :
Record type:
stať ve sborníku (D)
Home Department:
Katedra informačních a komunikačních technologií (45080)
Title:
Using relational operations to express association rules
Citace
Burda, M. a Mindek, M. Using relational operations to express association rules.
In:
SYRCoDIS.
St. - Petersburg, Russia: VVM. com. Ltd., 2005. VVM. com. Ltd., 2005. s. 25-33. ISBN 5-9651-0087-6.
Subtitle
Publication year:
2005
Obor:
Počítačový hardware a software
Number of pages:
Page from:
25
Page to:
33
Form of publication:
ISBN code:
5-9651-0087-6
ISSN code:
Proceedings title:
SYRCoDIS
Proceedings:
Mezinárodní
Publisher name:
VVM. com. Ltd.
Place of publishing:
St. - Petersburg, Russia
Country of Publication:
Sborník vydaný v zahraničí
Název konference:
SYRCoDIS
Conference venue:
St. - Petersburg, Russia
Datum zahájení konference:
Typ akce podle státní
příslušnosti účastníků:
Evropská akce
WoS code:
EID:
Key words in English:
data mining, relational operations, association rules, selection, projection
Annotation in original language:
Association rules are essential data mining tool. There exist many types of them. Indeed, association rules of different types have often completely dissimilar syntax. In this paper, we try to design a framework based on relational operations enabling one to express various association rules using the same syntax. Doing so we will be able to study association rules at high level -- it will be possible to formally describe common characteristics of different rule types.
Annotation in english language:
Association rules are essential data mining tool. There exist many types of them. Indeed, association rules of different types have often completely dissimilar syntax. In this paper, we try to design a framework based on relational operations enabling one to express various association rules using the same syntax. Doing so we will be able to study association rules at high level -- it will be possible to formally describe common characteristics of different rule types.
References
Reference
R01:
Complementary Content
Deferred Modules
${title}
${badge}
${loading}
Deferred Modules