{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:58Z","timestamp":1725490438146},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749752"},{"type":"electronic","value":"9783540749769"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74976-9_47","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T10:52:35Z","timestamp":1188384755000},"page":"462-470","source":"Crossref","is-referenced-by-count":1,"title":["Pruning Relations for Substructure Discovery of Multi-relational Databases"],"prefix":"10.1007","author":[{"given":"Hongyu","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herna L.","family":"Viktor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Paquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Berka, P.: Guide to the financial data set. In: Siebes, A., Berka, P. (eds.) PKDD 2000 Discovery Challenge (2000)"},{"issue":"1-2","key":"47_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H. Blockeel","year":"1998","unstructured":"Blockeel, H., Raedt, L.D.: Top-down induction of first-order logical decision trees. Artificial Intelligence\u00a0101(1-2), 285\u2013297 (1998)","journal-title":"Artificial Intelligence"},{"key":"47_CR3","volume-title":"Theory of Psychological Measurement","author":"E.E. Ghiselli","year":"1964","unstructured":"Ghiselli, E.E.: Theory of Psychological Measurement. McGrawHill Company, New York (1964)"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Guo, H., Viktor, H.L.: Mining relational data through correlation-based multiple view validation. In: KDD 2006, pp. 567\u2013573, New York, USA (2006)","DOI":"10.1145\/1150402.1150469"},{"key":"47_CR5","unstructured":"Habrard, A., Bernard, M., Sebban, M.: Detecting irrelevant subtrees to improve probabilistic learning from tree-structured data. Fundamenta Informaticae: Special Issue on Mining Graphs, Trees and Sequences (2005)"},{"key":"47_CR6","unstructured":"Hall, M.: Correlation-based feature selection for machine learning, Ph.D thesis, department of computer science, university of waikato, new zealand (1998)"},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-540-27811-5_8","volume-title":"Key Technologies for Data Management","author":"R. Hamill","year":"2004","unstructured":"Hamill, R., Martin, N.: Database support for path query functions. In: Williams, H., MacKinnon, L.M. (eds.) Key Technologies for Data Management. LNCS, vol.\u00a03112, pp. 84\u201399. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"47_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R. Kohavi","year":"1997","unstructured":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial Intelligence\u00a097(1-2), 273\u2013324 (1997)","journal-title":"Artificial Intelligence"},{"key":"47_CR9","unstructured":"Krogel, M.-A.: On Propositionalization for Knowledge Discovery in Relational Databases. PhD thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (2005)"},{"key":"47_CR10","volume-title":"Numerical recipes in C: the art of scientific computing","author":"W.H. Press","year":"1988","unstructured":"Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical recipes in C: the art of scientific computing. Cambridge University Press, Cambridge (1988)"},{"key":"47_CR11","volume-title":"C4.5: programs for machine learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Singh, L., Getoor, L., Licamele, L.: Pruning social networks using structural properties and descriptive attributes. In: ICDM 2005, pp. 773\u2013776 (2005)","DOI":"10.1109\/ICDM.2005.125"},{"key":"47_CR13","unstructured":"Yin, X., Han, J., Yang, J., Yu, P.S.: Crossmine: Efficient classification across multiple database relations. In: ICDE 2004, Boston (2004)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74976-9_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:50:19Z","timestamp":1619520619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74976-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749752","9783540749769"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74976-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}