메뉴 건너뛰기




Volumn 2015-January, Issue , 2015, Pages 1471-1478

An ontology matching approach based on affinity-preserving random walks

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS; RANDOM PROCESSES; SEMANTICS;

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

References (29)
  • 2
    • 84891926899 scopus 로고    scopus 로고
    • String similarity metrics for ontology alignment
    • Springer
    • Michelle Cheatham and Pascal Hitzler. String similarity metrics for ontology alignment. In The Semantic Web-ISWC 2013, pages 294-309. Springer, 2013.
    • (2013) The Semantic Web-ISWC 2013 , pp. 294-309
    • Cheatham, M.1    Hitzler, P.2
  • 10
    • 0001009871 scopus 로고
    • An n5/2 algorithm for maximum matchings in bipartite graphs
    • John E Hopcroft and Richard M Karp. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on computing, 2(4):225-231, 1973.
    • (1973) SIAM Journal on Computing , vol.2 , Issue.4 , pp. 225-231
    • Hopcroft, J.E.1    Karp, R.M.2
  • 12
    • 84868590296 scopus 로고    scopus 로고
    • Codi: Combinatorial optimization for data integration-results for oaei 2011
    • Jakob Huber, Timo Sztyler, Jan Noessner, and Christian Meilicke. Codi: Combinatorial optimization for data integration-results for oaei 2011. Ontology Matching, page 134, 2011.
    • (2011) Ontology Matching , pp. 134
    • Huber, J.1    Sztyler, T.2    Noessner, J.3    Meilicke, C.4
  • 14
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • September
    • Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, September 1999.
    • (1999) J. ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1
  • 19
    • 0036205389 scopus 로고    scopus 로고
    • Similarity flooding: A versatile graph matching algorithm and its application to schema matching
    • Proceedings. 18th International Conference on IEEE
    • Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In Data Engineering, 2002. Proceedings. 18th International Conference on, pages 117-128. IEEE, 2002.
    • (2002) Data Engineering, 2002 , pp. 117-128
    • Melnik, S.1    Garcia-Molina, H.2    Rahm, E.3
  • 21
    • 84919644504 scopus 로고    scopus 로고
    • Yam++ - A combination of graph matching and Machine learning approach to ontology alignment task
    • DuyHoa Ngo, Zohra Bellahsene, et al. Yam++-a combination of graph matching and machine learning approach to ontology alignment task. Journal of Web Semantics, 16, 2012.
    • (2012) Journal of Web Semantics , vol.16
    • Ngo, D.H.1    Bellahsene, Z.2
  • 22
    • 85167438798 scopus 로고    scopus 로고
    • A probabilistic-logical framework for ontology matching
    • Mathias Niepert, Christian Meilicke, and Heiner Stuckenschmidt. A probabilistic-logical framework for ontology matching. In AAAI. Citeseer, 2010.
    • (2010) AAAI. Citeseer
    • Niepert, M.1    Meilicke, C.2    Stuckenschmidt, H.3
  • 29
    • 77954417260 scopus 로고    scopus 로고
    • Sample evaluation of ontology-matching systems
    • Willem Robert Van Hage, Antoine Isaac, and Zharko Aleksovski. Sample evaluation of ontology-matching systems. In EON, volume 2007, pages 41-50, 2007.
    • (2007) EON , vol.2007 , pp. 41-50
    • Van Hage, W.R.1    Isaac, A.2    Aleksovski, Z.3


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