This is similar to Frequent Pattern algorithms studied under data mining. You may refer FP Growth tree.
Regards, Sandeep Jain On Mon, Jul 25, 2011 at 3:46 PM, sravanreddy001 <sravanreddy...@gmail.com>wrote: > how about traversing the list once.. but.. looking at the user level. > now.. we make a hashtable kind of entry.. adding 1 to the count for each of > the combinations that comes in. > > if the logs are tricky.. like.. joe's 3rd page comes after sam's 1st page > in the log. > > then.. the logs first have to be arranged in as per the user.. which takes > some time for sorting.. and then following the above approach. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/SimPOhEme6kJ. > > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
