{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:46:54Z","timestamp":1760597214773},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_18","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"139-148","source":"Crossref","is-referenced-by-count":13,"title":["An EM-Approach for Clustering Multi-Instance Objects"],"prefix":"10.1007","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[]},{"given":"Alexey","family":"Pryakhin","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Schubert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(96)00034-3","volume":"89","author":"T. Dietterich","year":"1997","unstructured":"Dietterich, T., Lathrop, R., Lozano-Perez, T.: Solving the multiple instance problem with axis-parallel rectangles. Artificial Intelligence\u00a089, 31\u201371 (1997)","journal-title":"Artificial Intelligence"},{"key":"18_CR2","unstructured":"Kriegel, H.P., Schubert, M.: Classification of websites as sets of feature vectors. In: Proc. IASTED Int. Conf. on Databases and Applications (DBA 2004), Innsbruck, Austria (2004)"},{"key":"18_CR3","unstructured":"Zhou, Z.H.: Multi-Instance Learning: A Survey. Technical Report, AI Lab, Computer Science a. Technology Department, Nanjing University, Nanjing, China (2004)"},{"key":"18_CR4","unstructured":"Ruffo, G.: Learning single and multiple instance decision tree for computer security applications. PhD thesis, Department of Computer Science, University of Turin, Torino, Italy (2000)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-39857-8_42","volume-title":"Machine Learning: ECML 2003","author":"N. Weidmann","year":"2003","unstructured":"Weidmann, N., Frank, E., Pfahringer, B.: A two-level learning method for generalized multi-instance problems. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) ECML 2003. LNCS, vol.\u00a02837, pp. 468\u2013479. Springer, Heidelberg (2003)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s002360050075","volume":"34","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Mannila, H.: Distance Measures for Point Sets and Their Computation. Acta Informatica\u00a034, 103\u2013133 (1997)","journal-title":"Acta Informatica"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/PL00013304","volume":"37","author":"J. Ramon","year":"2001","unstructured":"Ramon, J., Bruynooghe, M.: A polynomial time computable metric between points sets. Acta Informatica\u00a037, 765\u2013780 (2001)","journal-title":"Acta Informatica"},{"key":"18_CR8","volume-title":"Data Mining Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001)"},{"key":"18_CR9","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. Int. Conf. on Knowledge Discovery and Data Mining (KDD), pp. 291\u2013316 (1996)"},{"key":"18_CR10","unstructured":"G\u00e4rtner, T., Flach, P., Kowalczyk, A., Smola, A.: Multi-Instance Kernels, pp. 179\u2013186 (2002)"},{"key":"18_CR11","unstructured":"Ng, R., Han, J.: Efficient and Effective Clustering Methods for Spatial Data Mining. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 144\u2013155 (1994)"},{"key":"18_CR12","unstructured":"Wang, J., Zucker, J.: Solving Multiple-Instance Problem: A Lazy Learning Approach, pp. 1119\u20131125 (2000)"},{"key":"18_CR13","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Academic Press, London (2001)"},{"key":"18_CR14","unstructured":"Fayyad, U., Reina, C., Bradley, P.: Initialization of Iterative Refinement Clustering Algorithms. In: Proc. Int. Conf. on Knowledge Discovery in Databases (KDD) (1998)"},{"key":"18_CR15","unstructured":"Smyth, P.: Clustering using monte carlo cross-validation. In: KDD, pp. 126\u2013133 (1996)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1147\/sj.402.0426","volume":"40","author":"J.T.L. Wang","year":"2001","unstructured":"Wang, J.T.L., Ma, Q., Shasha, D., Wu, C.H.: New techniques for extracting features from protein sequences. IBM Syst. J.\u00a040, 426\u2013441 (2001)","journal-title":"IBM Syst. J."},{"key":"18_CR17","unstructured":"Newman, D.J., Hettich, S., Blake, C., Merz, C.: UCI repository of machine learning databases (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11731139_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:33Z","timestamp":1619506293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11731139_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}