Mining frequent subgraph patterns from uncertain graphs

Ruan Jian Xue Bao/Journal of Software

Volumn 20, Issue 11, 2009, Pages 2965-2976

  Zou, Zhao Nian ^a   Li, Jian Zhong ^a   Gao, Hong ^a   Zhang, Shuo ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Frequent subgraph pattern; Graph mining; Uncertain graph

Indexed keywords

APRIORI; DATA MODELS; DEPTH FIRST SEARCH; DEPTH-FIRST SEARCH ALGORITHM; EFFICIENT METHOD; FREQUENT SUBGRAPHS; GRAPH DATA; GRAPH MINING; LINEAR SCALE; MINING ALGORITHMS; ORDERS OF MAGNITUDE; SEARCH SPACES; SUBGRAPH ISOMORPHISM; SUBGRAPHS;

COMPUTER SCIENCE; DATA MINING; LEARNING ALGORITHMS; SET THEORY;

MINING;

EID: 71049118525     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1001.2009.03473     Document Type: Article

References (15)

1. Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed DA, Komorowski HJ, Zytkow JM, eds. Proc. of the 4th European Conf. on Principles of Data Mining and Knowledge Discovery. Lyon: Springer-Verlag, 2000. 13-23.
2. Kuramochi M, Karypis G. Frequent subgraph discovery. In: Cercone N, Lin TY, Wu X, eds. Proc. of the 2001 IEEE Int'l Conf. on Data Mining. San Jose: IEEE Computer Society, 2001. 313-320.
3. Yan X, Han J. gSpan: Graph-Based substructure pattern mining. In: Kumar V, Tsumoto S, Zhong N, Yu PS, Wu X, eds. Proc. of the 2002 IEEE Int'l Conf. on Data Mining. Maebashi: IEEE Computer Society, 2002. 721-724.
4. Huan J, Wang W, Prins J. Efficient mining of frequent subgraphs in the presence of isomorphism. In: Kumar V, Tsumoto S, Zhong N, Yu PS, Wu X, eds. Proc. of the 2003 IEEE Int'l Conf. on Data Mining. Melbourne: IEEE Computer Society, 2002. 549-552.
5. Nijssen S, Kok JN. A quickstart in frequent structure mining can make a difference. In: Kim W, Kohavi R, Gehrke J, DuMouchel W, eds. Proc. of the 10th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. Seattle: ACM, 2004. 647-652.
6. Yan X, Han J. Closegraph: Mining closed frequent graph patterns. In: Getoor L, Senator TE, Domingos P, Faloutsos C, eds. Proc. of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. Washington: ACM, 2003. 286-295.
7. Huan J, Wang W, Prins J, Yang J. Spin: Mining maximal frequent subgraphs from graph databases. In: Kim W, Kohavi R, Gehrke J, DuMouchel W, eds. Proc. of the 10th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. Seattle: ACM, 2004. 581-586.
8. Saito R, Suzuki H, Hayashizaki Y. Interaction generality, a measurement to assess the reliability of a protein-protein interaction. Nucleic Acids Research, 2002, 30(5):1163-1168.
9. Benjelloun O, Sarma AD, Halevy A, Theobald M, Widom J. Databases with uncertainty and lineage. VLDB Journal, 2008, 17(2): 243-264.
10. Dalvi N, Suciu D. Efficient query evaluation on probabilistic databases. VLDB Journal, 2007, 16(4):523-544.
11. Soliman MA, Ilyas IF, Chang KCC. Top-k query processing in uncertain databases. In: Chirkova R, Dogac A, Ozsu T, Sellis T, eds. Proc. of the 2002 IEEE Int'l Conf. on Data Engineering. Istanbul: IEEE Computer Society, 2007. 896-905.
12. Pei J, Jiang B, Lin X, Yuan Y. Probabilistic skylines on uncertain data. In: Koch C, Gehrke J, Garofalakis MN, Srivastava D, Aberer K, Deshpande A, Florescu D, Chan CY, Ganti V, Kanne CC, Klas W, Neuhold EJ, eds. Proc. of the 24th Int'l Conf. on Very Large Data Bases. Austria: ACM, 2007. 15-26.
13. Chui CK, Kao B, Hung E. Mining frequent itemsets from uncertain data. In: Zhou Z, Li H, Yang Q, eds. Proc. of the 11th Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining. Nanjing: Springer-Verlag, 2007. 47-58.
14. Chui CK, Kao B. A decremental approach for mining frequent itemsets from uncertain data. In: Washio T, Suzuki E, Ting KM, Inokuchi I, eds. Proc. of the 12th Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining. Osaka: Springer-Verlag, 2008. 64-75.
15. Zhang Q, Li F, Yi K. Finding frequent items in probabilistic data. In: Wang JT, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Vancouver: ACM, 2008. 819-832.