Efficiently mining frequent subpaths in undirected graphs | |
| Author | Baber, Junaid |
| Call Number | AIT RSPR no.CS-09-09 |
| Subject(s) | Data mining Computer algorithms |
| Note | A research study Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. CS-09-09 |
| Abstract | Frequent subpaths in undirected graph was research challenge . This problem comes in many practical applications like traffic congestion, hot support in different path, in chemical formulas and also can be used for Information retrieval systems. This algorithm can also solve the problem of finding frequent sequence in text (text mining) by putting every paragraph in graph considering it as one path. So given N paragraphs (paths) this algorithm will find frequent sequences. So in this research study, a new algorithm called Apriori for Frequent Sub paths is studied and tested comprehensively. There are made several experiments to test this algorithm and also compared the results with native algorithm Apriori. |
| Year | 2009 |
| Corresponding Series Added Entry | Asian Institute of Technology. Research studies project report ; no. CS-09-09 |
| Type | Research Study Project Report (RSPR) |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Guha, Sumanta; |
| Examination Committee(s) | Phan Minh Dung;Vatcharaporn Esichaikul; |
| Scholarship Donor(s) | University of Balochistan, Pakistan; |
| Degree | Research Studies Project Report (M.Eng.) - Asian Institute of Technology, 2009 |