if there are many Sets, I think this problem is very similar to the algorithms in general search engine!
so, maybe inverted table may be a good solution! anyone knows any better ones? I am very interested to hearing that! 2006/5/1, Glenn <[EMAIL PROTECTED]>: > > I assume that this problem was solved before. Help is very much > appreciated. > > Comparing different sets of data: > > Initial Situation: I do have a number of elements which can be fully or > partially included in different sets of data. > > I would like to find out the set of data which has the biggist > similarity to my search data set. > > Example: > > Elements: A,B,C,D,E,F > > Search Data Set: (B,C,D) > > Data Set I: (A,E,F) > Data Set II: (C,D,E) > Data Set III: (A,D,E,F) > > What algorithm finds out that Data Set II is most similar to the Search > Data set? > > cheers Glenn > > > > > -- myblog: http://gnor.net/daizisheng/blog/ --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
