메뉴 건너뛰기




Volumn , Issue , 2007, Pages 121-130

A new suffix tree similarity measure for document clustering

Author keywords

Document model; Similarity measure; Suffix tree

Indexed keywords

CLUSTERING ALGORITHMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; WORLD WIDE WEB;

EID: 35348888014     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1242572.1242590     Document Type: Conference Paper
Times cited : (89)

References (27)
  • 5
    • 0024050355 scopus 로고
    • A new distance metric on strings computable in linear time
    • A. Ehrenfeucht and D. Haussier. A new distance metric on strings computable in linear time. Discrete Applied Math, 40, 1988.
    • (1988) Discrete Applied Math , vol.40
    • Ehrenfeucht, A.1    Haussier, D.2
  • 6
    • 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. Algorithmica, 19(3):331-353, 1997.
    • (1997) Algorithmica , vol.19 , Issue.3 , pp. 331-353
    • Giegerich, R.1    Kurtz, S.2
  • 10
    • 35348892824 scopus 로고    scopus 로고
    • Fast and effective text mining using linear-time document clustering
    • San Diego, CA, USA
    • B. Larsen and C. Aone. Fast and effective text mining using linear-time document clustering. In Proceedings of the KDD-99 Workshop, San Diego, CA, USA.
    • Proceedings of the KDD-99 Workshop
    • Larsen, B.1    Aone, C.2
  • 11
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
    • (1993) SIAM Journal on Computing , vol.22 , Issue.5 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 12
    • 0007251181 scopus 로고
    • The collaboratory notebook: A distributed knowledge-building environment for project-enhanced learning
    • Vancouver, BC
    • D. K. O'Neill and L. M. Gomez. The collaboratory notebook: A distributed knowledge-building environment for project-enhanced learning. In Proceedings of Ed-Meida'94, Vancouver, BC, 1994.
    • (1994) Proceedings of Ed-Meida'94
    • O'Neill, D.K.1    Gomez, L.M.2
  • 17
    • 33749028201 scopus 로고    scopus 로고
    • A suffix tree approach to anti-spam email filtering
    • B. M. Rajesh Pampapathi and M. Levene. A suffix tree approach to anti-spam email filtering. Machine Learning, 65, 2006.
    • (2006) Machine Learning , vol.65
    • Rajesh Pampapathi, B.M.1    Levene, M.2
  • 19
    • 0016572913 scopus 로고
    • A vector space model for automatic indexing
    • G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Communication of ACM, 18(11):613-620, 1975.
    • (1975) Communication of ACM , vol.18 , Issue.11 , pp. 613-620
    • Salton, G.1    Wong, A.2    Yang, C.S.3
  • 20
    • 35348815788 scopus 로고    scopus 로고
    • D. S. Sven Meyer zu Eissen and M. Potthast. The suffix tree document model revisited. In Proceedings of the 5th International Conference on Knowledge Management, pages 596-603, 2005.
    • D. S. Sven Meyer zu Eissen and M. Potthast. The suffix tree document model revisited. In Proceedings of the 5th International Conference on Knowledge Management, pages 596-603, 2005.
  • 21
    • 0001704377 scopus 로고
    • On-line construction of suffix trees
    • E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3): 249-260, 1995.
    • (1995) Algorithmica , vol.14 , Issue.3 , pp. 249-260
    • Ukkonen, E.1
  • 23
    • 3543147086 scopus 로고
    • Recent trends in hierarchic document clustering: A critical review
    • P. Willett. Recent trends in hierarchic document clustering: a critical review. Information Processing and Management, 24(5):577-597, 1988.
    • (1988) Information Processing and Management , vol.24 , Issue.5 , pp. 577-597
    • Willett, P.1
  • 25
    • 0038632285 scopus 로고    scopus 로고
    • Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus
    • M. Yamamoto and K. W. Church. Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus. Computational Linguistics, 27(1):1-30, 2001.
    • (2001) Computational Linguistics , vol.27 , Issue.1 , pp. 1-30
    • Yamamoto, M.1    Church, K.W.2
  • 26
    • 0032268443 scopus 로고    scopus 로고
    • Web document clustering: A feasibility demonstration
    • University of Washington, Seattle, USA
    • O. Zamir and O. Etzioni. Web document clustering: A feasibility demonstration. In Proceedings of SIGIR'98, University of Washington, Seattle, USA, 1998.
    • (1998) Proceedings of SIGIR'98
    • Zamir, O.1    Etzioni, O.2
  • 27
    • 0033294891 scopus 로고    scopus 로고
    • Computer Networks (Amsterdam, Netherlands: 1999)
    • 31(11-16):1361-1374
    • O. Zamir and O. Etzioni. Grouper: a dynamic clustering interface to Web search results. Computer Networks (Amsterdam, Netherlands: 1999), 31(11-16):1361-1374, 1999.
    • (1999)
    • Zamir, O.1    Etzioni, O.2


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