{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:07:18Z","timestamp":1740287238844,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138171"},{"type":"electronic","value":"9783642138188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13818-8_15","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T16:58:03Z","timestamp":1277398683000},"page":"178-195","source":"Crossref","is-referenced-by-count":3,"title":["DESSIN: Mining Dense Subgraph Patterns in a Single Graph"],"prefix":"10.1007","author":[{"given":"Shirong","family":"Li","sequence":"first","affiliation":[]},{"given":"Shijie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jiong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bader, G., Hogue, C.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics\u00a04(2) (2003)","DOI":"10.1186\/1471-2105-4-2"},{"key":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is Frequent in a Single Graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 858\u2013863. Springer, Heidelberg (2008)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Chang, R., Podgurski, A., Yang, J.: Finding what\u2019s not there: a new approach to revealing neglected conditions in software. In: International symposium on software testing and analysis (2007)","DOI":"10.1145\/1273463.1273486"},{"key":"15_CR4","unstructured":"Dehaspe, L., Toivonen, H., King, R.: Finding frequent substructures in chemical compounds. In: Proc. of KDD, New York, NY, USA (1998)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Fan, W., Zhang, K., Cheng, H., Yan, X., Han, J., Yu, P., Verscheure, O.: Direct mining of discriminative and essential frequent patterns via model-based search tree. In: Proc. of KDD, Las Vegas, Nevada, USA, pp. 230\u2013238 (2008)","DOI":"10.1145\/1401890.1401922"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: Proc. of ICDMW, pp. 399\u2013404 (2007)","DOI":"10.1109\/ICDMW.2007.74"},{"key":"15_CR7","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering Large Dense Subgraphs in Massive Graphs. In: Proc. of VLDB, Trondheim, Norway, pp. 721\u2013732 (2005)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Hasan, M., Chaoji, V., Salem, S., Besson, J., Zaki, M.: ORIGAMI: Mining Representative Orthogonal Graph Patterns. In: Proc. of ICDM, pp. 153\u2013162 (2007)","DOI":"10.1109\/ICDM.2007.45"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.: Mining coherent dense subgraphs across massive biological networks for functional discovery. In: Proc. of ISMB (Supplement of Bioinformatics), pp. 213\u2013221 (2005)","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proc. of ICDM, Melbourne, Florida, USA, pp. 549\u2013552 (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: Proc. of SIGKDD, Seattle, WA, USA, pp. 581\u2013586 (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proc. of Principles of Data Mining and Knowledge Discovery, pp. 13\u201323 (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Ketkar, N., Holder, L., Cook, D.: Subdue: compression-based frequent pattern discovery in graph data. In: Proc. of the 1st international workshop on open source data mining: frequent pattern mining implementations, Chicago, Illinois, USA, pp. 71\u201376 (2005)","DOI":"10.1145\/1133905.1133915"},{"issue":"16","key":"15_CR14","first-page":"3401","volume":"21","author":"M. Koyuturk","year":"2004","unstructured":"Koyuturk, M., Grama, A., Szpankowski, W.: An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics\u00a021(16), 3401\u20133408 (2004)","journal-title":"Bioinformatics"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of ICDE, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"15_CR16","first-page":"243","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. DMKD\u00a011(3), 243\u2013271 (2005)","journal-title":"DMKD"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0378-8733(01)00042-9","volume":"23","author":"J. Moody","year":"2001","unstructured":"Moody, J.: Peer Influence Groups: Identifying Dense Clusters in Large Networks. Social Networks\u00a023, 261\u2013283 (2001)","journal-title":"Social Networks"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.: A quick start in frequent structure mining can make a difference. In: Proc. of KDD, Seattle, WA, US, pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Palmer, C., Gibbons, P., Faloutsos, C.: ANF: A fast and scalable tool for data mining in massive graphs. In: Proc. of KDD, Edmonton, Alberta, Canada, pp. 81\u201390 (2002)","DOI":"10.1145\/775047.775059"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Proc. of KDD, Chicago, Illinois, USA (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Thomas, L., Valluri, S., Karlapalem, K.: MARGIN:Maximal Frequent Subgraph Mining. In: Proc. of ICDM, pp. 1097\u20131101 (2006)","DOI":"10.1109\/ICDM.2006.102"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Zeng, Z., Zhou, L.: CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases. In: Proc. of ICDE, vol.\u00a073 (2006)","DOI":"10.1109\/ICDE.2006.34"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Wang, N., Parthasarathy, S., Tan, K., Tung, A.: CSV: Visualizing and Mining Cohesive Subgraphs. In: Proc. of SIGMOD (2008)","DOI":"10.1145\/1376616.1376663"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.: Mining significant graph patterns by leap search. In: Prof. of SIGMOD, Vancouver, Canada, pp. 433\u2013444 (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: TreePi: a novel graph indexing method. In: Proc. of ICDE (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: Distance index base subgraph matching in biological networks. In: Proc. of EDBT (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, J., Li, S.: RING: an integrated method for frequent representative subgraph mining. In: Proc. of ICDM (2009)","DOI":"10.1109\/ICDM.2009.96"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Wang, J., Zhou, L., Karypis, G.: Coherent closed quasi-clique discovery from large dense graph databases. In: Proc. of KDD, Philadelphia, PA, USA, pp. 797\u2013802 (2006)","DOI":"10.1145\/1150402.1150506"},{"key":"15_CR29","unstructured":"Gene Ontology, http:\/\/www.geneontology.org\/"},{"key":"15_CR30","unstructured":"Social Network, http:\/\/www-personal.umich.edu\/~mejn\/netdata\/"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13818-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T06:30:11Z","timestamp":1740205811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13818-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138171","9783642138188"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13818-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}