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 - 12 of 12
10 years ago
djanahana
Hi sir; Many thanks for your explanation Best regards
Forum: The Data Mining / Big Data Forum
10 years ago
djanahana
Hi Sir Please a have a small question, i want to know if it is possible and when we can publish a paper wich represent a data mining based tool?, is there any crieria or the paper is just for the software we want to sale? thanks for reading my message Best ragards,
Forum: The Data Mining / Big Data Forum
10 years ago
djanahana
Hi , I truly appreciate your effort and kindness to help me. it seems very difficult to get a source code of those algorithms. thanks once again Best regards;
Forum: The Data Mining / Big Data Forum
10 years ago
djanahana
Hi, I am sorry for waisting your time i have already look for the source code of FP-max, and i couldn't find it. I was looking for a java source code of any other algorithm for maximal frquent itemset algorithm generation Many thanks for your time thanks, Best regards;
Forum: The Data Mining / Big Data Forum
10 years ago
djanahana
Hi , Thanks for the list of algorithms, for the paper i was speaking about as an example this paper http://dl.acm.org/citation.cfm?id=1802277 Sir could you please tell me where can i find a java source code of any of these algorithm (if there is). I see that you have developped CHARM-MFI but as you said it isn't an efficient one. Thanks in advance, Djanahana
Forum: The Data Mining / Big Data Forum
10 years ago
djanahana
Hi, please i want to know the list of efficient and fast maximal frequents itemset extraction algorithm. i find GenMax as an efficient one,is it the only one. another question, i read some paper where the authors developpe (make the source code of some data mining algorithm "FP max as an example " and they publish a paper is it a search axe if i developpe an algorithm. t
Forum: The Data Mining / Big Data Forum
11 years ago
djanahana
Hi, http://www.philippe-fournier-viger.com/spmf/how_to_install.txt
Forum: The Data Mining / Big Data Forum
11 years ago
djanahana
Hello & Good morning i would like if you don't mind to ask you this question: "What's the diffrence between maximals frequents itemsets algorithms " , is it the processing time to generate the MFI ? do they represent the same results? or the diffrence could be the algorithm steps and only ? the raison of my question is that I see that many rescearch projects use man
Forum: The Data Mining / Big Data Forum
11 years ago
djanahana
an intersting information ,Many thanks
Forum: The Data Mining / Big Data Forum
11 years ago
djanahana
Good moring every body i am looking please for an implementation of FP_max algorithm or any algorithm that can extract maximal frequent itemset in java , i will use it for an experience. i find in the software SPMF Charm-MFI but i can't find the refrence to the paper of a theis is it "Methodes symboliques de fouille de donnees avec la plate-forme Coron" ? i will apreciate
Forum: The Data Mining / Big Data Forum
11 years ago
djanahana
Hi thanks a lot for this help,they consider in many times genetic algorithm as an heuristic ,i though that is just like that and it isn't a data mining algorithm thanks once again Best Regards,
Forum: The Data Mining / Big Data Forum
11 years ago
djanahana
GOOD MORNING every body i have please a small question can we consider genetic algorithm as a datamining technique or algorthim ,if yes can you show me a link or paper wich confirm that ?i find in a book 1 year ago that it's a sot computing tehnique thanks for reading my message best
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.