Hello all ! am doin a project in data mining field. A part of it is to implement apriori algorithm in documents. in the algo the first step is to remove the stop words in the documents and then to find the frequent itemsets.. i ve implemented till this.. now after finding the frequent 1 itemset we need to iteratively find the sets until the global freq itemsets are retrieved. The complete implementation is in C. So dynamic allocation or SET cannot be used. I hav very low experience in Hash algorithms in choosing the appropriate function too. can anyone guide me with the suited data structures..
Any advise will be valued..
Thanks in advance :)
inilahs
0
Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.