DSpace Repository

Efficiently mining frequent subpaths in undirected graphs

Show simple item record

dc.contributor.advisor Guha, Sumanta en_US
dc.contributor.author Baber, Junaid en_US
dc.date.accessioned 2015-01-12T10:38:41Z
dc.date.available 2015-01-12T10:38:41Z
dc.date.issued 2009-05 en_US
dc.identifier.other AIT RSPR no.CS-09-09 en_US
dc.identifier.uri http://www.cs.ait.ac.th/xmlui/handle/123456789/152
dc.description.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 Subpaths is studied and tested comprehensively. There are made several experiments to test this algorithm and also compared the results with native algorithm Apriori. en_US
dc.description.sponsorship University of Balochistan, Pakistan en_US
dc.language.iso eng en_US
dc.publisher Asian Institute of Technology en_US
dc.subject Data mining en_US
dc.subject Subpaths--Frequent en_US
dc.subject Algorithms en_US
dc.subject.lcsh Others en_US
dc.title Efficiently mining frequent subpaths in undirected graphs en_US
dc.type Research Report en_US
dc.rights.holder Asian Institute of Technology en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account