Filters








104,392 Hits in 2.7 sec

Adaptive ranking of web pages

Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Markus Hagenbuchner, Marco Maggini
2003 Proceedings of the twelfth international conference on World Wide Web - WWW '03  
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation.  ...  It is demonstrated experimentally on a relatively large web data set, viz., the WT10G, that it is possible to modify the PageRanks of the web pages through the proposed method using a set of linear constraints  ...  determination of the Page-Ranks for other web pages.  ... 
doi:10.1145/775201.775203 fatcat:7zqtbmih3vczvh6dih5ukwzm3i

Adaptive ranking of web pages

Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Markus Hagenbuchner, Marco Maggini
2003 Proceedings of the twelfth international conference on World Wide Web - WWW '03  
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation.  ...  It is demonstrated experimentally on a relatively large web data set, viz., the WT10G, that it is possible to modify the PageRanks of the web pages through the proposed method using a set of linear constraints  ...  determination of the Page-Ranks for other web pages.  ... 
doi:10.1145/775152.775203 dblp:conf/www/TsoiMSHM03 fatcat:p3g7wbah55h7lhweblsisocu2u

Adaptive page ranking with neural networks

Franco Scarselli, Sweah Liang Yong, Markus Hagenbuchner, Ah Chung Tsoi
2005 Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05  
This paper explores the idea of applying a novel neural network model to a web graph to compute an adaptive ranking of pages.  ...  Some early experimental results indicate that the new neural network models generalize exceptionally well when trained on a relatively small number of pages.  ...  Much work was performed on how to modify the PageRank method [1] to reflect the interests of the user. This is sometimes referred to as "adaptive ranking" of web pages.  ... 
doi:10.1145/1062745.1062806 dblp:conf/www/ScarselliYHT05 fatcat:ihzhqybjwvhdbanwemdxhwt5za

Parallel adaptive technique for computing PageRank

A. Rungsawang, B. Manaskasemsak
2006 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)  
From experiments using a synthesized web graph of 28 million pages and around 227 million hyperlinks, we obtain the acceleration rate up to 6-8 times using 32 PC processors.  ...  Following the study of the Stanford WebBase group on convergence patterns of PageRank scores of pages using the conventional PageRank algorithm, PageRank scores of most pages converge more quickly than  ...  Let R(u) represent the rank score of a page u, n be the total number of web pages, N u be the out-degree of page u, and S v represent the set of pages pointing to page v.  ... 
doi:10.1109/pdp.2006.55 dblp:conf/pdp/RungsawangM06 fatcat:azmsu2gnebck3adxzt3xnhhcvy

Ranking Web Pages Using Machine Learning Approaches

Sweah Liang Yong, Markus Hagenbuchner, Ah Chung Tsoi
2008 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology  
Acknowledgment: The authors wish to acknowledge financial support from the Australian Research Council in the form of Discovery Project grant.  ...  More specifically, for web page ranking applications, we assign the known rank value to a selected number of web pages as the supervised set.  ...  For example, a Web search engine responds to a search query with a set of relevant Web pages which are listed in the order of rank.  ... 
doi:10.1109/wiiat.2008.235 dblp:conf/iat/YongHT08 fatcat:h6is7qjddbdnngrvshdrku3azy

Computing personalized pageranks

Franco Scarselli, Ah Chung Tsoi, Markus Hagenbuchner
2004 Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04  
A recently published approach to adaptive page rank, using the solution of quadratic optimization methods with a set of simple constraints [3] , is modified to permit classification of web pages according  ...  This modification allows the approach to be more adapted to the needs of focussed crawlers, or personalized search engines.  ...  In [3] , we proposed a method to adapt page ranks to allow modification of PageRank to satisfy a set of user requirements, e.g., one particular page should have a higher rank to others.  ... 
doi:10.1145/1010432.1010551 fatcat:ae3nodij2rbzfk6hpq632bi2lq

Computing personalized pageranks

Franco Scarselli, Ah Chung Tsoi, Markus Hagenbuchner
2004 Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04  
A recently published approach to adaptive page rank, using the solution of quadratic optimization methods with a set of simple constraints [3] , is modified to permit classification of web pages according  ...  This modification allows the approach to be more adapted to the needs of focussed crawlers, or personalized search engines.  ...  In [3] , we proposed a method to adapt page ranks to allow modification of PageRank to satisfy a set of user requirements, e.g., one particular page should have a higher rank to others.  ... 
doi:10.1145/1013367.1013486 dblp:conf/www/ScarselliTH04 fatcat:emroeumwxve4xh65di53q4krqa

A Ranking Model Framework for Multiple Vertical Search Domains

2014 International Journal of Research and Applications  
Therefore it is the need of the hour to have a ranking model that can adapt to various domains implicitly.  ...  Recently Geng et al. proposed an algorithm that has a ranking model which can adapt to various domains. This avoids the process of writing various algorithms for different domains.  ...  NDCG Results of web page search to image search adaptation with ten labeled queries As can be seen in fig. 4 , adaptation is made from web page search to image search with ten labeled queries.  ... 
doi:10.17812/ijra.1.1(4)2014 fatcat:amko4gyb3rcr3hlittdcsh7xbq

