{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:49:45Z","timestamp":1774716585339,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T00:00:00Z","timestamp":1296604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10115-010-0376-y","type":"journal-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T06:51:34Z","timestamp":1296543094000},"page":"423-447","source":"Crossref","is-referenced-by-count":51,"title":["An efficient graph-mining method for complicated and noisy data with real-world applications"],"prefix":"10.1007","volume":"28","author":[{"given":"Yi","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jintao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,2]]},"reference":[{"key":"376_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-09690-2","volume-title":"Managing and mining uncertain data","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal CC (2009) Managing and mining uncertain data. Springer, Berlin"},{"key":"376_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Li Y, Wang J, Wang J (2009) Frequent pattern mining with uncertain data. In: Proceedings of the 2009 ACM SIGKDD international conference on Knowledge discovery and data mining (SIGKDD\u201909), pp 29\u201337","DOI":"10.1145\/1557019.1557030"},{"key":"376_CR3","unstructured":"Bandyopadhyay D, Snoeyink J (2004) Almost-Delaunay simplices: nearest neighbor relations for imprecise points. In: ACM-SIAM symposium on distributed algorithms, pp 403\u2013412"},{"issue":"1","key":"376_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10115-007-0117-z","volume":"16","author":"J Chan","year":"2008","unstructured":"Chan J, Bailey J, Leckie C (2008) Discovering correlated spatio-temporal changes in evolving graphs. Knowl Inf Syst 16(1): 53\u201396","journal-title":"Knowl Inf Syst"},{"key":"376_CR5","doi-asserted-by":"crossref","unstructured":"Chen C, Yan X, Zhu F, Han J (2007) Gapprox: mining frequent approximate patterns from a massive network. In: Proceedings of the 2007 international conference on data mining (ICDM\u201907)","DOI":"10.1109\/ICDM.2007.36"},{"key":"376_CR6","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1038\/nbt0804-1035","volume":"22","author":"SR Eddy","year":"2004","unstructured":"Eddy SR (2004) Where did the blosum62 alignment score matrix come from. Nat Biotechnol 22: 1035\u20131036","journal-title":"Nat Biotechnol"},{"key":"376_CR7","doi-asserted-by":"crossref","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 14","DOI":"10.1007\/s10618-006-0059-1"},{"key":"376_CR8","unstructured":"Holder LB, Cook DJ, Djoko S (1994) Substructures discovery in the subdue system. In: Proceedings of AAAI\u201994 workshop knowledge discovery in databases, pp 169\u2013180"},{"key":"376_CR9","doi-asserted-by":"crossref","unstructured":"Hu H, Yan X, Huang Y, Han J, Zhou XJ (2005) Mining coherent dense subgraphs across massive biological networks for functional discovery. In: Proceedings of the 2005 international conference on intelligent systems for molecular biology (ISMB\u201905)","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"376_CR10","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraph in the presence of isomorphism. In: Proceedings of the 2003 IEEE international conference on data mining (ICDM\u201903), pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"376_CR11","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the 2003 international conference on data mining (ICDM\u201903)"},{"key":"376_CR12","doi-asserted-by":"crossref","unstructured":"Huan J, Bandyopadhyay D, Snoeyink J, Prins J, Tropsha A, Wang W (2006) Distance-based identification of spatial motifs in proteins using constrained frequent subgraph mining. In: Proceedings of the IEEE computational systems bioinformatics","DOI":"10.1142\/9781860947575_0029"},{"key":"376_CR13","unstructured":"Huan J, Prins J, Wang W, Carter C, Dokholyan NV (2006) Coordinated evolution of protein sequences and structures with structure entropy. In: Computer Science Department Technical Report"},{"key":"376_CR14","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Bandyopadhyay D, Snoeyink J, Prins J, Tropsha A (2004) Mining family specific residue packing patterns from protein structure graphs. In: Proceedings of the 8th annual international conference on research in computational molecular biology (RECOMB), pp 308\u2013315","DOI":"10.1145\/974614.974655"},{"key":"376_CR15","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J, Yang J (2004) Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 581\u2013586","DOI":"10.1145\/1014052.1014123"},{"key":"376_CR16","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: Proceeding of 2000 practice of knowledge discovery in databases conference (PKDD\u201900), pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"376_CR17","doi-asserted-by":"crossref","first-page":"12639","DOI":"10.1128\/JVI.77.23.12639-12645.2003","volume":"77","author":"KA Judson","year":"2003","unstructured":"Judson KA, Lubinski JM, Jiang M, Chang Y, Eisenberg RJ, Cohen GH, Friedman HM (2003) Blocking immune evasion as a novel approach for prevention and treatment of herpes simplex virus infection. J Virol 77: 12639\u201312645","journal-title":"J Virol"},{"key":"376_CR18","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the 2001 international conference on data mining (ICDM\u201901), pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"376_CR19","doi-asserted-by":"crossref","unstructured":"Lahiri M, Berger-Wolf TY (2009) Periodic subgraph mining in dynamic networks. Knowl Inf Syst (online first 09\/2009)","DOI":"10.1007\/s10115-009-0253-8"},{"key":"376_CR20","doi-asserted-by":"crossref","unstructured":"Lahiri M, Berger-Wolf TY (2007) Structure prediction in temporal networks using frequent subgraphs. Computat Intell Data Min, pp. 35\u201342","DOI":"10.1109\/CIDM.2007.368850"},{"key":"376_CR21","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"issue":"8","key":"376_CR22","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1016\/S0969-2126(97)00260-8","volume":"5","author":"CA Orengo","year":"1997","unstructured":"Orengo CA, Michie AD, Jones S, Jones DT, Swindells MB, Thornton JM (1997) CATH\u2014a hierarchic classification of protein domain structures. Structure 5(8): 1093\u20131108","journal-title":"Structure"},{"key":"376_CR23","unstructured":"Pei J, Jiang D, Zhang A (2005) Mining cross-graph quasi-cliques in gene expression and protein interaction data. ICDE, pp 353\u2013354"},{"key":"376_CR24","unstructured":"De Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: IJCAI\u201901: seventeenth international joint conference on artificial intelligence, vol 2, pp 853\u2013859"},{"key":"376_CR25","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1093\/bioinformatics\/btg224","volume":"19","author":"G Wang","year":"2003","unstructured":"Wang G, Dunbrack RL Jr (2003) PISCES: a protein sequence culling server. Bioinformatics 19: 1589\u20131591","journal-title":"Bioinformatics"},{"issue":"2","key":"376_CR26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10115-009-0223-1","volume":"23","author":"C-H Weng","year":"2010","unstructured":"Weng C-H, Chen Y-L (2010) Mining fuzzy association rules from uncertain data. Knowl Inf Syst 23(2): 129\u2013152","journal-title":"Knowl Inf Syst"},{"key":"376_CR27","doi-asserted-by":"crossref","unstructured":"Yada K, Motoda H, Washio T, Miyawaki A (2004) Consumer behavior analysis by graph mining technique. Lecture Notes in Computer Science, pp 800\u2013806","DOI":"10.1007\/978-3-540-30133-2_105"},{"key":"376_CR28","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: Procceeding of international conference on data mining (ICDM\u201902), pp 721\u2013724"},{"issue":"4","key":"376_CR29","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1145\/1189769.1189777","volume":"31","author":"X Yan","year":"2006","unstructured":"Yan X, Zhu F, Yu PS, Han J (2006) Feature-based substructure similarity search. ACM Trans Database Syst 31(4): 1418\u20131453","journal-title":"ACM Trans Database Syst"},{"key":"376_CR30","unstructured":"Zhang S, Yang J (2008) Ram: randomized approximate graph mining export. Scientific and Statistical Database Management"},{"key":"376_CR31","doi-asserted-by":"crossref","unstructured":"Zhang S, Yang J, Cheedella V (2007) Monkey: approximate graph mining based on spanning trees. In: Proceeding of IEEE 23rd international conference data engineering (ICDE\u201907), pp 1247\u20131249","DOI":"10.1109\/ICDE.2007.368984"},{"key":"376_CR32","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang S (2009) Frequent subgraph pattern mining on uncertain graph data. In: Proceedings of the 2009 conference on information and knowledge management (CIKM\u201909), pp 583\u2013592","DOI":"10.1145\/1645953.1646028"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0376-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0376-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0376-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T09:34:58Z","timestamp":1637228098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0376-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,2]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0376-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,2]]}}}