Rough Sets and Association Rules — Which is Efficient? (Q3298742): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 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.1007/978-3-642-57489-4_81 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W31317826 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rough sets / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:11, 23 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rough Sets and Association Rules — Which is Efficient? |
scientific article |
Statements
Rough Sets and Association Rules — Which is Efficient? (English)
0 references
15 July 2020
0 references
association rules
0 references
rough sets
0 references
bitmaps
0 references
hybrid association rules induction scheme
0 references
apriori algorithm
0 references
