- Research Article
6
- 10.1016/j.pedhc.2012.04.008
Googling for Health Information
- Jun 21, 2012
- Journal of Pediatric Health Care
- Jennifer P D'Auria
Googling for Health Information
The web graph follows power law distribution and has a hierarchy structure. But neither PageRank algorithm nor any of its improvements leverage these attributes. In this paper, we propose a novel link analysis algorithm the PowerRank algorithm, which makes use of power law distribution attribute and hierarchy structure of web graph. The algorithm consists two parts. In first part, special treatment is applied to web pages with low importance score. In second part, global importance score for each web page is obtained by combining those scores together. Our experimental results show that: 1) The PowerRank algorithm computes 10%-30% faster than PageRank algorithm. 2) Top web pages in PowerRank algorithm remain similar to that of PageRank algorithm.
Googling for Health Information
Googling for Health Information
Can Google's PageRank be used to find the most important academic Web pages?
Google's PageRank is an influential algorithm that uses a model of Web use that is dominated by its link structure in order to rank pages by their estimated value to the Web community. This paper reports on the outcome of applying the algorithm to the Web sites of three national university systems in order to test whether it is capable of identifying the most important Web pages. The results are also compared with simple inlink counts. It was discovered that the highest inlinked pages do not always have the highest PageRank, indicating that the two metrics are genuinely different, even for the top pages. More significantly, however, internal links dominated external links for the high ranks in either method and superficial reasons accounted for high scores in both cases. It is concluded that PageRank is not useful for identifying the top pages in a site and that it must be combined with a powerful text matching techniques in order to get the quality of information retrieval results provided by Google.
Read moreStructural Analyses of Malaysian Web and Host Graphs
In this paper, we present our study on building a Web graph for the Malaysian Web based on the crawling of Malaysian Web sites. Given the constructed Web graph, interesting characteristics have been studied, such as the in-degree, out-degree, the distribution of power law, bow-tie structure and the strongly-connected components (SCCs). Besides, more important insight could be obtained from analyzing the hyperlinks among the hosts. Similar to Web graph, host graph serves as an informative source for enhancing crawling and searching methodologies, predicting Web growth and for Web sociology study. To date, Web or host graphs have been built for the global web and other nations. Hence, being a subset of the global Web, it would also be interesting to compare the characteristics of Malaysian host graph with the global web and other nations'. This research outputs a Malaysian Web graph, a Malaysian host graph and studies on the characteristics of these graphs. The graphs portray characteristics that are consistent with the graphs created for other nations. There are irregularities to the graphs where it is discussed at length to justify to anomalies.
Read moreCombined two phase page ranking algorithm for sequencing the web pages
Many existing page ranking algorithms are used in web mining to display the result in search engine result page. But these existing algorithms are either based on the inlinks and outlinks of the page or content of the page. It never consider the user interest on the page to calculate the page rank of that particular page. This leads to a need of web page ranking algorithm concerning content and usage of the pages. Proposed algorithm focuses on title, Meta, H1 and paragraph tags to find the similarity of the page. Tag Analyzer Algorithm is used to analyze these tags' content. Besides, it considers how long the user stays in that page to compute user interest score. TPPR technique computes the score in two phases. Based on the output of TPPR algorithm, the URLs are sequenced and displayed to the user. Event Explore technique detects whether the user is idle or active on the page. The proposed algorithm produced better performance and displays the most relevant web pages in the top of the result. From the results, "Two Phase Page Ranking" (TPPR) algorithm is better than PR algorithm of taken data set. TPPR algorithm can be used in web mining to improve the ranking system of search engine.
Read moreA Comparative Study of Page Ranking Algorithms for Information Retrieval
This paper gives an introduction to Web mining, then describes Web Structure mining in detail, and explores the data structure used by the Web. This paper also explores different Page Rank algorithms and compare those algorithms used for Information Retrieval. In Web Mining, the basics of Web mining and the Web mining categories are explained. Different Page Rank based algorithms like PageRank (PR), WPR (Weighted PageRank), HITS (Hyperlink-Induced Topic Search), DistanceRank and DirichletRank algorithms are discussed and compared. PageRanks are calculated for PageRank and Weighted PageRank algorithms for a given hyperlink structure. Simulation Program is developed for PageRank algorithm because PageRank is the only ranking algorithm implemented in the search engine (Google). The outputs are shown in a table and chart format.
Read moreEfficient Graph Matching
Application domains such as bioinformatics and web technology represent complex objects as graphs where nodes represent basic objects (i.e. atoms, web pages etc.) and edges model relations among them. In biochemical databases proteins are naturally represented as labeled graphs: the nodes are atoms and the edges are chemical links. In computer vision, graphs can be used to represent images at different levels of abstraction. In a low-level representation (Pailloncy, Deruyver, & Jolion, 1999), the nodes of a graph correspond to pixels and the edges to spatial relations between pixels. At higher levels of description (Hong & Huang, 2001), nodes are image regions and edges are spatial relations among them. In a Web graph (Deutsch, Fernandez, Florescu, Levy, & Suciu, 1999) nodes are web pages and edges are links between them. In all these domains, substructure queries that search for all exact or approximate occurrences of a given query graph in the graphs of the database can be useful. Research efforts in graph searching have taken three directions: the first is to study matching algorithms for particular graph structures (planar graphs, bounded valence graphs and association graphs); the second is to use elaborate tricks to reduce the number of generated matching maps (Cordella, Foggia, Sansone, & Vento, 2004); and the third is, since graph searching problem is NP-complete, to provide polynomial approximate algorithms. In the context of querying in a database of graphs many of the existing methods are designed for specific applications. For example, several querying methods for semi-structured databases have been proposed. In addition, commercial products and academic projects (Kelley 2002) for subgraph searching in biochemical databases are available. These two examples have a different underlying data model (a web-page database is a large graph whereas a biochemical database is a collection of graphs). In these two applications regular path expressions and indexing methods are used during query time to respectively locate substructures in the database and to avoid unnecessary traversals of the database. In general graph databases, there are some searching methods where the data graph and the query graph must have the same size. Other methods allow the query to be considerably smaller than the database graphs. A common idea in the above algorithms is to index the subgraph matches in the database and organize them in suitable data structures.
Read moreA Novel Hybrid Algorithm for Enhanced Re-Ranking Optimal Web Page Classification
World Wide Web (WWW) is a platform that explores a wide range of information used for the development of web applications. Some examples of these applications include social network analysis, personalized item recommendations, and web page classification and ranking. Among these applications, search engines and web page ranking are particularly important as they consistently index and store billions of web pages on the internet. The main objective of this paper is to create an innovative framework for the classification and re-ranking of web pages using intelligent techniques. The framework is structured into two key phases: classification and re-ranking-based retrieval. In the initial classification phase, a series of pre-processing steps are implemented, including the elimination of HTML tags, punctuation, stop words, and the application of stemming. After pre-processing, a word-to-vector conversion is performed, followed by feature extraction utilizing Principal Component Analysis (PCA). This sequence of actions leads to optimal feature selection, which is vital for the precise classification of web pages. Given the multitude of features present in web pages that can compromise classification accuracy, this study employs a novel meta-heuristic algorithm, the Opposition Based-Tunicate Swarm Algorithm (O-TSA), to facilitate optimal feature selection. The refined features are subsequently processed through the Enhanced Convolutional-Recurrent Neural Network (E-CRNN), enhanced by O-TSA, resulting in the effective classification of diverse web page categories. In the second phase, the re-ranking process is executed using O-TSA, which establishes the objective function based on a similarity function (correlation) for URL matching, leading to optimal re-ranking of web.
Read moreEvolution of Service Cross-border E-commerce Network Pattern based on PageRank Algorithm
In recent years, the hot topic of (CRE)cross-border e-commerce has become more and more popular, and with the introduction of relevant national support and preferential policies, many entrepreneurial companies have emerged to enter the CRE industry. Compared with domestic E-commerce and CRE have a wider market and greater profits. In order to achieve trade transformation, all regions are building e-commerce industrial parks with complete facilities and preferential policies to promote the development of local CRE. This paper uses the PageRank algorithm to analyze the evolution of the service CRE network, and provides some reference for the evolution of the network. Through the use of the PageRank algorithm in the e-commerce network, it can be proved that this technology is very effective in the analysis of the pattern evolution, especially in the case of the expansion of network resources. The expansion of network resources will inevitably generate many links, and the generation of these links provides more basis for evaluating the importance of documents. The idea of the PageRank algorithm is that whenever a web page links to this web page, it is equivalent to voting for this web page. The final results of the research show that the inventory backlog of CRE has been on a downward trend since 2016, from 45.10% in 2016 to 5.23% in 2021, which is very important for the circulation of funds and the turnover of inventory goods.
Read moreA proposed framework for building a recommender search engine
There are billions of web pages had been hosted in the Internet and the number of documents is increased overtime. But since internet is a huge resource, the problem of how to determine what users need to give good search results is a challenge for many search engines. This paper suggest a framework for building general purposed search engines which can recommend search results (web pages) to user by using a hybrid recommender engine from content-based and collaborative filtering. This framework determines the roles of topics, websites and web pages and give recommendations rely on the mutual relation of the triple topics, websites, and web pages. With this approach, we can improve search quality of search engines and solve some problems that restricted recommender systems. Experimental results show that our search results better than search results of a search engine apply classical Google page rank algorithm (13), a well-known page rank algorithm used in many search engines.
Read moreFrom graph data extraction to graph layout: Web information visualization
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs. A Web graph is a very huge graph as growing with cyberspace This paper presents a pipeline for extracting web information from cyberspace to a web graph and layout techniques for making the web graph more readable As the size of computer screen is limited, only a small part of the Web graph can be displayed Several layout techniques should be adapted and combined effectively for web graph visualization. The visualization process incorporates graph drawing algorithms, layout adjustment methods, as well as filtering and clustering methods in order to decide which part of the Web graph should be displayed and how to display it based on the user's focus in navigation.
Read morePageRank Computation Using PC Cluster
Link based analysis of web graphs has been extensively explored in many research projects. PageRank computation is one widely known approach which forms the basis of the Google search. PageRank assigns a global importance score to a web page based on the importance of other web pages pointing to it. PageRank is an iterative algorithm applying on a massively connected graph corresponding to several hundred millions of nodes and hyper-links. In this paper, we propose an efficient implementation of PageRank computation for a large sub-graph of the web on a PC cluster. A link structure file representing the web graph of several hundred million links, and an efficient PageRank algorithm capable of computing PageRank scores very fast, will be discussed. Experimental results on a small cluster of x86 based PC with artificial 776 million links of 87 million nodes derived from the TH domain report 30.77 seconds per iteration run.
Read moreDesign of a Metacrawler for web document retrieval
Web Crawlers ‘browse’ the World Wide Web (WWW) on behalf of search engine, to collect web pages from numerous collections of billions of documents. Metacrawler is similar to that of a meta search engine that combines the top web search results from popular search engines. World Wide Web is growing rapidly. This possesses great challenges to general purpose crawlers. This paper introduces an architectural framework of a Metacrawler. This crawler enables the user to retrieve information that is relevant to the topic from more than one traditional web search engines. The crawler works in such a way that it fetches only the pages that are relevant to the topic. The PageRank algorithm is often used in ranking web pages. But, the ranking causes the problem of topic-drift. So, modified PageRank algorithm is used to rank the retrieved web pages in such a way that it reduces this problem. The clustering method is used to combine the search results so that the user can easily select web pages from the clustered results based upon the requirement. Experimental results show the effectiveness of the Metacrawler.
Read moreA topic-specific crawling strategy based on semantics similarity
A topic-specific crawling strategy based on semantics similarity
Web Algorithms for Information Retrieval
The World Wide Web has emerged to become the biggest and most popular way of communication and information dissemination. Every day, the Web is expending and people generally rely on search engine to explore the web. Because of its rapid and chaotic growth, the resulting network of information lacks of organization and structure. It is a challenge for service provider to provide proper, relevant and quality information to the internet users by using the web page contents and hyperlinks between web pages. This paper deals with analysis and comparison of web pages ranking algorithms based on various parameters to find out their advantages and limitations for ranking web pages and to give the further scope of research in web pages ranking algorithms. Six important algorithms: the Page Rank, Query Dependent-PageRank, HITS, SALSA, Simultaneous Terms Query Dependent-PageRank (SQD-PageRank) and Onto-SQD-PageRank are presented and their performances are discussed.
Read moreWebometric Analysis of Universities in Gujarat
It has been observed that web-based resources of information have great role to play in academic and research activities. Millions of users are using the web as primary source of information, communicating and sharing the knowledge. University websites are gateways of the virtual location and important information regarding the admissions, various academic announcements, infrastructure and facilities, information related to examination and results, news and views etc. for their students and patrons. University websites are more and more used for extensive purposes, such as to upload and download a brochure, access e-library and catalogue, promote research groups, latest publications, to access electronic databases etc. Therefore, there is an essentiality and need to study concerning websites of educational institutes in general and Indian perspective. This study aims to evaluate contents of websites of various universities in Gujarat through webometrics method. There are total 43 universities in Gujarat which includes 21 state governments’, five central governments’ including two private aided and 17 private universities. In this study, 21 state government universities were considered. Webometrics is concerned with measuring aspects of the websites, web pages, parts of web pages, words in web pages, web traffic rank, PageRank etc., and its various contents considered for evaluation. Keywords: Webometrics, internet, information resources, universities, websites, higher education, Indian universities, traffic rank, www Cite this Article Parmar Shamajibhai D, Mandalia Shishirkumar H. Webometric Analysis of Universities in Gujarat. Journal of Advancements in Library Sciences. 2016; 3(2): 103–111p.
Read more