An efficient algorithm to discover colossal closed itemsets in high dimensional data /
The current trend of data collection involves a small number of observations with a very large number of variables, known as high dimensional data. Mining these data produces an explosive number of smaller item sets which are less important than colossal (large) ones. As the trend in Frequent Itemse...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis 圖書 |
| 語言: | English |
| 出版: |
Kuala Lumpur :
Kulliyyah of Engineering, International Islamic University Malaysia,
2020
|
| 主題: | |
| 在線閱讀: | http://studentrepo.iium.edu.my/handle/123456789/11050 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!