{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:18:46Z","timestamp":1759133926194},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292449"},{"type":"electronic","value":"9783540316657"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564126_40","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"404-416","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Classification from Multiple Heterogeneous Databases"],"prefix":"10.1007","author":[{"given":"Xiaoxin","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Blockeel, H., Raedt, L.D.: Top-down induction of logical decision trees. In: Artificial Intelligence (1998)","DOI":"10.1016\/S0004-3702(98)00034-4"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Clark, P., Boswell, R.: Rule induction with CN2: Some recent improvements. European Working Session on Learning (1991)","DOI":"10.1007\/BFb0017011"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Ng, V.T., Fu, A.W., Fu, Y.: Efficient Mining of Association Rules in Distributed Databases. TKDE (1996)","DOI":"10.1109\/69.553158"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Dasu, T., Johnson, T., Muthukrishnan, S., Shkapenyuk, V.: Mining Database Structure; Or, How to Build a Data Quality Browser. SIGMOD (2002)","DOI":"10.1145\/564716.564719"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Dhamankar, R., Lee, Y., Doan, A., Halevy, A., Domingos, P.: iMAP: Discovering Complex Semantic Matches between Database Schemas. SIGMOD (2004)","DOI":"10.1145\/1007568.1007612"},{"key":"40_CR6","volume-title":"Introduction to the Theory of Neural Computation","author":"J. Hertz","year":"1991","unstructured":"Hertz, J., Palmer, R., Krogh, A.: Introduction to the Theory of Neural Computation. Addison-Wesley, Reading (1991)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. TKDE (2004)","DOI":"10.1109\/TKDE.2004.45"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 36. Springer, Heidelberg (2000)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Muggleton, S.: Inverse entailment and progol. In: New Generation Computing, Special issue on Inductive Logic Programming (1995)","DOI":"10.1007\/BF03037227"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Quinlan, J.R., Cameron-Jones, R.M.: FOIL: A midterm report. In: European Conf. Machine Learning (1993)","DOI":"10.1007\/3-540-56602-3_124"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Rahm, E., Bernstein, P.A.: A Survey of Approaches to Automatic Schema Matching. VLDB Journal (2001)","DOI":"10.1007\/s007780100057"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In: KDD (2002)","DOI":"10.1145\/775047.775142"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-Preserving K-Means Clustering over Vertically Partitioned Data. In: KDD (2003)","DOI":"10.1145\/956750.956776"},{"key":"40_CR14","unstructured":"Yin, X., Han, J., Yang, J., Yu, P.S.: CrossMine: Efficient Classification Across Multiple Database Relations. In: ICDE (2004)"},{"key":"40_CR15","volume-title":"Handbook of data mining and knowledge discovery","author":"W. Zhang","year":"2002","unstructured":"Zhang, W.: Search techniques. In: Handbook of data mining and knowledge discovery. Oxford University Press, Oxford (2002)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T08:35:17Z","timestamp":1683275717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11564126_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}