File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2939672.2939815
- Scopus: eid_2-s2.0-84985031091
- WOS: WOS:000485529800172
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Meta structure: Computing relevance in large heterogeneous information networks
Title | Meta structure: Computing relevance in large heterogeneous information networks |
---|---|
Authors | |
Issue Date | 2016 |
Publisher | ACM Press. |
Citation | The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2016), San Francisco, 13-17 August 2016. In Conference Proceedings, 2016, p. 1595-1604 How to Cite? |
Abstract | A heterogeneous information network (HIN) is a graph model in which objects and edges are annotated with types. Large and complex databases, such as YAGO and DBLP, can be modeled as HINs. A fundamental problem in HINs is the computation of closeness, or relevance, between two HIN objects. Relevance measures can be used in various applications, including entity resolution, recommendation, and information retrieval. Several studies have investigated the use of HIN information for relevance computation, however, most of them only utilize simple structure, such as path, to measure the similarity between objects. In this paper, we propose to use meta structure, which is a directed acyclic graph of object types with edge types connecting in between, to measure the proximity between objects. The strength of meta structure is that it can describe complex relationship between two HIN objects (e.g., two papers in DBLP share the same authors and topics). We develop three relevance measures based on meta structure. Due to the computational complexity of these measures, we further design an algorithm with data structures proposed to support their evaluation. Our extensive experiments on YAGO and DBLP show that meta structure-based relevance is more effective than state-of-the-art approaches, and can be efficiently computed. © 2016 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/229723 |
ISBN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Z | - |
dc.contributor.author | Zheng, Y | - |
dc.contributor.author | Cheng, RCK | - |
dc.contributor.author | Sun, Y | - |
dc.contributor.author | Mamoulis, N | - |
dc.contributor.author | Li, X | - |
dc.date.accessioned | 2016-08-23T14:12:53Z | - |
dc.date.available | 2016-08-23T14:12:53Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2016), San Francisco, 13-17 August 2016. In Conference Proceedings, 2016, p. 1595-1604 | - |
dc.identifier.isbn | 978-1-4503-4232-2 | - |
dc.identifier.uri | http://hdl.handle.net/10722/229723 | - |
dc.description.abstract | A heterogeneous information network (HIN) is a graph model in which objects and edges are annotated with types. Large and complex databases, such as YAGO and DBLP, can be modeled as HINs. A fundamental problem in HINs is the computation of closeness, or relevance, between two HIN objects. Relevance measures can be used in various applications, including entity resolution, recommendation, and information retrieval. Several studies have investigated the use of HIN information for relevance computation, however, most of them only utilize simple structure, such as path, to measure the similarity between objects. In this paper, we propose to use meta structure, which is a directed acyclic graph of object types with edge types connecting in between, to measure the proximity between objects. The strength of meta structure is that it can describe complex relationship between two HIN objects (e.g., two papers in DBLP share the same authors and topics). We develop three relevance measures based on meta structure. Due to the computational complexity of these measures, we further design an algorithm with data structures proposed to support their evaluation. Our extensive experiments on YAGO and DBLP show that meta structure-based relevance is more effective than state-of-the-art approaches, and can be efficiently computed. © 2016 ACM. | - |
dc.language | eng | - |
dc.publisher | ACM Press. | - |
dc.relation.ispartof | Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'16 | - |
dc.title | Meta structure: Computing relevance in large heterogeneous information networks | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Cheng, RCK: ckcheng@cs.hku.hk | - |
dc.identifier.email | Mamoulis, N: nikos@cs.hku.hk | - |
dc.identifier.authority | Cheng, RCK=rp00074 | - |
dc.identifier.authority | Mamoulis, N=rp00155 | - |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1145/2939672.2939815 | - |
dc.identifier.scopus | eid_2-s2.0-84985031091 | - |
dc.identifier.hkuros | 262981 | - |
dc.identifier.spage | 1595 | - |
dc.identifier.epage | 1604 | - |
dc.identifier.isi | WOS:000485529800172 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 160919 | - |