Discovering informative connection subgraphs in multi-relational graphs
作者： Cartic Ramakrishnan , William H Milnor , Matthew Perry , Amit P Sheth , None
关键词: Of the form 、 Heuristics 、 Path (graph theory) 、 Computer science 、 RDF Schema 、 Information retrieval 、 Weighting 、 RDF 、 Ranking (information retrieval) 、 Indifference graph
摘要: Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency substructure or maximum flow is used measure the interestingness a pattern. this paper we introduce heuristics that guide subgraph algorithm away from banal paths towards more "informative" ones. Given RDF graph user might pose question form: "What are relevant ways which entity X related Y?" response connecting Y. We use our discover informative subgraphs within graphs. Our based on weighting mechanisms derived edge semantics suggested by schema. present analysis quality generated with respect path ranking metrics. then conclude presenting intuitions about schemes and produce higher subgraphs.
acm.org
core.ac.uk
kdd.org 
sci-hub.se 参考文章(21)
Krzysztof Kochut, John A. Miller, Satya S. Sahoo, Meenakshi Nagarajan, Christopher Thomas, William S. York, Amit P. Sheth, Xiaochuan Yi, Semantic Web Technology in Support of Bioinformatics for Glycan Expression ,(2004)
Matthew Perry, TOntoGen: A Synthetic Data Set Generator for Semantic Web Applications AIS SIGSEMIS Bulletin. ,vol. 2, pp. 46- ,(2005)
Boanerges Aleman-Meza, Chris Halaschek, Amit P Sheth, I Budak Arpinar, Gowtham Sannapareddy, None, SWETO: Large-Scale Semantic Web Test-bed pp. 490- 493 ,(2004)
S. Milgram, The Small World Problem Psychology today. ,vol. 1, pp. 60- 67 ,(1967)
Sougata Mukherjea, Bhuvan Bamba, BioPatentMiner: an information retrieval system for biomedical patents very large data bases. pp. 1066- 1077 ,(2004) , 10.1016/B978-012088469-8.50093-0
M. Kuramochi, G. Karypis, GREW - a scalable frequent subgraph discovery algorithm international conference on data mining. pp. 439- 442 ,(2004) , 10.1109/ICDM.2004.10024
Deng Cai, Zheng Shao, Xiaofei He, Xifeng Yan, Jiawei Han, Mining hidden community in heterogeneous social networks Proceedings of the 3rd international workshop on Link discovery - LinkKDD '05. pp. 58- 65 ,(2005) , 10.1145/1134271.1134280
CE Shennon, Warren Weaver, A mathematical theory of communication Bell System Technical Journal. ,vol. 27, pp. 379- 423 ,(1948) , 10.1002/J.1538-7305.1948.TB01338.X
David Gibson, Jon Kleinberg, Prabhakar Raghavan, Inferring Web communities from link topology acm conference on hypertext. pp. 225- 234 ,(1998) , 10.1145/276627.276652
Christos Faloutsos, Kevin S. McCurley, Andrew Tomkins, Fast discovery of connection subgraphs knowledge discovery and data mining. pp. 118- 127 ,(2004) , 10.1145/1014052.1014068