Searching Optimal Bus-routes based on Frequent Subgraph Mining

This paper proposed an approach ofsearching the optimal bus-routes based on datamining technology called Frequent SubgraphMining (FSM).FSM is an important task forexploratory data analysis on graph data. Manyapproaches handling graph data assume that thedata structure of the mining task is small enoughto fit in the main memory of a computer. However,as the real-world graph data grows, both in sizeand quantity, such an assumption does not holdany longer. To overcome this problem, theproposed system use MapReduce frameworkwhich is becoming the de-facto paradigm forcomputation on massive data. In this paper, it hasthree main phases: partition, preparation andmining. The mining phase use MapReduceparadigm. The proposed system demonstrates thesearching of optimal routes, which means theminimum bus-stops, in Yangon region. It can helpthe travelers in finding the bus-stops and routesduring their visit in Yangon