Show simple item record

dc.contributor.authorTanudjaja, Franciscoen_US
dc.contributor.authorMui, Liken_US
dc.date.accessioned2023-03-29T14:42:18Z
dc.date.available2023-03-29T14:42:18Z
dc.date.issued2001-05
dc.identifier.urihttps://hdl.handle.net/1721.1/149307
dc.description.abstractRecent advances in graph-based search techniques derived from Kleinberg's work [1] have been impressive. This paper further improves the graph-based search algorithm in two dimensions. Firstly, variants of Kleinberg's techniques do not take into account the semantics of the query string nor of the nodes being searched. As a result, polysemy of query words cannot be resolved. This paper presents an interactive query scheme utilizing the simple web ontology provided by the Open Directory Project to resolve meanings of a user query. Secondly, we extend a recently proposed personalized version of the Kleinberg algorithm [3]. Simulation results are presented to illustrate the sensitivity of our technique. We outline the implementation of our algorithm in the Persona personalized web search system.en_US
dc.relation.ispartofseriesMIT-LCS-TM-618
dc.titlePersona: A Contextualized and Personalized Web Searchen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record