{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T16:26:15Z","timestamp":1743783975343,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290374"},{"type":"electronic","value":"9783642290381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29038-1_16","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:57:38Z","timestamp":1333612658000},"page":"197-212","source":"Crossref","is-referenced-by-count":5,"title":["Semi-supervised Clustering of Graph Objects: A Subgraph Mining Approach"],"prefix":"10.1007","author":[{"given":"Xin","family":"Huang","sequence":"first","affiliation":[]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jiong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jeffery Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hongliang","family":"Fei","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: ICML, Williamstown, MA, pp. 577\u2013584 (June 2001)"},{"key":"16_CR2","unstructured":"Xing, E.P., Ng, A.Y., Jordan, M.I., Russell, S.: Distance metric learning, with application to clustering with side-information. In: NIPS, Vancouver, BC, pp. 505\u2013512 (December 2002)"},{"key":"16_CR3","unstructured":"Klein, D., Kamvar, S., Manning, C.: From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In: ICML, Sydney, Australia, pp. 307\u2013314 (July 2002)"},{"key":"16_CR4","unstructured":"Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning distance function using equivalence relations. In: ICML, Washington, DC, pp. 11\u201318 (August 2003)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A probabilistic framework for semi-supervised clustering. In: KDD, Seattle, WA, pp. 59\u201368 (August 2004)","DOI":"10.1145\/1014052.1014062"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by scalable leap search. In: SIGMOD, Vancouver, Canada, pp. 433\u2013444 (June 2008)","DOI":"10.1145\/1376616.1376662"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ranu, S., Singh, A.K.: GraphSig: A scalable approach to mining significant subgraphs in large graph databases. In: ICDE, Shanghai, China, pp. 844\u2013855 (March 2009)","DOI":"10.1109\/ICDE.2009.133"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Jin, N., Young, C., Wang, W.: GAIA: graph classification using evolutionary computation. In: SIGMOD, Indianapolis, IN, pp. 879\u2013890 (June 2010)","DOI":"10.1145\/1807167.1807262"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Kong, X., Yu, P.S.: Semi-supervised feature selection for graph classification. In: KDD, Washington, DC, pp. 793\u2013802 (July 2010)","DOI":"10.1145\/1835804.1835905"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering: A kernel approach. In: ICML, Bonn, Germany, pp. 457\u2013464 (August 2005)","DOI":"10.1145\/1102351.1102409"},{"issue":"8","key":"16_CR11","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E\u00a069, 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: A structural clustering algorithm for networks. In: KDD, San Jose, CA, pp. 824\u2013833 (August 2007)","DOI":"10.1145\/1281192.1281280"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S.: Scalable graph clustering using stochastic flows: Applications to community discovery. In: KDD, Paris, France, pp. 737\u2013746 (June 2009)","DOI":"10.1145\/1557019.1557101"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","first-page":"13","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"1998","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: \u017bytkow, J.M. (ed.) PKDD 1998. LNCS, vol.\u00a01510, pp. 13\u201323. Springer, Heidelberg (1998)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM, San Jose, CA, pp. 313\u2013320 (November 2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"16_CR17","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM, Maebashi, Japan, pp. 721\u2013724 (December 2002)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: ICDM, Melbourne, FL, pp. 549\u2013552 (November 2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.: A quickstart in frequent structure mining can make a difference. In: KDD, Seattle, WA, pp. 647\u2013652 (August 2004)","DOI":"10.1145\/1014052.1014134"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29038-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:12Z","timestamp":1742911752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29038-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290374","9783642290381"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29038-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}