{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:59Z","timestamp":1725892019631},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334917"},{"type":"electronic","value":"9783642334924"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33492-4_23","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T09:06:10Z","timestamp":1350896770000},"page":"284-298","source":"Crossref","is-referenced-by-count":5,"title":["Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Okubo","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[]},{"given":"Etsuji","family":"Tomita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S.D. Bay","year":"2001","unstructured":"Bay, S.D., Pazzani, M.J.: Detecting Group Differences: Mining Contrast Sets. Data Mining and Knowledge Discovery\u00a05(3), 213\u2013246 (2001)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"23_CR2","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding Community Structure in Networks Using the Eigenvectors of Matrices. Phys. Rev. E 74(3), 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T. Uno","year":"2010","unstructured":"Uno, T.: An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. Algorithmica\u00a056, 3\u201316 (2010)","journal-title":"Algorithmica"},{"key":"23_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-92695-5_4","volume-title":"Learning and Intelligent Optimization","author":"M. Brunato","year":"2008","unstructured":"Brunato, M., Hoos, H.H., Battiti, R.: On Effectively Finding Maximal Quasi-cliques in Graphs. In: Maniezzo, V., Battiti, R., Watson, J.-P. (eds.) LION 2007 II. LNCS (LNAI), vol.\u00a05313, pp. 41\u201355. Springer, Heidelberg (2008)"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G. Dong","year":"2005","unstructured":"Dong, G., Li, J.: Mining Border Descriptions of Emerging Patterns from Dataset Pairs. Knowledge and Info. Systems\u00a08(2), 178\u2013202 (2005)","journal-title":"Knowledge and Info. Systems"},{"key":"23_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-88425-5_45","volume-title":"Rough Sets and Current Trends in Computing","author":"P. Terlecki","year":"2008","unstructured":"Terlecki, P., Walczak, K.: Efficient Discovery of Top-K Minimal Jumping Emerging Patterns. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol.\u00a05306, pp. 438\u2013447. Springer, Heidelberg (2008)"},{"issue":"4","key":"23_CR7","first-page":"40","volume":"5","author":"H. Ito","year":"2009","unstructured":"Ito, H. and Iwama, K.: Enumeration of Isolated Cliques and Pseudo-Cliques. ACM Transactions on Algorithms 5(4), Article 40 (2009)","journal-title":"ACM Transactions on Algorithms"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: Clique Relaxation Models in Social Network Analysis. In: Thai, M.T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks: Communication and Social Networks. Springer Optimization and Its Applications, vol.\u00a058, pp. 143\u2013162 (2012)","DOI":"10.1007\/978-1-4614-0857-4_5"},{"key":"23_CR9","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann (2011)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04180-8_25","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Berlingerio","year":"2009","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining Graph Evolution Rules. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS, vol.\u00a05781, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Ozaki, T., Etoh, M.: Correlation and Contrast Link Formation Patterns in a Time Evolving Graph. In: Proc. of the 2011 IEEE 11th Int\u2019l Conf. on Data Mining Workshops, ICDMW 2011, pp. 1147\u20131154 (2011)","DOI":"10.1109\/ICDMW.2011.55"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Robardet, C.: Constraint-Based Pattern Mining in Dynamic Graphs. In: Proc. of the 2009 Ninth IEEE Int\u2019l Conf. on Data Mining - ICDM 2009, pp. 950 - 955 (2009)","DOI":"10.1109\/ICDM.2009.99"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Li, Z., Xiong, H., Liu, Y.: Mining Blackhole and Volcano Patterns in Directed Graphs: A General Approach. In: Data Mining and Knowledge Discovery, pp. 1\u201326. Springer (2012)","DOI":"10.1007\/s10618-012-0255-0"},{"issue":"9","key":"23_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457 - Finding All Cliques of an Undirected Graph. Communications of the ACM\u00a016(9), 575\u2013577 (1973)","journal-title":"Communications of the ACM"},{"key":"23_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-77018-3_47","volume-title":"Emerging Technologies in Knowledge Discovery and Data Mining","author":"B. Wu","year":"2007","unstructured":"Wu, B., Pei, X.: A Parallel Algorithm for Enumerating All the Maximal k-Plexes. In: Washio, T., Zhou, Z.-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K.-C., Freire, M.M. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04819, pp. 476\u2013483. Springer, Heidelberg (2007)"},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.engappai.2006.01.006","volume":"19","author":"T. Taniguchi","year":"2006","unstructured":"Taniguchi, T., Haraguchi, M.: Discovery of Hidden Correlations in a Local Transaction Database Based on Differences of Correlations. Engineering Application of Artificial Intelligence\u00a019(4), 419\u2013428 (2006)","journal-title":"Engineering Application of Artificial Intelligence"},{"key":"23_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-31537-4_9","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"A. Li","year":"2012","unstructured":"Li, A., Haraguchi, M., Okubo, Y.: Top-N Minimization Approach for Indicative Correlation Change Mining. In: Perner, P. (ed.) MLDM 2012. LNCS (LNAI), vol.\u00a07376, pp. 102\u2013116. Springer, Heidelberg (2012)"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S.B. Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A Graph Theoretic Generalization of the Clique Concept. Journal of Mathematical Sociology\u00a06, 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments. Theoretical Computer Science\u00a0363(1), 28\u201342 (2006)","journal-title":"Theoretical Computer Science"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing All Maximal Cliques in Large Sparse Real-World Graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 364\u2013375. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33492-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:12:17Z","timestamp":1620130337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33492-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334917","9783642334924"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33492-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}