Name
Abstract | ||
|---|---|---|
In this paper, we extend mutually dependent patterns as itemsets introduced by Ma and Hellerstein (2001) to mutually dependent multisets allowing two or more occurrences of the same items. Then, by improving the algorithm to extract all of the mutually dependent patterns based on APRIORI with maintaining itemsets and their supports, we design the algorithm to extract all of the mutually dependent multisets based on APRIORITID with traversing a database just once and maintaining both multisets and their tail occurrences but without computing overall multiplicity of items in multisets. Finally, we give experimental results to apply the algorithm to both real data as antibiograms consisting of a date, a patient id, a detected bacterium, and so on and artificial data obtained by repeating items in transaction data. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-67786-6_19 | DISCOVERY SCIENCE, DS 2017 |
Field | DocType | Volume |
Data mining,Computer science,A priori and a posteriori,Transaction data,Traverse | Conference | 10558 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Natsuki Kiyota | 1 | 0 | 0.34 |
| Sho Shimamura | 2 | 0 | 0.34 |
| Kouichi Hirata | 3 | 130 | 32.04 |