{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T07:24:45Z","timestamp":1778657085260,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014137","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"665-670","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Cluster-based concept invention for statistical relational learning"],"prefix":"10.1145","author":[{"given":"Alexandrin","family":"Popescul","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lyle H.","family":"Ungar","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007676901476"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/559636"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of Snowbird Learning Conference","author":"Foster Dean","year":"2002","unstructured":"Dean Foster and Lyle Ungar . A proposal for learning by ontological leaps . In Proc. of Snowbird Learning Conference , Snowbird, Utah , 2002 . Dean Foster and Lyle Ungar. A proposal for learning by ontological leaps. In Proc. of Snowbird Learning Conference, Snowbird, Utah, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04599-2_13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"Kaufman L.","year":"1990","unstructured":"L. Kaufman and P.J. Rousseeuw . Finding Groups in Data: An Introduction to Cluster Analysis . Wiley-Interscience , 1990 . L. Kaufman and P.J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience, 1990."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/567222.567233"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/567222.567236"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of ICML-2003","author":"Pavlov Dmitry","year":"2003","unstructured":"Dmitry Pavlov , Alexandrin Popescul , David M. Pennock , and Lyle H. Ungar . Mixtures of conditional maximum entropy models . In Proc. of ICML-2003 , 2003 . Dmitry Pavlov, Alexandrin Popescul, David M. Pennock, and Lyle H. Ungar. Mixtures of conditional maximum entropy models. In Proc. of ICML-2003, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956772"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/785907.785995"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037228"},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction to Modern Information Retrieval","author":"Salton G.","year":"1983","unstructured":"G. Salton and M.J. McGill . Introduction to Modern Information Retrieval . McGraw Hill , 1983 . G. Salton and M.J. McGill. Introduction to Modern Information Retrieval. McGraw Hill, 1983."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"Shapiro E.","year":"1983","unstructured":"E. Shapiro . Algorithmic Program Debugging . MIT Press , 1983 . E. Shapiro. Algorithmic Program Debugging. MIT Press, 1983."}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Seattle WA USA","acronym":"KDD04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:25Z","timestamp":1750264285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":15,"alternative-id":["10.1145\/1014052.1014137","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014137","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}