메뉴 건너뛰기




Volumn , Issue , 2014, Pages 426-431

Structured web search in small domain

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; INFORMATION RETRIEVAL SYSTEMS; NEAREST NEIGHBOR SEARCH; PATTERN RECOGNITION; SCALES (WEIGHING INSTRUMENTS); WEBSITES;

EID: 84921762578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCITechn.2014.6997348     Document Type: Conference Paper
Times cited : (1)

References (10)
  • 1
    • 0037213089 scopus 로고    scopus 로고
    • An information-Theoretic perspective of tf-idf measures
    • January
    • A. Aizawa. An information-Theoretic perspective of tf-idf measures. Information Processing & Management, 39(1):45-65, January 2003.
    • (2003) Information Processing & Management , vol.39 , Issue.1 , pp. 45-65
    • Aizawa, A.1
  • 3
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual web search engine
    • April
    • S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst., 30(1-7):107-117, April 1998.
    • (1998) Comput. Netw. ISDN Syst. , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 5
    • 0016939390 scopus 로고
    • The distance-weighted k-nearest-neighbor rule
    • S. A. Dudani. The distance-weighted k-nearest-neighbor rule. SMC-6:325-327, 1976.
    • (1976) SMC , vol.6 , pp. 325-327
    • Dudani, S.A.1
  • 6
    • 33745213314 scopus 로고    scopus 로고
    • Clustering versus faceted categories for information exploration
    • M. Hearst. Clustering versus faceted categories for information exploration. Communications of the ACM, 49(4):59-61, 2006.
    • (2006) Communications of the ACM , vol.49 , Issue.4 , pp. 59-61
    • Hearst, M.1
  • 8
    • 0016572913 scopus 로고
    • A vector space model for automatic indexing
    • November
    • G. M. Salton, A. K. C. Wong, and C.-S. Yang. A Vector Space Model for Automatic Indexing. Communications of the ACM, 18(11):613-620, November 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.11 , pp. 613-620
    • Salton, G.M.1    Wong, A.K.C.2    Yang, C.-S.3
  • 9
    • 0032094249 scopus 로고    scopus 로고
    • Optimal multi-step k-nearest neighbor search
    • ACM Press
    • T. Seidl and H.-P. Kriegel. Optimal multi-step k-nearest neighbor search. In SIGMOD Conference, pages 154-165. ACM Press, 1998.
    • (1998) SIGMOD Conference , pp. 154-165
    • Seidl, T.1    Kriegel, H.-P.2


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