메뉴 건너뛰기




Volumn 2652, Issue , 2003, Pages 935-942

Graph representations for web document clustering

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; PATTERN RECOGNITION;

EID: 23044443416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44871-6_108     Document Type: Article
Times cited : (21)

References (11)
  • 1
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • Bunke, H. and Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19 (1998) 255-259
    • (1998) Pattern Recognition Letters , vol.19 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 3
    • 0035339250 scopus 로고    scopus 로고
    • A graph distance metric combining maximum common subgraph and minimum common supergraph
    • Fernández, M.-L. and Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters 22 (2001) 753-758
    • (2001) Pattern Recognition Letters , vol.22 , pp. 753-758
    • Fernández, M.-L.1    Valiente, G.2
  • 6
    • 84950632109 scopus 로고
    • Objective criteria for the evaluation of clustering methods
    • Rand, W. M.: Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association 66 (1971) 846-850
    • (1971) Journal of the American Statistical Association , vol.66 , pp. 846-850
    • Rand, W.M.1
  • 11
    • 0014976008 scopus 로고
    • Graph-theoretical methods for detecting and describing gestalt structures
    • Zahn, C. T.: Graph-theoretical methods for detecting and describing gestalt structures. IEEE Transactions on Computers C-20 (1971) 68-86
    • (1971) IEEE Transactions on Computers C-20 , pp. 68-86
    • Zahn, C.T.1


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