메뉴 건너뛰기




Volumn , Issue , 2008, Pages 117-126

Generating links by mining quotations

Author keywords

Automatic hypertext; Digital libraries; Hypertext; Link generation; Quotations

Indexed keywords

DIGITAL ARITHMETIC; HYPERTEXT SYSTEMS; LIBRARIES; USER INTERFACES;

EID: 57349180452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1379092.1379117     Document Type: Conference Paper
Times cited : (24)

References (23)
  • 1
    • 0008989930 scopus 로고    scopus 로고
    • Special issue on methods and tools for the automatic construction of hypertext
    • March
    • M. Agosti and J. Allan. Special issue on methods and tools for the automatic construction of hypertext. Information Processing and Management, 33(2), March 1997.
    • (1997) Information Processing and Management , vol.33 , Issue.2
    • Agosti, M.1    Allan, J.2
  • 2
    • 0031098964 scopus 로고    scopus 로고
    • On the use of information retrieval techniques for the automatic construction of hypertext
    • March
    • M. Agosti, F. Crestani, and M. Melucci. On the use of information retrieval techniques for the automatic construction of hypertext. Information Processing and Management, 33(2): 133-144, March 1997.
    • (1997) Information Processing and Management , vol.33 , Issue.2 , pp. 133-144
    • Agosti, M.1    Crestani, F.2    Melucci, M.3
  • 4
    • 0002698813 scopus 로고    scopus 로고
    • On the resemblance and containment of documents
    • A. Z. Broder. On the resemblance and containment of documents. In SEQS: Sequences '91, 1998.
    • (1998) SEQS: Sequences '91
    • Broder, A.Z.1
  • 5
    • 0004278262 scopus 로고    scopus 로고
    • Syntactic clustering of the web
    • Technical report, Digial Systems Research Center, Palo Alto, California, USA, July
    • A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. Technical report, Digial Systems Research Center, Palo Alto, California, USA, July 1997.
    • (1997)
    • Broder, A.Z.1    Glassman, S.C.2    Manasse, M.S.3    Zweig, G.4
  • 7
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. Communications of the ACM, 51(1):107-113, 2008.
    • (2008) Communications of the ACM , vol.51 , Issue.1 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 8
    • 84885639910 scopus 로고    scopus 로고
    • Detecting phrase-level duplication on the world wide web
    • Salvador, Brazil, August
    • D. Fetterly, M. Manasse, and M. Najork. Detecting phrase-level duplication on the world wide web. In Proceedings of the ACM SIGIR '05, Salvador, Brazil, August 2005.
    • (2005) Proceedings of the ACM SIGIR '05
    • Fetterly, D.1    Manasse, M.2    Najork, M.3
  • 10
    • 0345120055 scopus 로고    scopus 로고
    • Inter-linker consistency in the manual construction of hypertext documents
    • J. Furrier, D. Ellis, and P. Willett. Inter-linker consistency in the manual construction of hypertext documents, ACM Comput. Surv., page 18, 1999.
    • (1999) ACM Comput. Surv , pp. 18
    • Furrier, J.1    Ellis, D.2    Willett, P.3
  • 11
    • 0001553729 scopus 로고    scopus 로고
    • From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
    • R. Giegerich and S. Kurtz. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithrnica, 19(3):331-353, 1997.
    • (1997) Algorithrnica , vol.19 , Issue.3 , pp. 331-353
    • Giegerich, R.1    Kurtz, S.2
  • 13
    • 25144488073 scopus 로고    scopus 로고
    • Anatomy of aggregate collections
    • September
    • B. Lavoie, L. S. Connaway, and L. Dempsey. Anatomy of aggregate collections. D-Lib Magazine, 11(9), September 2005.
    • (2005) D-Lib Magazine , vol.11 , Issue.9
    • Lavoie, B.1    Connaway, L.S.2    Dempsey, L.3
  • 14
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • April
    • E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, April 1976.
    • (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 262-272
    • McCreight, E.M.1
  • 16
    • 85015564457 scopus 로고    scopus 로고
    • Xanalogical structure, needed now more than ever: Parallel documents, deep links to content, deep versioning, and deep re-use
    • December
    • T. H. Nelson. Xanalogical structure, needed now more than ever: Parallel documents, deep links to content, deep versioning, and deep re-use. ACM Computing Surveys, 31(4), December 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.4
    • Nelson, T.H.1
  • 22
    • 0001704377 scopus 로고
    • On-line construction of suffix trees
    • E. Ukkonen. On-line construction of suffix trees. Algorithrmica, 14(3):249-260, 1995.
    • (1995) Algorithrmica , vol.14 , Issue.3 , pp. 249-260
    • Ukkonen, E.1


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