Filters








661 Hits in 5.3 sec

Design and evaluation of improvement method on the Web information navigation - a stochastic search approach

B.P.-C. Yen, Y.-W. Wan
2003 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the  
In this paper, a Web site was modeled as a Markov chain associated with the corresponding dynamic traffic and designated information pages.  ...  We consider four models: inexperienced surfers on guidance-less sites, experienced surfers on guidance-less sites, sites with the mean-length guidance, and sites with the known-first-arc guidance (generalized  ...  Acknowledgement It is a pleasure to thank Ms. Jenny Zhong for implementing part of the system in the case study during her stay at HKUST. This research is partially sponsored by Taran  ... 
doi:10.1109/hicss.2003.1174476 dblp:conf/hicss/YenW03 fatcat:ylfietftwbftbpdka23v2aox4a

SubRank: Subgraph Embeddings via a Subgraph Proximity Measure [chapter]

Oana Balalau, Sagar Goyal
2020 Lecture Notes in Computer Science  
In this work, we propose a subgraph to subgraph proximity measure as a building block for a subgraph embedding framework.  ...  Representation learning for graph data has gained a lot of attention in recent years.  ...  We can interpret Eq. 1 using random walks, as follows: Alice is a random surfer in the subgraph S i , Bob is a random surfer in the subgraph S j , and Carol is a random surfer in graph G.  ... 
doi:10.1007/978-3-030-47426-3_38 fatcat:vmlzxbllr5eitledrbrfwfe6ka

Freshness matters

Na Dai, Brian D. Davison
2010 Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '10  
We quantify web page freshness over time from page and in-link activity, and design a web surfer model that incorporates web freshness, based on a temporal web graph composed of multiple web snapshots  ...  However, traditional link-based web ranking algorithms typically run on a single web snapshot without concern for user activities associated with the dynamics of web pages and links.  ...  This work was supported in part by a grant from the National Science Foundation under award IIS-0803605 and an equipment grant from Sun Microsystems.  ... 
doi:10.1145/1835449.1835471 dblp:conf/sigir/DaiD10 fatcat:nvwhiq4sb5eqngmu6s4ynqjszu

Design and evaluation of improvement method on the web information navigation – A stochastic search approach

Benjamin P.-C. Yen, Y.-W. Wan
2010 Decision Support Systems  
We consider four models of information retrieval based on combination of the level of skill or experience of the surfers as well as the degree of navigation support by the sites.  ...  Alternatively, improvement can be made by giving direct guidance to the surfers in navigating the Web sites.  ...  The explorative expansion approach for conditional reverse link is based on the graph traversal (either breath first or depth first search) on a link by link basis.  ... 
doi:10.1016/j.dss.2009.12.004 fatcat:ajys4hhkifaqlp3kezqha4xaha

On Top-k Structural Similarity Search

Pei Lee, Laks V.S. Lakshmanan, Jeffrey Xu Yu
2012 2012 IEEE 28th International Conference on Data Engineering  
The only known approaches for answering such queries are either a naive algorithm of computing the similarity matrix for all node pairs or computing the similarity vector by comparing the query node v  ...  Two heuristic algorithms, Trun-TopSim-SM and Prio-TopSim-SM, are also proposed to approximate TopSim-SM on scale-free graphs to trade accuracy for speed, based on truncated random walk and prioritizing  ...  Adapting TopSim Family Algorithms to P-Rank Random surfers in SimRank only follow backward links, but in P-Rank, random surfers will follow both forward and backward links.  ... 
doi:10.1109/icde.2012.109 dblp:conf/icde/LeeLY12 fatcat:xmqfvltghjfbhhiyqocbnm2xpm

An efficient similarity search framework for SimRank over large dynamic graphs

Yingxia Shao, Bin Cui, Lei Chen, Mingming Liu, Xing Xie
2015 Proceedings of the VLDB Endowment  
In this paper, we propose a novel two-stage random-walk sampling framework (TSF) for SimRank-based similarity search (e.g., top-k search).  ...  During the query stage, TSF can search similar vertices fast by naturally pruning unqualified vertices based on the connectivity of one-way graphs.  ...  INTRODUCTION SimRank [14] is a general link-based similarity measure. Its definition is inspired by the observation that is "objects related to similar objects are also similar".  ... 
doi:10.14778/2757807.2757809 fatcat:kxltrqvpgramfbznz7b3ahcodm

T-Rank: Time-Aware Authority Ranking [chapter]

Klaus Berberich, Michalis Vazirgiannis, Gerhard Weikum
2004 Lecture Notes in Computer Science  
Time -and thus the freshness of web content and link structure -emanates as a factor that should be taken into account in link analysis when computing the importance of a page.  ...  Analyzing the link structure of the web for deriving a page's authority and implied importance has deeply affected the way information providers create and link content, the ranking in web search engines  ...  A random surfer traverses the web graph by either following outgoing links or by randomly jumping to another node.  ... 
doi:10.1007/978-3-540-30216-2_11 fatcat:lbzd74v2qve7rhdaavlet2tro4

Towards expert finding by leveraging relevant categories in authority ranking

Hengshu Zhu, Huanhuan Cao, Hui Xiong, Enhong Chen, Jilei Tian
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
Then, we provide a link analysis approach for ranking user authority by considering the information in both the target category and the relevant categories.  ...  In this paper, we propose a novel framework for expert finding based on the authority information in the target category as well as the relevant categories.  ...  Its basic idea is similar to the "random surfer" process described in PageRank model and the special property is that the "random surfer" is sensitive to different topics of web pages.  ... 
doi:10.1145/2063576.2063931 dblp:conf/cikm/ZhuCXCT11 fatcat:4fgq3ofbenhpldatdtlgo2rp2i

Diversity-Aware Entity Exploration on Knowledge Graph

Liang Zheng, Shuo Liu, Zhuofei Song, Fangtong Dou
2021 IEEE Access  
In this paper, we propose a novel diversity-aware entity exploration approach based on random walk model, which naturally mimics human conceptual exploration by surfing a class association graph.  ...  INDEX TERMS Knowledge graph, diversified entity exploration, random walk model.  ...  The random walk is defined by a sequence of actions performed by the surfer.  ... 
doi:10.1109/access.2021.3107732 fatcat:4wruhbmqtvexvja3qci7x7fz74

Time-Aware Authority Ranking

Klaus Berberich, Michalis Vazirgiannis, Gerhard Weikum
2005 Internet Mathematics  
Time-and thus the freshness of web content and link structure-emanates as a factor that should be taken into account in link analysis when computing the importance of a page.  ...  rates) of pages and links.  ...  PageRank In the PageRank method a random surfer travels the (web) graph by either following outgoing links or by randomly jumping to another node.  ... 
doi:10.1080/15427951.2005.10129110 fatcat:qcse6actnreodpbemfhizitvfu