Enhance Crawler: A Dual-Stage Crawler for Efficiently Harvesting Deep Web Interfaces

Sujata R., Shubhangi S.
2017 International Journal of Computer Applications  
result of focus crawler (it avoid to visit large no of pages ) And ranking is used for prioritize highly relevant ones for given input topic.  ...  IN second stage of framework, In-site searching is done by extracting most relevant links with an adaptive link ranking. We design link tree data structure to achieve wider coverage of deep website.  ...  (highly ranked pages that have many links to the other domains) and feeds these pages back to the site database.  ... 
doi:10.5120/ijca2017914483 fatcat:ihw4b434djag3m6uwbgi73fiua

VITALIZED BI-LEVEL WEB CRAWLER FOR REMOVAL OF REDUNDANT CONTENT IN DEEP WEB INTERFACE

Supriya.H.S .
2016 International Journal of Research in Engineering and Technology  
In the second level, Crawler achieves rapid in-site searching by adaptive link-ranking through excavating most appropriate links.  ...  Thus removal of redundant content in deep web will be achieved based on parsing the content of one web page and comparing the pared content with other web page content which can save the storage area and  ...  When web pages are visited frequently its rank will increase as the rank of web page increases crawler will find it as more relevant web page for the corresponding keywords.  ... 
doi:10.15623/ijret.2016.0516019 fatcat:vchb5birbbchvmqhegminrwvte

IMPLEMENTATION OF SMARTCRAWLER FOR DEEP-WEB SITES

2018 International Journal of Computing Communications and Networking  
The adaptive link learner is used to find out relevant links with help of link priority and link rank..  ...  Due to the large volume of web resources and the dynamic nature of deep web, achieving wide coverage and high efficiency is a challenging issue.  ...  The figure below shows the architecture of proposed system: 2) Reverse searching: Pages with high rank and links to many other pages is called as centre page of site.  ... 
doi:10.30534/ijccn/2018/30722018 fatcat:3pbtbrxlrrbwleg2uaa5w4h7hq

A3CRank: An adaptive ranking method based on connectivity, content and click-through data

Ali Mohammad Zareh Bidoki, Pedram Ghodsnia, Nasser Yazdani, Farhad Oroumchian
2010 Information Processing & Management  
Due to the proliferation and abundance of information on the web, ranking algorithms play an important role in web search.  ...  A3CRank adapts itself with user needs and makes use of user clicks to aggregate the results of ranking algorithms.  ...  Therefore, the problem of ranking is to sort web pages based on user requests or preferences.  ... 
doi:10.1016/j.ipm.2009.12.005 fatcat:i5b6fzojhzgijfs36elkagfzcm

A TWO-STAGE KEYWORD BASED CRAWLER FOR GATHERING DEEP-WEB SITES

2018 International Journal of Computing Communications and Networking  
The adaptive link learner is used to find out relevant links with help of link priority and link rank.  ...  Due to the large volume of web resources and the dynamic nature of deep web, achieving wide coverage and high efficiency is a challenging issue.  ...  The figure below shows the architecture of proposed system: 2) Reverse searching: Pages with high rank and links to many other pages is called as centre page of site.  ... 
doi:10.30534/ijccn/2018/29722018 fatcat:5de6e6hhyfeoxh3kqsiwhhlkia

SmartCrawler: A Two-Stage Crawler for Efficiently Harvesting Deep-Web Interfaces

Feng Zhao, Jingyu Zhou, Chang Nie, Heqing Huang, Hai Jin
2016 IEEE Transactions on Services Computing  
In the second stage, SmartCrawler achieves fast in-site searching by excavating most relevant links with an adaptive link-ranking.  ...  In the first stage, SmartCrawler performs site-based searching for center pages with the help of search engines, avoiding visiting a large number of pages.  ...  With the increase of visited pages, SmartCrawler keeps a higher crawling rate of relevant forms than SCDI, mainly due to site ranking and link ranking for quickly visiting relevant pages.  ... 
doi:10.1109/tsc.2015.2414931 fatcat:2g3oqslxhzcw7kahsg5kvgatbi

Towards recency ranking in web search

Anlei Dong, Yi Chang, Zhaohui Zheng, Gilad Mishne, Jing Bai, Ruiqiang Zhang, Karolina Buchner, Ciya Liao, Fernando Diaz
2010 Proceedings of the third ACM international conference on Web search and data mining - WSDM '10  
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account.  ...  Our experiments demonstrate the efficacy of the proposed approaches.  ...  [15] proposed a TS-Rank algorithm, which considers page freshness in the stationary probability distribution of Markov Chains, since the dynamics of web pages is also important for ranking.  ... 
doi:10.1145/1718487.1718490 dblp:conf/wsdm/DongCZMBZBLD10 fatcat:zw2ocfckhnfwfj4ejnc7dcypvq
« Previous Showing results 1 — 15 out of 104,392 results