{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:57:33Z","timestamp":1760608653603},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,16]],"date-time":"2011-07-16T00:00:00Z","timestamp":1310774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10844-011-0168-1","type":"journal-article","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T01:48:36Z","timestamp":1310694516000},"page":"333-353","source":"Crossref","is-referenced-by-count":12,"title":["Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Guillaume","family":"Poezevara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Cuissart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,16]]},"reference":[{"key":"168_CR1","doi-asserted-by":"crossref","unstructured":"Borgelt, C., & Berthold, M. R. (2002). Mining molecular fragments: Finding relevant substructures of molecules. In Proceedings of the IEEE International Conference on Data Mining (ICDM\u201902) (pp. 51\u201358).","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"168_CR2","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Meinl, T., & Berthold, M. (2005). Moss: a program for molecular substructure mining. In Workshop Open Source Data Mining Software (pp. 6\u201315). ACM Press.","DOI":"10.1145\/1133905.1133908"},{"key":"168_CR3","unstructured":"Calders, T., Rigotti, C., & Boulicaut, J.-F. (2005). A survey on condensed representations for frequent sets. In J.-F. Boulicaut, L. De\u00a0Raedt, & H. Mannila (Eds.), Constraint-based mining and inductive databases. Lecture notes in computer science (Vol. 3848, pp. 64\u201380). Springer."},{"key":"168_CR4","doi-asserted-by":"crossref","unstructured":"Cook, D.\u00a0J., & Holder, L.\u00a0B. (2006). Mining graph data. Wiley.","DOI":"10.1002\/0470073047"},{"key":"168_CR5","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1109\/ICIAP.1999.797762","volume-title":"ICIAP \u201999: Proceedings of the 10th international conference on image analysis and processing","author":"LP Cordella","year":"1999","unstructured":"Cordella, L.\u00a0P., Foggia, P., Sansone, C., & Vento, M. (1999). Performance evaluation of the vf graph matching algorithm. In ICIAP \u201999: Proceedings of the 10th international conference on image analysis and processing (p. 1172). Washington, DC, USA: IEEE Computer Society."},{"key":"168_CR6","unstructured":"De\u00a0Raedt, L., & Kramer, S. (2001). The levelwise version space algorithm and its application to molecular fragment finding. In IJCAI\u201901 (pp. 853\u2013862)."},{"key":"168_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/312129.312191","volume-title":"Proceedings of the fifth international conference on knowledge discovery and data mining (ACM SIGKDD\u201999)","author":"G Dong","year":"1999","unstructured":"Dong, G., & Li, J. (1999). Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of the fifth international conference on knowledge discovery and data mining (ACM SIGKDD\u201999) (pp. 43\u201352). San Diego, CA: ACM Press."},{"key":"168_CR8","unstructured":"EPAFHM (2008). Mid continent ecology division (environement protection agency), fathead minnow. http:\/\/www.epa.gov\/med\/Prods_Pubs\/fathead_minnow.htm ."},{"key":"168_CR9","unstructured":"Garey, M.\u00a0R., & Johnson, D.\u00a0S. (1979). Computers and intractability. Freeman and Company."},{"issue":"1","key":"168_CR10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF01718702","volume":"2","author":"M Hassan","year":"1996","unstructured":"Hassan, M., Bielawski, J., Hempel, J., & Waldman, M. (1996). Optimization and visualization of molecular diversity of combinatorial libraries. Molecular Diversity, 2(1), 64\u201374.","journal-title":"Molecular Diversity"},{"key":"168_CR11","doi-asserted-by":"crossref","unstructured":"Kramer, S., Raedt, L.\u00a0D., & Helma, C. (2001). Molecular feature mining in HIV data. In KDD (pp. 136\u2013143).","DOI":"10.1145\/502512.502533"},{"issue":"2","key":"168_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/PL00011662","volume":"3","author":"J Li","year":"2001","unstructured":"Li, J., Dong, G., & Ramamohanarao, K. (2001). Making use of the most expressive jumping emerging patterns for classification. Knowledge and Information Systems, 3(2), 131\u2013145.","journal-title":"Knowledge and Information Systems"},{"key":"168_CR13","first-page":"3","volume":"12","author":"J Li","year":"2001","unstructured":"Li, J., & Wong, L. (2001). Emerging patterns and gene expression data. Genome Informatics, 12, 3\u201313.","journal-title":"Genome Informatics"},{"issue":"8","key":"168_CR14","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1021\/ci100092x","volume":"50","author":"S Lozano","year":"2010","unstructured":"Lozano, S., Poezevara, G., Halm-Lemeille, M.-P., Lescot-Fontaine, E., Lepailleur, A., Bissell-Siders, R., et al. (2010). Introduction of jumping fragments in combination with qsars for the assessment of classification in ecotoxicology. Journal of Chemical Information and Modeling, 50(8), 1330\u20131339.","journal-title":"Journal of Chemical Information and Modeling"},{"issue":"3","key":"168_CR15","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., & Toivonen, H. (1997). Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3), 241\u2013258.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"168_CR16","unstructured":"Morishita, S., Sese, J., & Ward, B. (2000). Traversing itemset lattices with statistical metric pruning. In In Proc. of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (pp. 226\u2013236). ACM."},{"key":"168_CR17","doi-asserted-by":"crossref","unstructured":"Ng, R.\u00a0T., Lakshmanan, V.\u00a0S., Han,J.,& Pang, A. (1998). Exploratory mining and pruning optimizations of constrained associations rules. In proceedings of ACM SIGMOD\u201998 (pp. 13\u201324). ACM Press.","DOI":"10.1145\/276304.276307"},{"key":"168_CR18","doi-asserted-by":"crossref","unstructured":"Nijssen, S., & Kok, J.\u00a0N. (2004). A quickstart in frequent structure mining can make a difference. In W. Kim, R. Kohavi, J. Gehrke, & W. DuMouchel, (Eds.), KDD (pp. 647\u2013652). ACM.","DOI":"10.1145\/1014052.1014134"},{"key":"168_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-642-03915-7_14","volume-title":"8th international symposium on Intelligent Data Analysis (IDA\u201909)","author":"M Plantevit","year":"2009","unstructured":"Plantevit, M. & Cr\u00e9milleux, B. (2009). Condensed representation of sequential patterns according to frequency-based measures. In 8th international symposium on Intelligent Data Analysis (IDA\u201909), Lecture Notes in Computer Science (Vol. 5772, pp. 155\u2013166). Lyon, France: Springer."},{"key":"168_CR20","series-title":"Lecture Notes in Artificial Intelligence","first-page":"45","volume-title":"18th International Symposium on Methodologies for Intelligent Systems (ISMIS\u201909)","author":"G Poezevara","year":"2009","unstructured":"Poezevara, G., Cuissart, B., & Cr\u00e9milleux, B. (2009). Discovering emerging graph patterns from chemicals. In 18th International Symposium on Methodologies for Intelligent Systems (ISMIS\u201909). Lecture Notes in Artificial Intelligence (Vol. 5522, pp. 45\u201355). Prague, Czech Republic: Springer."},{"key":"168_CR21","unstructured":"Schervish, M.\u00a0J. (1995). Theory of statisitics (chapter 7). Large sample theory (p. 467). Springer series in statisitics. Springer."},{"issue":"1","key":"168_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/IDA-2009-0358","volume":"13","author":"A Soulet","year":"2009","unstructured":"Soulet, A., & Cr\u00e9milleux, B. (2009). Mining constraint-based patterns using automatic relaxation. Intelligent Data Analysis, 13(1), 1\u201325.","journal-title":"Intelligent Data Analysis"},{"key":"168_CR23","unstructured":"Soulet, A., Cr\u00e9milleux, B., & Rioult, F. (2005). Knowledge discovery in inductive databases: KDID 2004. Lecture notes in computer science, chapter Condensed representation of EPs and patterns quantified by frequency-based measures, (Vol. 3377, pp. 173\u2013190). Springer."},{"key":"168_CR24","unstructured":"Soulet, A., Kl\u00e9ma, J., & Cr\u00e9milleux, B. (2007). Post-proceedings of the 5th international workshop on Knowledge Discovery in Inductive Databases in conjunction with ECML\/PKDD 2006 (KDID\u201906). Lecture notes in computer science, chapter efficient mining under rich constraints derived from various datasets (Vol. 4747, pp. 223\u2013239). Springer."},{"key":"168_CR25","doi-asserted-by":"crossref","unstructured":"Ting, R.\u00a0M.\u00a0H., & Bailey, J. (2006). Mining minimal contrast subgraph patterns. In J. Ghosh, D. Lambert, D.\u00a0B. Skillicorn, & J. Srivastava, (Eds.), SDM, (pp. 638\u2013642). SIAM.","DOI":"10.1137\/1.9781611972764.76"},{"issue":"8","key":"168_CR26","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/0045-6535(88)90211-1","volume":"17","author":"G Veith","year":"1988","unstructured":"Veith, G., Greenwood, B., Hunter, R., Niemi, G., & Regal, R. (1988). On the intrinsic dimensionality of chemical structure space. Chemosphere, 17(8), 1617\u20131644","journal-title":"Chemosphere"},{"key":"168_CR27","unstructured":"W\u00f6rlein, M., Meinl, T., Fischer, I., & Philippsen, M. (2005). A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston. In A. Jorge, L. Torgo, P. Brazdil, R. Camacho, & J. Gama (Eds.), Knowledge Discovery in Databases: PKDD 2005. Lecture notes in computer science (Vol. 3721, pp. 392\u2013403). Springer."},{"key":"168_CR28","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201903)","author":"X Yan","year":"2003","unstructured":"Yan, X., & Han, J. (2003). Closegraph: Mining closed frequent graph patterns. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201903) (pp. 286\u2013295). New York, NY, USA: ACM."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-011-0168-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-011-0168-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-011-0168-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T00:25:53Z","timestamp":1560385553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-011-0168-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,16]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s10844-011-0168-1","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,16]]}}}