Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3561278.3561294acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmisncConference Proceedingsconference-collections
research-article

Incremental High Fuzzy Utility Itemset Mining

Published: 30 November 2022 Publication History

Abstract

In data mining, frequent-pattern mining methods are used for handling binary databases. Utility mining addresses this limitation by considering the item utilities and quantities when discovering the high utility itemsets. In addition, to make these high utility patterns more human-explainable, we use the fuzzy-set theory to the utility mining algorithms. However, real-world databases are usually dynamic. That is, new transactions may be intermittently added, and the corresponding mined knowledge needs to be updated. This paper uses the famous incremental strategy, fast update (FUP), to modify high fuzzy utility itemsets from new coming data. We implement the FUP strategy on the Apriori-based approach for maintaining up-to-date high fuzzy utility itemsets.We also conducted experiments to demonstrate that the incremental algorithm significantly outperforms the Apriori-based batch mining method.

References

[1]
R. Agrawal, T. Imielinski, and A. Swami. 1993. "Mining association rules between sets of items in large databases," The ACM SIGMOD Conference, pp. 207–216.
[2]
R. Agrawal and R. Srikant. 1994. "Fast algorithm for mining association rules," The International Conference on Very Large Data Bases, pp. 487–499.
[3]
D. W. Cheung, J. Han, V. T. Ng and C. Y. Wong. 1996. "Maintenance of discovered association rules in large databases: An incremental updating approach," The Twelfth IEEE International Conference on Data Engineering, pp. 106–114.
[4]
R. Chan, Q. Yang and Y. D. Shen. 2003. "Mining high utility itemsets," The Third IEEE International Conference on Data Mining, pp. 19–26.
[5]
T. Gharib, H. Nassar, M. Taha and A. Abraham. 2010. "An efficient algorithm for incremental mining of temporal association rules," Data & Knowledge Engineering, vol. 69, no. 8, pp. 800–815.
[6]
T. P. Hong, C. Y. Wang and Y. H. Tao. 2001. "A new incremental data mining algorithm using pre-large itemsets," Intelligent Data Analysis, vol.5, pp. 111–129.
[7]
T. P. Hong, J. W. Lin and Y. L. Wu. 2006. "A Fast Updated Frequent Pattern Tree," IEEE International Conference on Systems, Man and Cybernetics, pp. 2167–2172.
[8]
W. M. Huang, T. P. Hong, G. C. Lan, M. C. Chiang and C. W. Lin, 2017. "Temporal-based fuzzy utility mining", IEEE Access, vol. 5, pp. 26639- 26652.
[9]
J. W. Han, J. Pei and Y. W. Yin. 2000. "Mining frequent patterns without candidate generation," ACM SIGMOD Record, vol. 29, pp. 1–12.
[10]
IBM Quest Data Mining Projection, Quest synthetic data generation code, 1996, Available at http://www.almaden.ibm.com/cs/quest/ syndata.htm.
[11]
G. C. Lan, T. P. Hong, Y. H. Lin and S. L. Wang. 2015. "Fuzzy utility mining with upper-bound measure," Applied Soft Computing, vol. 30, pp. 767–777.
[12]
C. W. Lin, T. P. Hong and W. H. Liu. 2011. "An effective tree structure for mining high utility itemsets," Expert Systems with Applications, vol.38, pp. 7419-7424.
[13]
C. W. Lin, G. C. Lan and T. P. Hong. 2012. "An incremental mining algorithm for high utility itemsets," Expert Systems with Applications, vol. 39, no. 8, pp. 7173-7180.
[14]
C. P. Lai, P. C. Chung and S. Tseng. 2010. "A novel algorithm for mining fuzzy high utility itemsets," International Journal of Innovative Computing, Information and Control, vol. 6, pp. 4347–4361.
[15]
Y. Liu, W. K. Liao and A. Choudhary. 2005. "A two-phase algorithm for fast discovery of high utility itemsets," The 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining, pp. 689–695.
[16]
D. L. Miholca, G. Czibula and L. M. Criveia. 2018. "A new incremental relational association rules mining approach," Procedia Computer Science, vol.126, pp. 126–137.
[17]
M. Naqvi, K. Hussain, S. Asghar and S. Fong. 2011. "Mining temporal association rules with incremental standing for segment progressive filter," Communications in computer and information science, pp. 373–382.
[18]
W. Thurachon and W. Kreesuradej. 2021. "Incremental Association Rule Mining with a Fast Incremental Updating Frequent Pattern Growth Algorithm," IEEE Access, vol. 9, pp. 55726-55741.
[19]
C. M. Wang, S. H. Chen and Y. F. Huang. 2009. "A fuzzy approach for mining high utility quantitative itemsets," The IEEE International Conference on Fuzzy Systems, pp. 20–24.
[20]
H. Yao, H. J. Hamilton and C. J. Butz. 2004. "A foundational approach to mining itemset utilities from databases," The SIAM International Conference on Data Mining, pp. 211–225.
[21]
H. Yao and H. J. Hamilton. 2006. "Mining itemset utilities from transaction databases," Data and Knowledge Engineering, vol. 59, pp. 603–626.

Cited By

View all
  • (2024)Using Tree Structures for Maintenance of High Fuzzy Utility ItemsetsThe Review of Socionetwork Strategies10.1007/s12626-024-00172-418:2(429-448)Online publication date: 21-Aug-2024
  • (2023)Using the Pre-Large Concept for Maintaining High Fuzzy Utility Itemsets2023 IEEE International Conference on Fuzzy Systems (FUZZ)10.1109/FUZZ52849.2023.10309768(1-5)Online publication date: 13-Aug-2023
  • (2022)Incremental Fuzzy Utility Mining with Tree Structure2022 IEEE International Conference on Big Data (Big Data)10.1109/BigData55660.2022.10020566(6202-6206)Online publication date: 17-Dec-2022

Index Terms

  1. Incremental High Fuzzy Utility Itemset Mining

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    MISNC '22: Proceedings of the 9th Multidisciplinary International Social Networks Conference
    October 2022
    88 pages
    ISBN:9781450398435
    DOI:10.1145/3561278
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 November 2022

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Data mining
    2. Fast update
    3. High Fuzzy Utility Itemset
    4. Incremental mining

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    MISNC2022

    Acceptance Rates

    Overall Acceptance Rate 57 of 97 submissions, 59%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 08 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Using Tree Structures for Maintenance of High Fuzzy Utility ItemsetsThe Review of Socionetwork Strategies10.1007/s12626-024-00172-418:2(429-448)Online publication date: 21-Aug-2024
    • (2023)Using the Pre-Large Concept for Maintaining High Fuzzy Utility Itemsets2023 IEEE International Conference on Fuzzy Systems (FUZZ)10.1109/FUZZ52849.2023.10309768(1-5)Online publication date: 13-Aug-2023
    • (2022)Incremental Fuzzy Utility Mining with Tree Structure2022 IEEE International Conference on Big Data (Big Data)10.1109/BigData55660.2022.10020566(6202-6206)Online publication date: 17-Dec-2022

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media