메뉴 건너뛰기




Volumn 27, Issue 9, 1994, Pages 1231-1247

Rulegraphs for graph matching in pattern recognition

Author keywords

A* search; Classification; Evidence Based Systems; Feature indexing; Graph matching; Machine learning; Pattern recognition; Relational structures; Structural descriptions; Subgraph isomorphism

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; INDEXING (OF INFORMATION); KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS;

EID: 0028496648     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(94)90007-8     Document Type: Article
Times cited : (36)

References (37)
  • 15
    • 0025673487 scopus 로고
    • Computational aspects of a branch and bound algorithm for quadratic zero-one programming
    • (1990) Computing , vol.45 , pp. 131-144
    • Pardalos1    Rodgers2
  • 35
    • 84911315160 scopus 로고    scopus 로고
    • W. F. Bischof and T. Caelli, Learning structural descriptions of patterns: A new technique for conditional clustering and rule generation, Pattern Recognition (in press).


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