메뉴 건너뛰기




Volumn 6075 LNCS, Issue , 2010, Pages 171-182

A personalized graph-based document ranking model using a semantic user profile

Author keywords

[No Author keywords available]

Indexed keywords

COMMON SUBGRAPH; CROSSLINKS; DISTANCE MEASURE; DOCUMENT RANKING; GRAPH-BASED; PERSONALIZED SEARCH; RANKING MODEL; SEARCH RESULTS; SUPERGRAPH; TWO-GRAPHS; USER INFORMATION NEED; USER PROFILE; WEB ONTOLOGY;

EID: 77954607409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13470-8_17     Document Type: Conference Paper
Times cited : (33)

References (15)
  • 3
    • 3543077102 scopus 로고    scopus 로고
    • Anatomy and empirical evaluation of an adaptive web-based information filtering system
    • Micarelli, A., Sciarrone, F.: Anatomy and empirical evaluation of an adaptive web-based information filtering system. User Modeling and User-Adapted Interaction 14(2-3), 159-200 (2004)
    • (2004) User Modeling and User-Adapted Interaction , vol.14 , Issue.2-3 , pp. 159-200
    • Micarelli, A.1    Sciarrone, F.2
  • 8
    • 71949088437 scopus 로고    scopus 로고
    • Towards a graph based user profile modeling for a session-based personalized search
    • Daoud, M., Tamine, L., Boughanem, M.: Towards a graph based user profile modeling for a session-based personalized search. Knowledge and Information Systems 21(3), 365-398 (2009)
    • (2009) Knowledge and Information Systems , vol.21 , Issue.3 , pp. 365-398
    • Daoud, M.1    Tamine, L.2    Boughanem, M.3
  • 10
    • 70349921290 scopus 로고    scopus 로고
    • Personalized document ranking: Exploiting evidence from multiple user interests for profiling and retrieval
    • Tamine-Lechani, L., Boughanem, M., Zemirli, N.: Personalized document ranking: exploiting evidence from multiple user interests for profiling and retrieval. Digital Information Management 6(5), 354-365 (2008)
    • (2008) Digital Information Management , vol.6 , Issue.5 , pp. 354-365
    • Tamine-Lechani, L.1    Boughanem, M.2    Zemirli, N.3
  • 12
    • 51249191195 scopus 로고
    • A note on the derivation of maximal common subgraphs of two directed or undirected graphs
    • Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9(4), 341-354 (1973)
    • (1973) Calcolo , vol.9 , Issue.4 , pp. 341-354
    • Levi, G.1
  • 13
    • 0035339250 scopus 로고    scopus 로고
    • A graph distance metric combining maximum common subgraph and minimum common supergraph
    • Fernández, M.L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters 22(6-7), 753-758 (2001)
    • (2001) Pattern Recognition Letters , vol.22 , Issue.6-7 , pp. 753-758
    • Fernández, M.L.1    Valiente, G.2
  • 14
    • 77954618310 scopus 로고    scopus 로고
    • A new error-correcting distance for attributed relational graph problems
    • Amin, A., Pudil, P., Ferri, F., Iñesta, J.M. (eds.) SPR 2000 and SSPR 2000. Springer, Heidelberg
    • El-Sonbaty, Y., Ismail, M.A.: A new error-correcting distance for attributed relational graph problems. In: Amin, A., Pudil, P., Ferri, F., Iñesta, J.M. (eds.) SPR 2000 and SSPR 2000. LNCS, vol. 1876, pp. 266-276. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1876 , pp. 266-276
    • El-Sonbaty, Y.1    Ismail, M.A.2
  • 15
    • 0043283912 scopus 로고    scopus 로고
    • On the minimum common supergraph of two graphs
    • Bunke, H., Jiang, X., Kandel, A.: On the minimum common supergraph of two graphs. Computing 65(1), 13-25 (2000)
    • (2000) Computing , vol.65 , Issue.1 , pp. 13-25
    • Bunke, H.1    Jiang, X.2    Kandel, A.3


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