PROS: A Personalized Ranking Platform for Web Search [chapter]

Paul-Alexandru Chirita, Daniel Olmedilla, Wolfgang Nejdl
2004 Lecture Notes in Computer Science  
We start from the set of bookmarks collected by a user and extend it to contain a set of hubs with high PageRank related to them.  ...  In this paper we show how to automate this hub selection process and build upon the latter algorithm to implement a platform for personalized ranking.  ...  PageRank PageRank is an algorithm for computing a Web page score based on the graph inferred from the link structure of the Web.  ... 
doi:10.1007/978-3-540-27780-4_7 fatcat:nortjsvpyravfd4oucfe5rzlei

Remember where you came from

Yubao Wu, Yuchen Bian, Xiang Zhang
2016 Proceedings of the VLDB Endowment  
Measuring the proximity between different nodes is a fundamental problem in graph analysis. Random walk based proximity measures have been shown to be effective and widely used.  ...  Most existing random walk measures are based on the first-order Markov model, i.e., they assume that the next step of the random surfer only depends on the current node.  ...  This work was partially supported by the National Science Foundation grants IIS-1162374, CA-REER, and the NIH grant R01GM115833.  ... 
doi:10.14778/3015270.3015272 fatcat:xctjwmbmifcu3jdhul72fsi6ji

A Survey on PageRank Computing

Pavel Berkhin
2005 Internet Mathematics  
Computing even a single PageRank is a difficult computational task. Computing many PageRanks is a much more complex challenge.  ...  Components of a PageRank vector serve as authority weights for web pages independent of their textual content, solely based on the hyperlink structure of the web.  ...  Consider the following random surfer model. A surfer travels along the directed graph.  ... 
doi:10.1080/15427951.2005.10129098 fatcat:ahbwdzfelzbfrcpzsoqae4w2za

STRank: A SiteRank algorithm using semantic relevance and time frequency

Hongzhi Guo, Qingcai Chen, Xiaolong Wang, Zhiyong Wang, Yonghui Wu
2009 2009 IEEE International Conference on Systems, Man and Cybernetics  
But most of existing website ranking algorithm just take use of website link graphs and the content of websites are usually not put into consideration.  ...  One of the important facts that a web page is just one building block of the whole website had been ignored.  ...  In PageRank, users' random Web surfers are abstracted as a random walk model over the DocGraph.  ... 
doi:10.1109/icsmc.2009.5346321 dblp:conf/smc/GuoCWWW09 fatcat:2e5fnf52jzhi7pm6mddsoikhhe

Recommender Systems [chapter]

2016 Text Data Management and Analysis: A Practical Introduction to Information Retrieval and Text Mining  
We compare PageRank to an idealized random Web surfer. We show how to e ciently compute PageRank for large numbers of pages. And, we show h o w to apply PageRank to search and to user navigation.  ...  The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes.  ...  The random surfer" simply keeps clicking on successive links at random.  ... 
doi:10.1145/2915031.2915043 fatcat:yxvhgfpwtjcx7dybzz5fqlgg5a
« Previous Showing results 1 — 15 out of 661 results