{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:58:23Z","timestamp":1762210703181},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,17]],"date-time":"2011-11-17T00:00:00Z","timestamp":1321488000000},"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":[[2013,1]]},"DOI":"10.1007\/s10115-011-0452-y","type":"journal-article","created":{"date-parts":[[2011,11,17]],"date-time":"2011-11-17T06:45:23Z","timestamp":1321512323000},"page":"75-108","source":"Crossref","is-referenced-by-count":15,"title":["MOSubdue: a Pareto dominance-based multiobjective Subdue algorithm for frequent subgraph mining"],"prefix":"10.1007","volume":"34","author":[{"given":"Prakash","family":"Shelokar","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Quirin","sequence":"additional","affiliation":[]},{"given":"\u00d3scar","family":"Cord\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,17]]},"reference":[{"key":"452_CR1","volume-title":"Managing and mining graph data series","year":"2010","unstructured":"Aggarwal, C, Wang, H (eds) (2010) Managing and mining graph data series. Springer, Berlin"},{"key":"452_CR2","first-page":"779","volume-title":"Computer and Information Sciences\u2014ISCIS 2004, vol 3280 of Lecture Notes in Computer Science","author":"R Ba\u00f1os","year":"2004","unstructured":"Ba\u00f1os R, Gil C, Montoya MG, Ortega J (2004) A new Pareto-based algorithm for multi-objective graph partitioning. In: Aykanat C, Dayar T, K\u00f6rpeoglu I (eds) Computer and Information Sciences\u2014ISCIS 2004, vol 3280 of Lecture Notes in Computer Science. Springer, Berlin, pp 779\u2013788"},{"key":"452_CR3","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold MR (2002) Mining molecular fragments: finding relevant substructures of molecules. In: Proceeding of IEEE Int Conf Data Min (ICDM\u201902), pp 51\u201358","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"452_CR4","volume-title":"Multiobjective decision making theory and methodology","author":"V Chankong","year":"1983","unstructured":"Chankong V, Haimes YY (1983) Multiobjective decision making theory and methodology. North-Holland, Amsterdam"},{"key":"452_CR5","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CA Coello","year":"2007","unstructured":"Coello CA, Lamont GB, Van Veldhuizen DA (2007) Evolutionary algorithms for solving multi-objective problems. Springer, Berlin"},{"key":"452_CR6","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"DJ Cook","year":"2000","unstructured":"Cook DJ, Holder LB (2000) Graph-based data mining. IEEE Intell Syst 15: 32\u201341","journal-title":"IEEE Intell Syst"},{"key":"452_CR7","volume-title":"Mining graph data","author":"DJ Cook","year":"2007","unstructured":"Cook, DJ, Holder, LB (2007) Mining graph data. Wiley, London"},{"key":"452_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0957-4174(96)00006-1","volume":"11","author":"DJ Cook","year":"1996","unstructured":"Cook DJ, Holder LB, Djoko S (1996) Scalable discovery of informative structural concepts using domain knowledge. IEEE Expert Intell Syst Appl 11: 59\u201368","journal-title":"IEEE Expert Intell Syst Appl"},{"key":"452_CR9","first-page":"1","volume-title":"Pathfinder associative networks: Studies in knowledge organization","author":"DW Dearholt","year":"1990","unstructured":"Dearholt DW, Schvaneveldt RW (1990) Properties of Pathfinder networks. In: Schvaneveldt R (ed) Pathfinder associative networks: Studies in knowledge organization. Ablex, Norwood, pp 1\u201330"},{"key":"452_CR10","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6: 182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"452_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/B:SCIE.0000037368.31217.34","volume":"61","author":"F De Moya-Aneg\u00f3n","year":"2004","unstructured":"De Moya-Aneg\u00f3n F, Vargas-Quesada B, Herrero-Solana V, Chinchilla-Rodr\u00edguez Z, Corera-\u00c1lvarez E, Munoz-Fern\u00e1ndez FJ (2004) A new technique for building maps of large scientific domains based on the cocitation of classes and categories. Scientometrics 61(1): 129\u2013145","journal-title":"Scientometrics"},{"key":"452_CR12","first-page":"112","volume-title":"Dengraph: a density-based community detection algorithm. In: IEEE\/WIC\/ACM Int Conf Web Intelligence","author":"T Falkowski","year":"2007","unstructured":"Falkowski T, Barth A, Spiliopoulou M (2007) Dengraph: a density-based community detection algorithm. In: IEEE\/WIC\/ACM Int Conf Web Intelligence. IEEE Computer Society, Los Alamitos, pp 112\u2013115"},{"key":"452_CR13","doi-asserted-by":"crossref","unstructured":"Fischer I, Meinl T (2004) Graph based molecular data mining\u2014an overview. In: Thissen W, Wieringa P, Pantic M, Ludema M (eds) IEEE Int Conf Syst Man Cy vol 76, pp 4578\u20134582","DOI":"10.1109\/ICSMC.2004.1401253"},{"key":"452_CR14","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In: Proceeding of 5th Int Conf Genetic Algorithms (ICGA93), pp 416\u2013423"},{"key":"452_CR15","volume-title":"Multicriteria decision making: advances in MCDM models, algorithms, theory and applications","year":"1999","unstructured":"Gal, T, Stewart, TJ, Hanne, T (eds) (1999) Multicriteria decision making: advances in MCDM models, algorithms, theory and applications. Kluwer, Dordrecht"},{"key":"452_CR16","unstructured":"Gonzalez JA, Holder LB, Cook DJ (2000) Structural knowledge discovery used to analyze earthquake activity. In: Proceeding 13th Ann Florida Art Intell Res Symp (FLAIRS), pp 86\u201390"},{"key":"452_CR17","doi-asserted-by":"crossref","unstructured":"Holder LB, Cook DJ (2005) Graph-based data mining. In: Wang J (ed) Encyclopedia of data warehousing and mining Vol II. Information Science Reference, Hershey, pp 943\u2013949","DOI":"10.4018\/978-1-59140-557-3.ch102"},{"issue":"1","key":"452_CR18","doi-asserted-by":"crossref","first-page":"i213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu H, Yan X, Huang Y, Han J, Zhou XJ (2005) Mining coherent dense subgraphs acrossmassive biological networks for functional discovery. Bioinformatics 21(1): i213\u2013i221","journal-title":"Bioinformatics"},{"key":"452_CR19","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceeding of IEEE Int Conf Data Min (ICDM\u201903), pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"452_CR20","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 4th Euro Conf Prin Data Min Knowl Disc (PKDD\u201900), pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"452_CR21","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Tsukamoto N, Nojima Y (2008) Evolutionary many-objective optimization: a short review. In: Proceeding of IEEE Congr Evol Comput, pp 2424\u20132431","DOI":"10.1109\/CEC.2008.4631121"},{"key":"452_CR22","volume-title":"Multi-objective machine learning. Studies in Computational Intelligence, vol 16","year":"2006","unstructured":"Jin, Y (ed) (2006) Multi-objective machine learning. Studies in Computational Intelligence, vol 16. Springer, Heidelberg"},{"key":"452_CR23","first-page":"397","volume":"38","author":"Y Jin","year":"2008","unstructured":"Jin Y, Sendhoff B (2008) Pareto-based multi-objective machine learning: an overview and case studies. IEEE Trans Syst Man Cybern C 38: 397\u2013415","journal-title":"IEEE Trans Syst Man Cybern C"},{"key":"452_CR24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U Kang","year":"2011","unstructured":"Kang U, Tsourakakis C, Faloutsos C (2011) Pegasus: mining peta-scale graphs. Know Inf Syst 27: 303\u2013325","journal-title":"Know Inf Syst"},{"key":"452_CR25","unstructured":"Kondor RI, Lafferty JD (2002) Diffusion kernels on graphs and other discrete input spaces. In: Proceeding of 19th Int Conf Machine Learning, (ICML\u201902), pp 315\u2013322"},{"key":"452_CR26","unstructured":"Kukluk J, Holder LB, Cook DJ (2007) Learning node replacement graph grammars in metabolic pathways. In: Proceeding of Int Conf Bioinformat & Comput Biol (BIOCOMP-07), pp 44\u201350"},{"key":"452_CR27","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G (2004) An efficient algorithm for discovering frequent subgraphs. IEEE Trans Knowl Data Eng 16: 1038\u20131051","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"452_CR28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10115-009-0255-6","volume":"24","author":"B Long","year":"2010","unstructured":"Long B, Zhang Z, Yu P (2010) A general framework for relation graph clustering. Knowl Inf Syst 24(3): 393\u2013413","journal-title":"Knowl Inf Syst"},{"key":"452_CR29","doi-asserted-by":"crossref","unstructured":"Lowerre BT (1976) The HARPY speech recognition system. PhD thesis, Carnegie Mellon University, Pittsburgh","DOI":"10.1121\/1.2003089"},{"key":"452_CR30","doi-asserted-by":"crossref","unstructured":"Matsuda T, Horiuchi T, Motoda H, Washio T (2000) Extension of graph-based induction for general graph structured data. In: Terano T, Liu H, Chen ALP (eds) Proceeding of 4th Pacific-Asia Conf Know Dis Data Mining (PAKDD\u201900), volume 1805 of Lecture Notes in Computer Science, pp 420\u2013431. Springer, Berlin","DOI":"10.1007\/3-540-45571-X_49"},{"key":"452_CR31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10115-009-0251-x","volume":"25","author":"A Narasimhamurthy","year":"2010","unstructured":"Narasimhamurthy A, Greene D, Hurley N, Cunningham P (2010) Partitioning large networks without breaking communities. Know Inf Syst 25: 345\u2013369","journal-title":"Know Inf Syst"},{"key":"452_CR32","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceeding of 10th ACM SIGKDD Int Conf Knowl Disc & Data Min (KDD\u201904), pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"key":"452_CR33","unstructured":"Nijssen S, Kok JN (2006) Frequent subgraphs: runtimes don\u2019t say everything. In: Proceeding of 4th Int Conf Mining Learn Graphs (MLG\u201906), pp 173\u2013180"},{"key":"452_CR34","doi-asserted-by":"crossref","unstructured":"Noble C, Cook D (2003) Graph-based anomaly detection. In: Proceeding of 9th ACM SIGKDD Int Conf Knowl Disc Data Mining, pp 631\u2013636","DOI":"10.1145\/956750.956831"},{"key":"452_CR35","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10618-008-0109-y","volume":"17","author":"AN Papadopoulos","year":"2008","unstructured":"Papadopoulos AN, Lyritsis A, Manolopoulos Y (2008) SkyGraph: an algorithm for important subgraph discovery in relational graphs. Data Min Knowl Disc 17: 57\u201376","journal-title":"Data Min Knowl Disc"},{"issue":"3","key":"452_CR36","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10115-010-0289-9","volume":"26","author":"W Peng","year":"2011","unstructured":"Peng W, Li T (2011) Temporal relation co-clustering on directional social network and author-topic evolution. Knowl Inf Syst 26(3): 467\u2013486","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"452_CR37","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/TEVC.2007.910138","volume":"11","author":"RC Purshouse","year":"2007","unstructured":"Purshouse RC, Fleming PJ (2007) On the evolutionary optimisation of many conflicting objectives. IEEE Trans Evol Comput 11(6): 770\u2013784","journal-title":"IEEE Trans Evol Comput"},{"key":"452_CR38","first-page":"796","volume-title":"Advances in knowledge discovery and data mining, vol 5476 of Lecture Notes in Computer Science","author":"T Qian","year":"2009","unstructured":"Qian T, Srivastava J, Peng Z, Sheu P (2009) Simultaneously finding fundamental articles and new topics using a community tracking method. In: Thanaruk T, Boonserm K, Nick C, Tu-Bao H (eds) Advances in knowledge discovery and data mining, vol 5476 of Lecture Notes in Computer Science. Springer, Berlin, pp 796\u2013803"},{"issue":"12","key":"452_CR39","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1002\/asi.20904","volume":"59","author":"A Quirin","year":"2008","unstructured":"Quirin A, Cord\u00f3n \u00d3, Guerrero-Bote VP, Vargas-Quesada B, De Moya-Aneg\u00f3n F (2008) A quick MST-based algorithm to obtain Pathfinder networks. J Am Soc Inf Sci Technol 59(12): 1912\u20131924","journal-title":"J Am Soc Inf Sci Technol"},{"issue":"3","key":"452_CR40","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.joi.2010.01.004","volume":"4","author":"A Quirin","year":"2010","unstructured":"Quirin A, Cord\u00f3n \u00d3, Vargas-Quesada B, Moya-Anegon F (2010) Graph-based data mining: a new tool for the analysis and comparison of scientific domains represented as scientograms. J Informetr 4(3): 291\u2013312","journal-title":"J Informetr"},{"key":"452_CR41","doi-asserted-by":"crossref","unstructured":"Ranu S, Singh AK (2009) Graphsig: a scalable approach to mining significant subgraphs in large graph databases. In: Proceeding of 25th Int Conf Data Engg (ICDE\u201909), pp 844\u2013855, IEEE","DOI":"10.1109\/ICDE.2009.133"},{"key":"452_CR42","volume-title":"Stochastic complexity in statistical inquiry theory","author":"J Rissanen","year":"1989","unstructured":"Rissanen J (1989) Stochastic complexity in statistical inquiry theory. World Scientific Publishing Co Inc, River Edge"},{"issue":"6","key":"452_CR43","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/TEVC.2008.915995","volume":"12","author":"RC Romero-Zaliz","year":"2008","unstructured":"Romero-Zaliz RC, Rubio-Escudero C, Cobb JP, Herrera F, Zwir I (2008) A multiobjective evolutionary conceptual clustering methodology for gene annotation within structural databases: a case of study on the gene ontology database. IEEE Trans Evol Comput 12(6): 679\u2013701","journal-title":"IEEE Trans Evol Comput"},{"key":"452_CR44","doi-asserted-by":"crossref","unstructured":"Shelokar P, Quirin A, Cord\u00f3n \u00d3 (2010) A multiobjective variant of the subdue graph mining algorithm based on the NSGA-II selection mechanism. In: Proceeding of IEEE Congr Evol Comput (CEC\u201910), pp 463\u2013470","DOI":"10.1109\/CEC.2010.5586400"},{"key":"452_CR45","doi-asserted-by":"crossref","unstructured":"Shrivastava N, Majumder A, Rastogi R (2008) Mining (social) network graphs to detect random link attacks. In: IEEE 24th Int Conf Data Eng (ICDE\u201908), pp 486\u2013495","DOI":"10.1109\/ICDE.2008.4497457"},{"issue":"3","key":"452_CR46","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10115-010-0291-2","volume":"26","author":"C Tsourakakis","year":"2011","unstructured":"Tsourakakis C (2011) Counting triangles in real-world networks using projections. Knowl Inf Syst 26(3): 501\u2013520","journal-title":"Knowl Inf Syst"},{"key":"452_CR47","volume-title":"Visualizing the structure of science","author":"B Vargas-Quesada","year":"2007","unstructured":"Vargas-Quesada B, De Moya-Aneg\u00f3n F (2007) Visualizing the structure of science. Springer, New York"},{"key":"452_CR48","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceeding of IEEE Int Conf Data Min (ICDM\u201902), pp 721\u2013724"},{"key":"452_CR49","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: Proceeding of 9th ACM SIGKDD Int Conf Knowl Disc & Data Min (KDD\u201903), pp 286\u2013295","DOI":"10.1145\/956750.956784"},{"key":"452_CR50","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1142\/S0219622006002258","volume":"5","author":"Q Yang","year":"2006","unstructured":"Yang Q, Wu X (2006) 10 challenging problems in data mining research. Int J Inf Tech Decis 5: 597\u2013604","journal-title":"Int J Inf Tech Decis"},{"key":"452_CR51","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J, Yu PS (2007) gPrune: a constraint pushing framework for graph pattern mining. In: Proceeding of PAKDD Conference, pp 388\u2013400","DOI":"10.1007\/978-3-540-71701-0_38"},{"key":"452_CR52","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3: 257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"452_CR53","first-page":"173","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Thiele L, Deb K (2000) Comparison of multiobjective evolutionary algorithms: empirical results. IEEE Trans Evol Comput 8: 173\u2013195","journal-title":"IEEE Trans Evol Comput"},{"key":"452_CR54","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7: 117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0452-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-011-0452-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0452-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:22:30Z","timestamp":1639693350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-011-0452-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,17]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["452"],"URL":"https:\/\/doi.org\/10.1007\/s10115-011-0452-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,17]]}}}