{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:46Z","timestamp":1742914006903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030298586"},{"type":"electronic","value":"9783030298593"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29859-3_7","type":"book-chapter","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T16:03:53Z","timestamp":1566835433000},"page":"73-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Network Motif Discovery by Learning Techniques"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4221-7297","authenticated-orcid":false,"given":"Bogdan-Eduard-M\u0103d\u0103lin","family":"Mursa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2363-5757","authenticated-orcid":false,"given":"Anca","family":"Andreica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6339-1622","authenticated-orcid":false,"given":"Laura","family":"Dio\u015fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"issue":"5439","key":"7_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TSMCB.2011.2167144","volume":"42","author":"U Bhowan","year":"2012","unstructured":"Bhowan, U., Johnston, M., Zhang, M.: Developing new fitness functions in genetic programming for classification with unbalanced data. IEEE Trans. Syst. Man Cybern. Part B Cybern. 42, 406\u2013421 (2012). https:\/\/doi.org\/10.1109\/TSMCB.2011.2167144","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, pp. 785\u2013794. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"key":"7_CR4","unstructured":"Coutinho, B., et al.: The Network Behind the Cosmic Web. http:\/\/cosmicweb.kimalbrecht.com"},{"key":"7_CR5","first-page":"3133","volume":"15","author":"M Fernandez-Delgado","year":"2014","unstructured":"Fernandez-Delgado, M., Cernadas, E., Barro, S., Amorim, D.: Do we need hundreds of classifiers to solve real world classification problems? J. Mach. Learn. Res. 15, 3133\u20133181 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"JA Grochow","year":"2007","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 92\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71681-5_7"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.3390\/molecules22122194","volume":"22","author":"J Hu","year":"2017","unstructured":"Hu, J., Shang, X.: Detection of network motif based on a novel graph canonization algorithm from transcriptional regulation networks. Molecules 22, 2194 (2017). https:\/\/doi.org\/10.3390\/molecules22122194","journal-title":"Molecules"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/978-3-319-11104-9_130","volume-title":"Proceedings of the 4th International Conference on Computer Engineering and Networks","author":"X Jin","year":"2015","unstructured":"Jin, X., Li, J., Zhang, L.: Online social networks based on complex network theory and simulation analysis. In: Wong, W.E. (ed.) Proceedings of the 4th International Conference on Computer Engineering and Networks, pp. 1129\u20131138. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-11104-9_130"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani, Z.R.M., et al.: Kavosh: a new algorithm for finding network motifs. BMC Bioinform. 10, 318 (2009)","journal-title":"BMC Bioinform."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics (Oxford, England) 20, 1746\u20131758 (2004)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Kunegis, J., Preusse, J.: Fairness on the web: alternatives to the power law. In: Proceedings of the 3rd Annual ACM Web Science Conference, WebSci 2012, pp. 175\u2013184, June 2012. https:\/\/doi.org\/10.1145\/2380718.2380741","DOI":"10.1145\/2380718.2380741"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298, 824\u2013827 (2002)","journal-title":"Science"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Mursa, B.E.M., Andreica, A., Laura, D.: Parallel acceleration of subgraph enumeration in the process of network motif detection. In: 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2018)","DOI":"10.1109\/SYNASC.2018.00039"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Mursa, B.E.M., Andreica, A., Laura, D.: An empirical analysis of the correlation between the motifs frequency and the topological properties of complex networks. In: 23rd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems (2019)","DOI":"10.1016\/j.procs.2019.09.188"},{"key":"7_CR15","unstructured":"Mursa, B.E.M., Andreica, A., Laura, D.: Study of connection between articulation points and network motifs in complex networks. In: Proceedings of the 27th European Conference on Information Systems (ECIS) (2019)"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1093\/comnet\/cnv005","volume":"3","author":"Rogier Noldus","year":"2015","unstructured":"Noldus, R., Van Mieghem, P.: Assortativity in complex networks. J. Complex Netw. 2015 (2015). https:\/\/doi.org\/10.1093\/comnet\/cnv005","journal-title":"Journal of Complex Networks"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1266\/ggs.84.385","volume":"84","author":"S Omidi","year":"2009","unstructured":"Omidi, S., Schreiber, F., Masoudi-Nejad, A.: MODA: an efficient algorithm for network motif discovery in biological networks. Genes Genet. Syst. 84, 385\u2013395 (2009)","journal-title":"Genes Genet. Syst."},{"key":"7_CR18","series-title":"Computer Communications and Networks","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-96746-2_1","volume-title":"Practical Social Network Analysis with Python","author":"PM Krishna Raj","year":"2018","unstructured":"Krishna Raj, P.M., Mohan, A., Srinivasa, K.G.: Basics of graph theory. Practical Social Network Analysis with Python. CCN, pp. 1\u201323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96746-2_1"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1038\/ng881","volume":"31","author":"S Shen-Orr","year":"2002","unstructured":"Shen-Orr, S., Milo, R., Mangan, S., Alon, U.: Network motifs in the transcriptional regulation network of escherichiacoli. Nat. Genet. 31, 1061\u20134036 (2002)","journal-title":"Nat. Genet."},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Svenson, P.: Complex networks and social network analysis in information fusion. In: 2006 9th International Conference on Information Fusion, pp. 1\u20137, August 2006. https:\/\/doi.org\/10.1109\/ICIF.2006.301554","DOI":"10.1109\/ICIF.2006.301554"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Van Hulse, J., Khoshgoftaar, T., Napolitano, A.: Experimental perspectives on learning from imbalanced data, vol. 227, pp. 935\u2013942, January 2007. https:\/\/doi.org\/10.1145\/1273496.1273614","DOI":"10.1145\/1273496.1273614"},{"key":"7_CR22","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841356.301","volume-title":"The Structure and Dynamics of Networks","author":"Duncan J. Watts","year":"2011","unstructured":"Watts, D.H. Strogatz, S.: Collective dynamics of \u2018small-world\u2019 networks. In: The Structure and Dynamics of Networks, December 2011. https:\/\/doi.org\/10.1515\/9781400841356.301"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11557067_14","volume":"3692","author":"S Wernicke","year":"2005","unstructured":"Wernicke, S.: A faster algorithm for detecting network motifs. Algorithms Bioniform. Proc. 3692, 165\u2013177 (2005)","journal-title":"Algorithms Bioniform. Proc."}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29859-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:08:51Z","timestamp":1710266931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29859-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030298586","9783030298593"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29859-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Le\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.haisconference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"134","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}