{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:30Z","timestamp":1750308150954,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"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":["SIGKDD Explor. Newsl."],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p>\n            Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper we introduce heuristics that guide a subgraph discovery algorithm away from banal paths towards more \"informative\" ones. Given an RDF graph a user might pose a question of the form:\n            <jats:italic>\"What are the most relevant ways in which entity X is related to entity Y?\"<\/jats:italic>\n            the response to which is a subgraph connecting\n            <jats:italic>X<\/jats:italic>\n            to\n            <jats:italic>Y.<\/jats:italic>\n            We use our heuristics to discover informative subgraphs within RDF graphs. Our heuristics are based on weighting mechanisms derived from edge semantics suggested by the RDF schema. We present an analysis of the quality of the subgraphs generated with respect to path ranking metrics. We then conclude presenting intuitions about which of our weighting schemes and heuristics produce higher quality subgraphs.\n          <\/jats:p>","DOI":"10.1145\/1117454.1117462","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"56-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Discovering informative connection subgraphs in multi-relational graphs"],"prefix":"10.1145","volume":"7","author":[{"given":"Cartic","family":"Ramakrishnan","sequence":"first","affiliation":[{"name":"University of Georgia, Athens GA"}]},{"given":"William H.","family":"Milnor","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens GA"}]},{"given":"Matthew","family":"Perry","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens GA"}]},{"given":"Amit P.","family":"Sheth","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens GA"}]}],"member":"320","published-online":{"date-parts":[[2005,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/775152.775250"},{"unstructured":"http:\/\/lsdis.cs.uga.edu\/projects\/semdis\/coi.  http:\/\/lsdis.cs.uga.edu\/projects\/semdis\/coi.","key":"e_1_2_1_2_1"},{"unstructured":"http:\/\/lsdis.cs.uga.edu\/projects\/semdis\/HS-brief.pdf.  http:\/\/lsdis.cs.uga.edu\/projects\/semdis\/HS-brief.pdf.","key":"e_1_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1103\/RevModPhys.74.47"},{"volume-title":"The Small World Problem. Psychology Today","year":"1967","author":"Milgram S.","key":"e_1_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1145\/1014052.1014068"},{"unstructured":"Lassila O. and R. R. Swick. Resource Description Framework (RDF) Model and Syntax Specification W3C Recommendation. 1999  Lassila O. and R. R. Swick. Resource Description Framework (RDF) Model and Syntax Specification W3C Recommendation. 1999","key":"e_1_2_1_7_1"},{"unstructured":"RDFS http:\/\/www.w3.org\/TR\/rdf-schema\/.  RDFS http:\/\/www.w3.org\/TR\/rdf-schema\/.","key":"e_1_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1145\/1060745.1060766"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1109\/MIC.2005.63"},{"volume-title":"Third IEEE International Conference on Data Mining (ICDM 2003","year":"2003","author":"Lin S.","key":"e_1_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/775152.775249"},{"volume-title":"S. and B. Bamba. BioPatentMiner. An Information Retrieval System for BioMedical Patents. In Thirtieth International Conference on Very Large Data Bases.","year":"2004","author":"Mukherjea","key":"e_1_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1145\/324133.324140"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1145\/956750.956784"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1145\/1014052.1014123"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.5555\/1032649.1033500"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.1109\/2.989932"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1145\/276627.276652"},{"volume-title":"AAAI.","year":"2004","author":"Adibi J.","key":"e_1_2_1_20_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1145\/1134271.1134280"},{"key":"e_1_2_1_22_1","first-page":"379","volume-title":"July and","author":"Shannon C. E.","year":"1948"},{"volume-title":"SWETO: Large-Scale Semantic Web Test-bed. In 16th International Conference on Software Engineering & Knowledge Engineering (SEKE2004)","year":"2004","author":"Aleman-Meza B.","key":"e_1_2_1_23_1"},{"volume-title":"TOntoGen: A Synthetic Data Set Generator for Semantic Web Applications. AIS SIGSEMIS Bulletin Volume, 46--48","year":"2005","author":"Perry M.","key":"e_1_2_1_24_1"},{"volume-title":"W3C Workshop on Semantic Web for Life Sciences. October 27--28","year":"2004","author":"Sheth A.","key":"e_1_2_1_25_1"}],"container-title":["ACM SIGKDD Explorations Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1117454.1117462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1117454.1117462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:45Z","timestamp":1750263525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1117454.1117462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1145\/1117454.1117462"],"URL":"https:\/\/doi.org\/10.1145\/1117454.1117462","relation":{},"ISSN":["1931-0145","1931-0153"],"issn-type":[{"type":"print","value":"1931-0145"},{"type":"electronic","value":"1931-0153"}],"subject":[],"published":{"date-parts":[[2005,12]]},"assertion":[{"value":"2005-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}