Efficient single-pass frequent pattern mining using a prefix-tree (Q1010129): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ins.2008.10.027 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2024511949 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4424018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient strategies for tough aggregate constraint-based sequential pattern mining / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy association rules and the extended mining algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interactive sequence discovery by incremental mining / rank | |||
Normal rank |
Latest revision as of 10:28, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient single-pass frequent pattern mining using a prefix-tree |
scientific article |
Statements
Efficient single-pass frequent pattern mining using a prefix-tree (English)
0 references
3 April 2009
0 references
data mining
0 references
frequent pattern
0 references
association rule
0 references
incremental mining
0 references
interactive mining
0 references