메뉴 건너뛰기




Volumn , Issue , 2008, Pages 394-399

Comparing the conceptual graphs extracted from patent claims

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; GRAPH THEORY; LABELING; MULTI AGENT SYSTEMS; SENSORS; TIME DOMAIN ANALYSIS; UBIQUITOUS COMPUTING;

EID: 50949086975     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUTC.2008.87     Document Type: Conference Paper
Times cited : (6)

References (12)
  • 1
    • 0034482891 scopus 로고    scopus 로고
    • Conceptual Graphs and First Order Logic
    • G. Amati, I. Ounis, "Conceptual Graphs and First Order Logic", The Computer Journal, 43, 2000, pp.1-12.
    • (2000) The Computer Journal , vol.43 , pp. 1-12
    • Amati, G.1    Ounis, I.2
  • 3
    • 4544358689 scopus 로고
    • Comparisons of Attributed Graph Matching Algorithms for Computer Vision
    • University of Oulu
    • H. Kalviainen, E. Oja, "Comparisons of Attributed Graph Matching Algorithms for Computer Vision", STeP-90 Finnish Artificial Intelligence Symposium, University of Oulu, 1990, pp. 354-368.
    • (1990) STeP-90 Finnish Artificial Intelligence Symposium , pp. 354-368
    • Kalviainen, H.1    Oja, E.2
  • 5
  • 6
    • 0003975659 scopus 로고
    • Reasoning and the Logic of Things
    • Ed. by K. L. Kremer, Harvard Univ. Press, Cambridge
    • C.S. Peirce, Reasoning and the Logic of Things. The Cambridge Conferences Lectures of 1898. Ed. by K. L. Kremer, Harvard Univ. Press, Cambridge, 1992
    • (1898) The Cambridge Conferences Lectures of
    • Peirce, C.S.1
  • 7
    • 0036663707 scopus 로고    scopus 로고
    • Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    • J. Raymond, P. Willen, "Maximum common subgraph isomorphism algorithms for the matching of chemical structures", Journal of Computer-Aided Molecular Design, 16, 2002, pp. 521-533.
    • (2002) Journal of Computer-Aided Molecular Design , vol.16 , pp. 521-533
    • Raymond, J.1    Willen, P.2
  • 11
    • 10844289527 scopus 로고    scopus 로고
    • XML Application Schema Matching Using Similarity Measure and Relaxation Labeling
    • S. Yi, B. Huang, W.T. Chan, "XML Application Schema Matching Using Similarity Measure and Relaxation Labeling", Information Sciences, 169, 2005, pp. 27-46.
    • (2005) Information Sciences , vol.169 , pp. 27-46
    • Yi, S.1    Huang, B.2    Chan, W.T.3
  • 12
    • 50949116503 scopus 로고    scopus 로고
    • Extract Conceptual Graphs from Plain Texts in
    • Patent Claims, The 6th Mexican International Conference on Artificial Intelligence, November 4-10, 2007 Post Presentation, 400-407
    • S.Y. Yang and V.W. Soo, "Extract Conceptual Graphs from Plain Texts in Patent Claims", The 6th Mexican International Conference on Artificial Intelligence, November 4-10, 2007 (Post Presentation). 400-407
    • Yang, S.Y.1    Soo, V.W.2


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