메뉴 건너뛰기




Volumn 142, Issue , 2008, Pages 211-220

Interactive cluster-based personalized retrieval on large document collections

Author keywords

[No Author keywords available]

Indexed keywords


EID: 52049086921     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-68127-4_22     Document Type: Article
Times cited : (3)

References (24)
  • 2
    • 33344460924 scopus 로고    scopus 로고
    • Modeling user interests by conceptual clustering
    • Godoy, D., Amandi, A.: Modeling user interests by conceptual clustering. Information Systems 31, 247-265 (2006)
    • (2006) Information Systems , vol.31 , pp. 247-265
    • Godoy, D.1    Amandi, A.2
  • 3
    • 0031168547 scopus 로고    scopus 로고
    • Learning and revising user profiles: The identification of interesting Web sites
    • Perkowitz, M., Etzioni, O.: Learning and revising user profiles: The identification of interesting Web sites. Machine learning 27, 313-331 (1998)
    • (1998) Machine learning , vol.27 , pp. 313-331
    • Perkowitz, M.1    Etzioni, O.2
  • 5
    • 0036891555 scopus 로고    scopus 로고
    • Discovering User Communities on the Internet Using Unsupervised Machine Learning Techniques
    • Paliouras, G., Papatheodorou, C., Karkaletsis, V., Spyropoulos, C.D.: Discovering User Communities on the Internet Using Unsupervised Machine Learning Techniques. Interacting with Computers 14(6), 761-791 (2002)
    • (2002) Interacting with Computers , vol.14 , Issue.6 , pp. 761-791
    • Paliouras, G.1    Papatheodorou, C.2    Karkaletsis, V.3    Spyropoulos, C.D.4
  • 9
    • 34250173827 scopus 로고    scopus 로고
    • Exploiting parallelism to support scalable hierarchical clustering
    • Cathey, R., Jensen, E., Beitzel, S., Frieder, O., Grossman, D.: Exploiting parallelism to support scalable hierarchical clustering. JASIST 58(8), 1207-1221 (2007)
    • (2007) JASIST , vol.58 , Issue.8 , pp. 1207-1221
    • Cathey, R.1    Jensen, E.2    Beitzel, S.3    Frieder, O.4    Grossman, D.5
  • 20
    • 35048899401 scopus 로고    scopus 로고
    • Dash, M., Petrutiu, S., Sheuermann, P.: Efficient Parallel Hierarchical Clustering. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, 3149. Springer, Heidelberg (2004)
    • Dash, M., Petrutiu, S., Sheuermann, P.: Efficient Parallel Hierarchical Clustering. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149. Springer, Heidelberg (2004)
  • 21
    • 52049123005 scopus 로고    scopus 로고
    • Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Zaki, M.J., Ho, C.-T. (eds.) KDD 1999. LNCS (LNAI), 1759, pp. 245-260. Springer, Heidelberg (2000)
    • Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Zaki, M.J., Ho, C.-T. (eds.) KDD 1999. LNCS (LNAI), vol. 1759, pp. 245-260. Springer, Heidelberg (2000)
  • 22
  • 23
    • 0029358115 scopus 로고
    • Parallel algorithm for hierarchical clustering
    • Olson, C.: Parallel algorithm for hierarchical clustering. Parallel Computing 21 (1995)
    • (1995) Parallel Computing , vol.21
    • Olson, C.1


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