The Data Mining Forum                             open-source data mining software data mining conferences Data Science for Social and Behavioral Analytics DSSBA 2022 data science journal
IMPORTANT: This is the old Data Mining forum.
I keep it online so that you can read the old messages.

Please post your new messages in the new forum: https://forum2.philippe-fournier-viger.com/index.php
 

Current Page: 1 of 1
Results 1 - 21 of 21
9 years ago
khairy
Dear webmasterphilfv As we know Apriori and FP-growth is well-known algorithms which is cited by the most recently published papers even 2014. but if we asked during our viva voce about why we used Apriori and FP-Growth for the comparison although they are implemented in 1993 and 2000 respectively. Thanks
Forum: The Data Mining / Big Data Forum
9 years ago
khairy
Hi Sir, When i try to run FP-Growth in 0.9 support using Pumsb dataset, i received this message Exception in thread "main" java.lang.OutOfMemoryError: Java heap space as shown i give a big support value but the algorithm is crash how can i run the algorithm in this dataset to get frequent item-sets.
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Hi Sir It seems that in all datasets H-mine algorithm record the worst execution time compared to FP-Growth, Apriori and Ecalt. Is this true? Thanks
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Dear all am searching for retail dataset or supermarket dataset, as it shown in the dataset content available in FIMI or other dataset repositories , they are written in a number format as example 38 39 47 48 38 39 48 49 23 56 27 56 57 58 45 32 41 59 60 which means blind data, in case if i want to find the association its better to say if customer by sugar and tea he also buy mi
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Dear Sir suppose we have the following transactions 100 bread cheese eggs juice 200 bread cheese juice 300 bread milk yoghurt 400 bread juice milk 500 cheese juice milk if the support is 50% and the confidence is 75% the 1st frequent itemsets will be bead 4 cheese 3 juice 4 milk 3 and the 2nd candidate itemsets will be bread c
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
normally in order to extract association rules, first you have to discover the frequent itemsets, then generating association rule from them. in the source code of FP-Growth you are using the same code of Apriori to extracting association rules, is this means this step is a common for all algorithms when discover the frequent itemsets and extracting association rule means all are using subsets
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
i designed a new algorithm for mining the frequent items and association rule generation to validate my own algorithm with the two famous algorithms FP-Growth and Apriori using SPMF codes when i run FP-Growth algorithm it seem there is two measure of execution time one for Frequent itemsets two association rules generation to measure it with my algorithm i have to sum the two times togeth
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
am asking about the time and space complexity for the following algorithms Apriori P-Grwoth is it O(n2) Eclat H-mine
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
PhD Position in Data Mining with focus on machine learning and data analysis for combining on-board and off-board vehicle data PhD Position in Data Mining with focus on analysing energy usage patterns for improving sustainability Link http://islab.hh.se/mediawiki/index.php/OpenPositions
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
i want to do association rule case study for market basket analysis using any dataset like retail dataset, but my issue, i need dataset that having manual or any definition for the items because when i finished i want to analysis the association and i do not want to say for example association frequency confident lift correlation 232 8485 230 ------
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
The Dataset Mushrooms not have a redundant transaction, hope we find more datasets having this kind of characteristics.
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Dear Sir, now am doing experiments in different datasets, now am seeking for redundant dataset, i mean dataset that contain a full transaction occur several times for example T1 1 3 5 6 T2 2 5 5 T3 1 3 5 6 T4 2 3 5 6 T5 1 3 5 6 T1 T3 and T5 having the same transaction items
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Dears, When we design a new algorithm and measure the execution time and memory usage, is it enough to justify that our algorithm is better or there is another criteria that can be used for evaluating the algorithm among the well known algos.
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Thank you very much for your helpful explain, also the chapter is useful and more clear. regards,
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
am confused about the two terms frequent pattern and association rules suppose i want to discover frequent pattern and association rule using the following transaction i need a help to get the out of the two terms separately TID Items 100 A C D 200 B C E 300 A B C E 400 B E secondly did apriori and fp-growth all of them giving frequent items set and association rules togeth
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
khairy Wrote: Hi one more question, when i execute any algorithm with the same support for example 5 times, the result is change, my question if i got 5 different execution time for the same minimum support, which one i have to select ?
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Hi one more question, when i execute any algorithm with the same support for example 5 times, the result is change, my question if i got 5 different execution time for the same minimum support, which one i have to select ?
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Hi I have tried to execute FP-Growth from SPMF. I would like to verify the calculation of the execution time for the algorithm is it for the first part: // STEP 1: Applying the FP-GROWTH algorithm to find frequent itemsets Itemsets patterns = fpgrowth.runAlgorithm(input, null, minsupp); or the second part as well which is: // STEP 2: Generating all rules from the set of frequent itemsets
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
Please i need urgent help in this issue Thanks all.
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
but in FP-Growth if am right, if we have a 100 transactions and each transaction contains frequently one item , FP-growth will give you zero frequent items, i means in FP-Growth we need at least two items in a transaction to find and get the frequent items, but in apriori you can get it. i need your valuable comments
Forum: The Data Mining / Big Data Forum
10 years ago
khairy
am a PhD student and am ask what kind of statistical analysis that i need to do to validate my methodology, in the part of performance study i want to do some statistical work, i need guidance on this part because i got comment from some evaluators to do some statistical work ( my area is frequent pattern and association rules mining). thanks
Forum: The Data Mining / Big Data Forum
Current Page: 1 of 1

This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.