메뉴 건너뛰기




Volumn 611, Issue , 2010, Pages 18-29

A ranking-based approach to discover semantic associations between linked data

Author keywords

[No Author keywords available]

Indexed keywords

DIRECT SAMPLING; DOMAIN ONTOLOGIES; EXACT SOLUTION; LITERATURE-BASED DISCOVERIES; RANKING TECHNIQUE; REASONING ALGORITHMS; SCIENTIFIC DATA; SEMANTIC ASSOCIATIONS;

EID: 84889061298     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (26)
  • 1
    • 38049182514 scopus 로고    scopus 로고
    • Disease Ontology. http://diseaseontology.sourceforge.net.
    • Disease Ontology
  • 2
    • 84888992922 scopus 로고    scopus 로고
    • EHR Ontology. http://trajano.us.es./isabel/EHR/EHRRM.owl.
    • EHR Ontology
  • 3
    • 84924122981 scopus 로고    scopus 로고
    • Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments
    • D. Fogaras, B. Ŕacz, K. Csaloǵany, and T. Sarĺos. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2(3), 2005.
    • (2005) Internet Mathematics , vol.2 , Issue.3
    • Fogaras, D.1    Ŕacz, B.2    Csaloǵany, K.3    Sarĺos, T.4
  • 4
    • 33746689579 scopus 로고    scopus 로고
    • Introduction to the special issue on link mining
    • L. Getoor and C. P. Diehl. Introduction to the special issue on link mining. SIGKDD Explorations, 7(2), 2005.
    • (2005) SIGKDD Explorations , vol.7 , Issue.2
    • Getoor, L.1    Diehl, C.P.2
  • 7
    • 85136062624 scopus 로고    scopus 로고
    • Discovering and ranking semantic associations over a large rdf metabase
    • C. Halaschek-Wiener, B. Aleman-Meza, I. B. Arpinar, and A. P. Sheth. Discovering and ranking semantic associations over a large rdf metabase. In VLDB, pages 1317-1320, 2004.
    • (2004) VLDB , pp. 1317-1320
    • Halaschek-Wiener, C.1    Aleman-Meza, B.2    Arpinar, I.B.3    Sheth, A.P.4
  • 10
    • 29144474447 scopus 로고    scopus 로고
    • Mining coherent dense subgraphs across massive biological networks for functional discovery
    • H. Hu, X. Yan, Y. H. 0003, J. Han, and X. J. Zhou. Mining coherent dense subgraphs across massive biological networks for functional discovery. In ISMB (Supplement of Bioinformatics), pages 213-221, 2005.
    • (2005) ISMB (Supplement of Bioinformatics) , pp. 213-221
    • Hu, H.1    Yan, X.2    Han, J.3    Zhou, X.J.4
  • 12
    • 27944453480 scopus 로고    scopus 로고
    • Finding frequent patterns in a large sparse graph
    • M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov., 11(3):243-271, 2005.
    • (2005) Data Min. Knowl. Discov. , vol.11 , Issue.3 , pp. 243-271
    • Kuramochi, M.1    Karypis, G.2
  • 13
    • 84976841390 scopus 로고
    • A supplement to sampling-based methods for query size estimation in a database system
    • Y. Ling and W. Sun. A supplement to sampling-based methods for query size estimation in a database system. SIGMOD Record, 21(4):12-15, 1992.
    • (1992) SIGMOD Record , vol.21 , Issue.4 , pp. 12-15
    • Ling, Y.1    Sun, W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.