{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:04:13Z","timestamp":1725890653662},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694762"},{"type":"electronic","value":"9783540694977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69497-7_14","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"187-203","source":"Crossref","is-referenced-by-count":8,"title":["RAM: Randomized Approximate Graph Mining"],"prefix":"10.1007","author":[{"given":"Shijie","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1038\/nbt924","volume":"22","author":"J. Bader","year":"2004","unstructured":"Bader, J., Chaudhuri, A., Rothberg, J., Chant, J.: Gaining confidence in high-throughput protein interaction networks. Nature Biotechnology\u00a022(1), 78\u201385 (2004)","journal-title":"Nature Biotechnology"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Chang, R., Podgurski, A., Yang, J.: Finding What\u2019s not there: a new approach to revealing neglected conditions in software. In: Proc. of ISSTA (2007)","DOI":"10.1145\/1273463.1273486"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Cong, G., Yi, L., Liu, B., Wang, K.: Discovering frequent substructures from hierarchical semi-structured data. In: Proc of SDM (2002)","DOI":"10.1137\/1.9781611972726.11"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Mannila, H., Saluja, S.: Discovering All Most Specific Sentences by Randomized Algorithms Source. LNCS 1997(1997)","DOI":"10.1007\/3-540-62222-5_47"},{"key":"14_CR5","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Advances in Data Mining. Theoretical Aspects and Applications","author":"M. Hasan","year":"2007","unstructured":"Hasan, M., Chaoji, V., Salem, S., Besson, J., Zaki, M.: ORIGAMI: Mining Representative Orthogonal Graph Patterns. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol.\u00a04597. Springer, Heidelberg (2007)"},{"key":"14_CR6","unstructured":"Holder, L., Cook, D., Djoko, S.: Substructure discovery in the subdue system. In: Proc. AAAI (1994)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proc. of ICDM (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: Proc. of KDD (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of PDKK (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1093\/bioinformatics\/bth919","volume":"20","author":"M. Koyuturk","year":"2004","unstructured":"Koyuturk, M., Grama, A., Szpankowski, W.: An efficient algorithm for detecting frequent subgraphs in bioloical networks. Bionformatics\u00a020, 200\u2013207 (2004)","journal-title":"Bionformatics"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of ICDE (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. (2005)","DOI":"10.1007\/s10618-005-0003-9"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.: A quickstart in frequent structure mining can make a difference. In: Proc of KDD (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On Mining Cross-Graph Quasi-Cliques. In: Proc. of KDD (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Park, J., Chen, M., Yu, P.: An effective hash based algorithm for mining association rules. In: Proc. SIGMOD, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Thomas, L., Valluri, S., Karlapalem, K.: MARGIN:Maximal Frequent Subgraph Mining. In: Proc. of ICDM (2006)","DOI":"10.1109\/ICDM.2006.102"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: Mining closed frequent graph patterns. In: Proc. of SIGKDD (2003)","DOI":"10.1145\/956750.956784"},{"key":"14_CR18","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proc. of ICDM (2002)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Substructure similarity search in graph databases. In: Proc. of SIGMOD (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"14_CR20","unstructured":"Liu, J., Paulsen, S., Xu, X., Wang, W., Nobel, A., Prins, J.: Mining approximate frequent itemset from noisy data. In: ICDM (2005)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Zaki, M.: Efficiently mining frequent trees in a forest: algorithms and applications. In: IEEE TKDE (2005)","DOI":"10.1109\/TKDE.2005.125"},{"key":"14_CR22","unstructured":"Kyoto Encyclopedia of Genes and Genomes, http:\/\/www.genome.jp\/kegg\/"},{"key":"14_CR23","unstructured":"Metabolic pathway categories in KEGG, http:\/\/www.kegg.com\/kegg\/pathway\/map\/map01100.html"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69497-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:00:52Z","timestamp":1605762052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69497-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694762","9783540694977"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69497-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}