MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/31/1/5154Keywords:
Dynamic bit vector, frequent itemset, frequent weighted utility itemset, multi-bit segment, tidset.Abstract
In recent years, methods for mining quantitative databases have been proposed. However, the processing time is fairly much, which affects the productivity of intelligent systems in the use of quantitative databases. This study proposes the multi-bit segment (MBiS) structure to store and process tidsets to increase the effeciency of mining frequent weighted utility itemsets (FWUIs) from quantitative databases. With this structure, the calculation of the intersection of tidsets between two itemsets becomes more convenient. Based on this structure, the authors define the MBiS-Tree structure and propose an algorithm for mining FWUIs from quantitative databases. Experimental results for a number of databases show that the proposed method outperforms existing methods.Downloads
Published
16-03-2015
How to Cite
[1]N. D. Ham, V. Đình Bảy, N. T. H. Minh, and T.-P. Hong, “MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases”, J. Comput. Sci. Cybern., vol. 31, no. 1, pp. 17–30, Mar. 2015.
Issue
Section
Computer Science
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
