- Category:
- Java Develop
- Tags:
-
- File Size:
- 23kb
- Update:
- 2018-04-18
- Downloads:
- 0 Times
- Uploaded by:
- 等朕称了帝
Description: The classic Apriori algorithm generates many candidate itemsets because it needs to scan the database many times, which greatly affects the time and space efficiency of the algorithm. In order to reduce the number of database scanning, we can use matrix to record the required data and put it into memory. Every row number of matrix record corresponds to a commodity code, that is, one item, and each column number corresponds to a customer number (i.e. a transaction). If a j customer buys a I commodity, then record[i][j]=1, otherwise record[i][j]=0. scan the database once and initialize the matrix record. The next work can be done by scanning the matrix in memory without scanning the database again.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| apriori\20180303.txt | 3359 | 2018-03-03
|
| apriori\20180304.txt | 4012 | 2018-03-04
|
| apriori\20180305.txt | 5412 | 2018-03-05
|
| apriori\20180306.txt | 6252 | 2018-03-06
|
| apriori\20180330.txt | 6278 | 2018-03-30
|
| apriori\20180331.txt | 6606 | 2018-04-07
|
| apriori\V1.txt | 5639 | 2018-04-08
|
| apriori\V2.txt | 6482 | 2018-04-15
|
| apriori\V3.txt | 6731 | 2018-04-16
|
| apriori\V3_1.txt | 7329 | 2018-04-08
|
| apriori\V4.txt | 8431 | 2018-04-14
|
| apriori | 0 | 2018-04-08 |
Download