A new share frequent itemsets mining using incremental BitTable knowledge
| dc.contributor.author | Nawapornanan, Chayanan | |
| dc.contributor.author | Boonjing, Veera | |
| dc.date.accessioned | 2026-08-06T10:03:05Z | |
| dc.date.available | 2026-08-06T10:03:05Z | |
| dc.date.issued | 2011-12-01 | |
| dc.description.abstract | The share measure has been proposed as an important measure for mining association rules. The value of share itemsets provides useful information such as total profits and total customer purchased quantities associated with itemsets in database. The share-frequent itemsets mining problems become a very important research issue in data mining. Existing share-frequent itemsets mining algorithms are based on static database so knowledge must be rebuilded when the minimum share threshold is changed or database is modified either appended or updated. This paper proposes a novel BitTable knowledge for incremental and interactive share-frequent itemsets mining in multiple minimum share thresholds without rebuilding BitTable knowledge. It is effective for incremental and interactive mining to take advantage of the previous BitTable knowledge and the previous mining results. © 2011 AICIT. | |
| dc.identifier.citation | Proceedings 6th International Conference on Computer Sciences and Convergence Information Technology Iccit 2011, 358-362, 2011 | |
| dc.identifier.other | 2-s2.0-84869419717 | |
| dc.identifier.uri | https://dspace.kmitl.ac.th/handle/123456789/3858 | |
| dc.source | Proceedings 6th International Conference on Computer Sciences and Convergence Information Technology Iccit 2011 | |
| dc.title | A new share frequent itemsets mining using incremental BitTable knowledge | |
| dc.type | Conference Paper |