{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:10:51Z","timestamp":1761401451685,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041792"},{"type":"electronic","value":"9783642041808"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_49","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:11:20Z","timestamp":1251360680000},"page":"485-500","source":"Crossref","is-referenced-by-count":2,"title":["Applying Electromagnetic Field Theory Concepts to Clustering with Constraints"],"prefix":"10.1007","author":[{"given":"Huseyin","family":"Hakkoymaz","sequence":"first","affiliation":[]},{"given":"Georgios","family":"Chatzimilioudis","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Asuncion, A., Newman, D.J.: UCI Machine Learning Repository"},{"key":"49_CR2","unstructured":"Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning distance function using equivalence relations. In: ICML 2003, Washington DC (August 2003)"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A Probabilistic Framework for Semi-Supervised Clustering. In: KDD 2004, Seattle, WA (August 2004)","DOI":"10.1145\/1014052.1014062"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating Constraints and Metric Learning in Semi-Supervised Clustering. In: ICML 2004, Canada, July 2004, pp. 81\u201388 (2004)","DOI":"10.1145\/1015330.1015360"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Brander, A., Sinclair, M.: A comparative study of k-shortest path algorithms. In: Proceedings of 11th UK Performance Engineering Workshop for Computer and Telecomm. Systems (1995)","DOI":"10.1007\/978-1-4471-1007-1_25"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Davidson, I., Wagstaff, K., Basu, S.: Measuring Constraint-Set Utility for Partitional Clustering Algorithms. In: Proceedings of the 17th European Conference on Machine Learning, Berlin, Germany, September 18-22 (2006)","DOI":"10.1007\/11871637_15"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: A fast kernel-based multilevel algorithm for graph clustering. In: Proceedings of ACM SIGKDD 2005, Chicago, Illinois, USA, August 21-24 (2005)","DOI":"10.1145\/1081870.1081948"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Gallagher, B., Tong, H., Eliassi-Rad, T., Faloutsos, C.: Using ghost edges for classifi-cation in sparsely labeled networks. In: KDD 2008, Las Vegas, NV, USA, August 24-27 (2008)","DOI":"10.1145\/1401890.1401925"},{"issue":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020(1), 359\u2013392 (1999)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"49_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, New York (1990)"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and Extracting Proximity in Networks. In: KDD 2006, Philadelphia, Pennsylvania, USA, August 20-23 (2006)","DOI":"10.1145\/1150402.1150432"},{"key":"49_CR12","unstructured":"Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering: a kernel approach. In: Proceedings of the 22nd international conference on Machine learning, Bonn, Germany, August 07-11, 2005, pp. 457\u2013464 (2005)"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Law, M.H.C., Topchy, A.P., Jain, A.K.: Model-based clustering with probabilistic constraints. In: SDM 2005 (2005)","DOI":"10.1137\/1.9781611972757.77"},{"key":"49_CR14","unstructured":"Lutz, H., Stocker, H., Harris, J.W.: Handbook of Physics, 1st edn., pp. 439\u2013444 (2002)"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Raytchev, B., Murase, H.: Unsupervised Face Recognition from Image Sequences Based on clustering with Attraction and Repulsion. In: CVPR 2001, vol.\u00a02, p. 25 (2001)","DOI":"10.1109\/CVPR.2001.990920"},{"key":"49_CR16","volume-title":"Applied Probability for Engineers and Scientists","author":"E. Suhir","year":"1997","unstructured":"Suhir, E.: Applied Probability for Engineers and Scientists. McGraw-Hill, New York (1997)"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.: Fast Random Walk with Restart and Its Applications. In: ICDM 2006, Hong Kong (2006)","DOI":"10.1109\/ICDM.2006.70"},{"key":"49_CR18","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained K-Means clustering with background knowledge. In: ICML 2001, pp. 577\u2013584 (2001)"},{"key":"49_CR19","unstructured":"Weber, R., Schek, H., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: VLDB 1998, New York, USA, pp. 194\u2013205 (1998)"},{"key":"49_CR20","volume-title":"Advances in NIPS","author":"E. Xing","year":"2002","unstructured":"Xing, E., Ng, A.Y., Jordan, M., Russell, S.: Distance metric learning, with app- lication to clustering with side-information. In: Advances in NIPS, vol.\u00a015. MIT Press, Cambridge (2002)"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: a structural clustering algorithm for networks. In: KDD 2007, San Jose, California, USA, August 12-15 (2007)","DOI":"10.1145\/1281192.1281280"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Yan, B., Domeniconi, C.: An Adaptive Kernel Method for Semi-supervised Clustering. In: Proc. of the 17th European Conference on Machine Learning, Berlin, Germany (September 2006)","DOI":"10.1007\/11871842_49"},{"key":"49_CR23","unstructured":"Klein, D., Kamvar, S.D., Manning, C.D.: From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering. In: Proc. of 19th Int. Conf. on Machine Learning 2002, San Francisco, CA, USA (2002)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04180-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:52:54Z","timestamp":1739310774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}