Efficiently mining frequent subpaths
作者： Sumanta Guha
DOI:
关键词:
摘要: The problem considered is that of finding frequent subpaths a database paths in fixed undirected graph. This arises applications such as predicting congestion network traffic. An algorithm based on Apriori, called AFS, developed, but with significantly improved efficiency through exploiting the underlying graph structure, which makes AFS feasible for practical input path sizes. It also proved natural generalization not amenable to any solution quicker than Apriori.
参考文章(12)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Diane J Cook, Lawrence B Holder, None, Mining Graph Data : Wiley-Interscience,. ,(2006)
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data european conference on principles of data mining and knowledge discovery. pp. 13- 23 ,(2000) , 10.1007/3-540-45372-5_2
E. G. Coffman, J. Eve, File structures using hashing functions Communications of the ACM. ,vol. 13, pp. 427- 432 ,(1970) , 10.1145/362686.362693
M. Kuramochi, G. Karypis, Frequent subgraph discovery international conference on data mining. pp. 313- 320 ,(2001) , 10.1109/ICDM.2001.989534
Ming-Syan Chen, Jong Soo Park, P.S. Yu, Efficient data mining for path traversal patterns IEEE Transactions on Knowledge and Data Engineering. ,vol. 10, pp. 209- 221 ,(1998) , 10.1109/69.683753
Micheline Kamber, Jiawei Han, Jian Pei, Data Mining: Concepts and Techniques ,(2000)
E. Gudes, A. Pertsev, Mining module for adaptive XML path indexing database and expert systems applications. pp. 1015- 1019 ,(2005) , 10.1109/DEXA.2005.134
N. Vanetik, E. Gudes, S.E. Shimony, Computing frequent graph patterns from semistructured data international conference on data mining. pp. 458- 465 ,(2002) , 10.1109/ICDM.2002.1183988