Kontaktujte nás | Jazyk: čeština English
dc.title | Mining Top-K high utility itemsets using bio-inspired algorithms with a diversity within population framework | en |
dc.contributor.author | Pham, Ngoc Nam | |
dc.contributor.author | Komínková Oplatková, Zuzana | |
dc.contributor.author | Huynh, Minh Huy | |
dc.contributor.author | Vo, Bay | |
dc.relation.ispartof | Proceedings - 2022 RIVF International Conference on Computing and Communication Technologies, RIVF 2022 | |
dc.identifier.issn | 2162-786X Scopus Sources, Sherpa/RoMEO, JCR | |
dc.identifier.isbn | 978-1-6654-6166-5 | |
dc.identifier.isbn | 978-1-6654-6167-2 | |
dc.date.issued | 2022 | |
dc.citation.spage | 167 | |
dc.citation.epage | 172 | |
dc.event.title | 2022 RIVF International Conference on Computing and Communication Technologies, RIVF 2022 | |
dc.event.location | Ho Chi Minh City | |
utb.event.state-en | Vietnam | |
utb.event.state-cs | Vietnam | |
dc.event.sdate | 2022-12-20 | |
dc.event.edate | 2022-12-22 | |
dc.type | conferenceObject | |
dc.language.iso | en | |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
dc.identifier.doi | 10.1109/RIVF55975.2022.10013891 | |
dc.relation.uri | https://ieeexplore.ieee.org/document/10013891 | |
dc.relation.uri | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10013891 | |
dc.subject | bio-inspired algorithm | en |
dc.subject | high utility itemset mining | en |
dc.subject | top-k high utility item set mining | en |
dc.description.abstract | High-utility itemset mining (HUIM), as a necessary data mining task, has paid the attention of many researchers. It includes numerous applications in various arears. Recently, a method, which improved the memory usage and runtime for HUIs mining, was proposed, is called TKO-BPSO. It helps to automatically increase the border thresholds and might considerably reduce the combinational problem for pruning the search space effectively. However, the idea only works to maintain the current optimal values in the next populations, leading to the variety within populations is limited. To handle this problem, we propose a new bio-inspired algorithm-based HUIM framework to explore HUIs, namely TKO-HUIMF-PSO (Top-K high utility itemset mining in One phase based on a HUIM Framework of Particle Swarm Optimization). The main idea of TKO-HUIMF-PSO adapts the standard roadmap of bio-inspired algorithms by applying roulette wheel selection to all the discovered HUIs to determine the target values of the next population. Consequently, it improves the diversity within populations. Significant experiments conducted on publicly available several real and synthetic datasets delineate that the proposed algorithm is efficient and effective in terms of runtime and memory usage. © 2022 IEEE. | en |
utb.faculty | Faculty of Applied Informatics | |
dc.identifier.uri | http://hdl.handle.net/10563/1011369 | |
utb.identifier.obdid | 43884318 | |
utb.identifier.scopus | 2-s2.0-85147325640 | |
utb.source | d-scopus | |
dc.date.accessioned | 2023-02-17T00:08:28Z | |
dc.date.available | 2023-02-17T00:08:28Z | |
dc.description.sponsorship | IGA/CebiaTech/022/001; Technology Agency of the Czech Republic, TACR: FW01010381 | |
utb.contributor.internalauthor | Pham, Ngoc Nam | |
utb.contributor.internalauthor | Komínková Oplatková, Zuzana | |
utb.contributor.internalauthor | Huynh, Minh Huy | |
utb.fulltext.affiliation | Nam Ngoc Pham Faculty of Applied Informatics Tomas Bata University Zlín, Czech Republic npham@utb.cz Huy Minh Huynh Faculty of Applied Informatics Tomas Bata University Zlín, Czech Republic. huynh@utb.cz Zuzana Komínková Oplatková Faculty of Applied Informatics Tomas Bata University Zlín, Czech Republic oplatkova@utb.cz Bay Vo* HUTECH University Ho Chi Minh City, Vietnam vd.bay@hutech.edu.vn *Corresponding author | |
utb.fulltext.dates | Date Added to IEEE Xplore: 18 January 2023 | |
utb.fulltext.references | [1] R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proceedings of the 20th ACM International Conference on Very Large Data Bases, vol. 1215. Citeseer, 1994, 487–499. [2] W. Gan et al., “A survey of utility-oriented pattern mining, IEEE Transactions on Knowledge and Data Engineering, 1306–1327, 2021. [3] M. Liu and J. Qu, “Mining high utility itemsets without candidate generation,” in Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55–64, 2012. [4] Y. Li et al., “Isolated items discarding strategy for discovering high-utility itemsets,” Data Knowl. Eng., vol. 64, no.1, 198–217, 2008. [5] H. Ryang et al., “Discovering high utility itemsets with multiple minimum supports,” Intell. Data Anal., vol.18, no.6, 1027–1047, 2014. [6] B. E. Shie et al., 2012. A. One-phase method for mining high utility mobile sequential patterns in mobile commerce environments. In Proceedings of the International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems. 616–626. [7] M. Liu et al. Mining high utility itemsets without candidate generation. In Proc. ACM Int. Conf. Inf. Knowl. Manag, 2012, 55–64. [8] Y. Liu et al., 2005, “A two-phase algorithm for fast discovery of high utility itemsets”. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. 689–695. [9] S. Krishnamoorthy, “Pruning strategies for mining high utility itemsets,” Expert Systems with Applications, pp. 2371–2381, 2015. [10] V. S. Tseng et al., UP-Growth: “An efficient algorithm for high utility itemset mining”. In Proceedings of the International Conference on Knowledge Discovery and Data Mining. 253–262. [11] P. Fournier-Viger et al., 2014. FHM: Faster high utility itemset mining using estimated utility co-occurrence pruning. In Proceedings of the International Symposium on Foundations of Intelligent Systems. 83–92. [12] S. Zida, P. Fournier-Viger et al., 2015. EFIM: A highly efficient algorithm for high utility itemset mining. In Proceedings of the Mexican International Conference on Artificial Intelligence. 530–546. [13] S. Ventura and J. M. Luna, Pattern Mining With Evolutionary Algorithms. Berlin, Germany: Springer, 2016. [14] J. M. Luna, M. Pechenizkiy, M. J. Del Jesus, and S. Ventura. 2017. Mining context-aware association rules using grammar-based genetic programming. IEEE Trans. Cyber. 48, 11 (2017), 3030–3044. [15] S. Kannimuthu and K. Premalatha, “Discovery of high utility itemsets using genetic algorithm with ranked mutation,” Appl. Artif. Intel, vol. 28, no. 4, pp. 337–359, Apr. 2014. [16] J. C.-W. Lin et al., ‘‘Mining high-utility itemsets based on particle swarm optimization,’’ Eng. Appl. Artif. Intell, vol. 55, 320–330, 2016. [17] V. S. Tseng et al., ‘‘Efficient algorithms for mining high utility itemsets from transactional databases,’’ IEEE Trans. Knowl. Data Eng., vol. 25, no. 8, pp. 1772–1786, Aug. 2013. [18] W. Song and C. Huang, "Mining High Utility Itemsets Using BioInspired Algorithms: A Diverse Optimal Value Framework," in IEEE Access, vol. 6, pp. 19568-19582, 2018. [19] P. Fournier-Viger et al., the SPMF open-source data mining library version 2. In Proceedings of the 19th European Conference on Machine Learning and Knowledge Discovery, Springer, 36-40, 2016. [20] Cheng-Wei Wu et al., "Efficient Algorithms for Mining Top-K High Utility Itemsets," in IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 1, pp. 54-67, 1 Jan. 2016. [21] Huynh, H.M., et al., (2020). Sequential Pattern Mining Using IDLists. In proceeding of the 12th International Conference, ICCCI 2020, Da Nang, Vietnam, November 30 – December 3, 2020. [22] Huynh, H.M., et al., “An efficient method for mining sequential patterns with indices,” Knowledge-Based Systems 239:107946, 2021. [23] Q. H. Duong et al., “An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies,” Knowledge-Based Systems, vol. 104, pp. 106–122, 2016. [24] Pham, N.N., et al, “Mining Top-K high utility itemset using BioInspired Algorithms,” in COMPENG 2022 IEEE workshop on complexity in engineering (https://compeng2022.ion.cnr.it/) | |
utb.fulltext.sponsorship | This work was supported by the Technology Agency of the Czech Republic, under the project no. FW01010381, by internal Grant Agency of Tomas Bata University under the project no. IGA/CebiaTech/022/001, and further by the resources of A.I.Lab at the Faculty of Applied Informatics, Tomas Bata University in Zlin. | |
utb.scopus.affiliation | Tomas Bata University, Faculty of Applied Informatics, Zlín, Czech Republic; Hutech University, Ho Chi Minh City, Viet Nam | |
utb.fulltext.projects | FW01010381 | |
utb.fulltext.projects | IGA/CebiaTech/022/001 | |
utb.fulltext.faculty | Faculty of Applied Informatics | |
utb.fulltext.faculty | Faculty of Applied Informatics | |
utb.fulltext.faculty | Faculty of Applied Informatics | |
utb.fulltext.ou | - | |
utb.fulltext.ou | - | |
utb.fulltext.ou | - |