Information Retrieval systems can be improved by exploiting context information such as user and document features. This article presents a model based on overlapping probabilistic...
Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't g...
We study the extraction of characteristics of user behavior in video session encoded as stochastic matrices of finite Markov chain. These behaviors are clustered using a dissimil...
This paper describes a scalable Web server array architecture which uses a caching policy called Probability Based Replacement (PBR) algorithm [5, 6]. The server array consists of...
Users of Web search engines are often forced to sift through the long ordered list of document “snippets” returned by the engines. The IR community has explored document cluste...