Dergiler / International Journal of Intelligent Systems and Applications in Engineering / 2022 / Cilt: 10 - Sayı: 1

An Adjacency matrix-based Multiple Fuzzy Frequent Itemsets mining (AMFFI) technique

Sayfa
69–74
Yayın Tarihi
2022-10-18
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Experiments carried out to compare the suggested method's performance to that of existing methodologies based on running time, memory utilization, and the number of nodes joining.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Recently, discovering helpful information from a database consisting of transactions has been a critical research topic.
📊
Temel Bulgular & Veri:An adjacency matrix and fuzzy-list structure were designed to find multiple FFIs by scanning database only once and generates less number of candidate itemsets.
💡
Sonuç & Katkı:Experiments carried out to compare the suggested method's performance to that of existing methodologies based on running time, memory utilization, and the number of nodes joining.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

Abstract

Recently, discovering helpful information from a database consisting of transactions has been a critical research topic. Several frequent itemsets mining for association rule mining, algorithms that can only handle binary databases have proposed. Transactions using numerical values, on the other hand, are ubiquitous in real-world applications. Thus, with reference to the quantitative transactional database, several algorithms were developed and “fuzzy frequent itemsets” (FFI) were discovered. Most of them just consider the term having maximum cardinality. As a result, the number of fuzzy regions processed is equal to the number of original elements. Multiple fuzzy zones of an item, on the other hand, give a better result for making a correct decision. This study presents an AMFFI-miner (Adjacency matrix-based Multiple Fuzzy Frequent Itemsets) for discovering multiple FFIs out of a quantitative transactional database. An adjacency matrix and fuzzy-list structure were designed to find multiple FFIs by scanning database only once and generates less number of candidate itemsets. Join two nodes if its co-occurrence between two fuzzy linguistics terms satisfies minimum support threshold by finding the co-occurrence between two fuzzy linguistics terms directly from the adjacency matrix, thus reducing the number of nodes joining and speeding up discovering multiple FFI. Experiments carried out to compare the suggested method's performance to that of existing methodologies based on running time, memory utilization, and the number of nodes joining.

🔖

Bu Makaleye Atıf Yap

PATEL, M. N., SHAH, S., PATEL, S. B. (2022). An Adjacency matrix-based Multiple Fuzzy Frequent Itemsets mining (AMFFI) technique. International Journal of Intelligent Systems and Applications in Engineering, Cilt: 10 - Sayı: 1, 69–74. https://ajindex.com/articles/541264

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (15)

  1. R. Agrawal, S. Member, T. Imielinski, and A. Swami, “Database Mining: A Performance Perspective” IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 6, pp. 914–925, 1993
  2. R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules” The International Conference on Very Large Data Bases, pp. 487-499, 1994
  3. R. Agrawal and R. Srikant, “Mining Sequential Patterns” The International Conference on Data Engineering, pp. 3-14, 1995
  4. M. Antonelli, P. Ducange, F. Marcelloni, and A. Segatori, “A novel associative classification model based on a fuzzy frequent pattern mining algorithm” Expert Syst. Appl., vol. 42, no. 4, pp. 2086–2097, 2015
  5. K. Hu, Y. Lu, L. Zhou, and C. Shi, “LNAI 1711 - Integrating Classification and Association Rule Mining: A Concept Lattice Framework” The 7th International Workshop on New Directions in Rough Sets Data Mining, and Granular-Soft Computing, pp. 443–447, 1999
  6. P. Berkhin, “A Survey of Clutering Data Mining Techniques” Grouping Multidimensional Data, pp. 25-71, 2006
  7. J. Han and R. Mao, “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach” Data Mining and Knowledge Discovery, vol. 8. no. 1, pp. 53–87, 2004
  8. J. Friedman and L. A. Z. Fuzzy, “Similarity relations and fuzzy orderings” fuzzy sets Information and Control, vol. 8, pp. 338–353, 1965
  9. T.-P. Hong, C.-S. Kuo, and S.-C. Chi, “Mining association rules from quantitative data” Intelligent Data Analysis, vol. 3, no. 5, pp. 363–376, 1999
  10. Hong, Tzung-Pei, “An Effective Gradual Data-Reduction Strategy for Fuzzy Itemset Mining,” Int. J. Fuzzy Syst., vol. 15, no. 2, pp. 170-181, 2013
  11. T.-P. Hong, C.-W. Lin, and A. T.-C. Lin, “The MFFP-tree fuzzy mining algorithm to discover complete linguistic frequent itemsets” Computational Intelligence, vol. 30, no. 1, pp. 145–166, 2014
  12. J. C. W. Lin, T. P. Hong, and T. C. Lin, “A CMFFP-tree algorithm to mine complete multiple fuzzy frequent itemsets,” Appl. Soft Comput. J., vol. 28, pp. 431–439, 2015
  13. J. C. W. Lin, T. P. Hong, T. C. Lin, and S. T. Pan, “An UBMFFP tree for mining multiple fuzzy frequent itemsets,” Int. J. Uncertainty, Fuzziness Knowlege-Based Syst., vol. 23, no. 6, pp. 861–879, 2015
  14. J. C. W. Lin, T. Li, P. Fournier-Viger, and T. P. Hong, “A fast Algorithm for mining fuzzy frequent itemsets,” in Journal of Intelligent and Fuzzy Systems, vol. 29, no. 6, pp. 2373–2379, 2015
  15. J. C. W. Lin, T. Li, P. Fournier-Viger,