This is the simple pattern finding problem in which we have to find the most frequent patterns of persons that listens/vote for the same band. Here we can apply the frequent pattern algorithm like FP Tree or Apriori algorithm. Link for the tutorial of FP tree is given below
fptree.pdf<https://docs.google.com/viewer?a=v&q=cache:VMwvU2NRwBQJ:www.cis.hut.fi/Opinnot/T-61.6020/2008/fptree.pdf+&hl=en&gl=in&pid=bl&srcid=ADGEESjlMAI_es1OZC5jGJBJgWzSJ6Xy4yWDlsgZUYCvd9EWcSpnZSf_u_PbGU_zA-9Bx4r2bDq6ChcDCcay5gDEDqStEiu6IheRE3sP9cTPv32GqZ5Xgnm2qoiqmww2tLtk2DS4gWYt&sig=AHIEtbToblogHyYVe2nzZpWiwK1QzCjHsQ&pli=1> Here we have to first convert the choices of the particular person as a hashmap<string,set<string>>, the key here is the band and the set of strings contains the name of persons who voted for the band. Next step is to create the FP tree from the given set of people for particular band and create the FP tree as per given in the tutorial and find the frequent patterns. -- Akshat Sapra Under Graduation(B.Tech) IIIT-Allahabad(Amethi Campus) *--------------------------------------* sapraaks...@gmail.com akshatsapr...@gmail.com rit20009008@ <rit20009...@gmail.com>iiita.ac.in -- 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.
