Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia. Web search through hub synthesis. In Symposium on Foundations of Computer Science, 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....secondary (i.e. non principal) eigenvectors (or their positive and negative components) being related to secondary (or opposing) communities of web pages. The use of secondary eigenvectors for discovering communities, or for improving the quality of the ranking has been investigated further in [13, 1, 19]. We now present a few simple examples which we feel illustrate the opinion that such secondary eigenvectors sometimes are, but sometimes are not, indicative of secondary communities. In short, there is no simple result either way, regarding these secondary eigenvectors. For the following, we ....

....alter the graph. We would like small changes in the graph to have a small effect on the weight vector of the algorithm. We capture this requirement by the definition of stability. The notion of stability has been independently considered (but not explicitly defined) in a number of different papers [18, 19, 3, 1]. Given a graph G, we can view a change in graph G, as an operation on graph G, that adds and or removes links so a to produce a new graph G = G. Formally, a change is defined as an operation on the adjacency matrix of the graph G, that alters k entries of the matrix, for some k 0. The ....

[Article contains additional citation context not shown here]

D. Achlioptas, A. Fiat, A. Karlin, and F. McSherry. Web search through hub synthesis. In Proceedings of the 42nd Foundation of Computer Science (FOCS 2001.

....algorithm. Surprisingly, we observed that experimentally it performs very similarly to the INDEGREE algorithm. 4 A Theoretical Framework for the Analysis of LAR Algorithms The seminal work of Kleinberg [31] and Brin and Page [9] was followed by an avalanche of Link Analysis Ranking algorithms [8, 5, 34, 42, 3, 1, 40]. Faced with this wide range of choices for LAR algorithms, researchers usually resort to experiments to evaluate them and determine which one is more appropriate for the problem at hand. However, experiments are only indicative of the behavior of the LAR algorithm. In many cases, experimental ....

....set, 1 , a 2 ) as follows. j) a 1 (i) a 1 (j) a 2 (j) a 1 (i) a 1 (j) a 2 (i) a 2 (j) In order to define a distance measure between partial rankings we need to address the pairs of nodes that belong to this set. We penalize each such pair by a value p, where p [0, 1]. We define the indicator function (i, j) as follows. # p if (i, j) # W(a Kendall s tau with penalty p is defined as follows. a 1 , a 2 ) The parameter p takes values in [0, 1] The value p = 0 gives a lenient approach, where we penalize the algorithm only for pairs ....

[Article contains additional citation context not shown here]

D. Achlioptas, A. Fiat, A. Karlin, and F. McSherry. Web search through hub synthesis. In Proceedings of the 42nd Foundation of Computer Science (FOCS 2001.

....web pages. Independently, Brin and Page proposed the PageRank algorithm [5] which become an integral component of the successful Google search engine [9] These two algorithms spawned the research field of link analysis ranking, and they were followed by a substantial amount of research work [4, 3, 13, 16, 2, 1, 15]. Most of link analysis ranking algorithms start with a set of web pages, interconnected with hypertext links. Given the underlying graph, the algorithms extract the principal eigenvector (s) of a matrix associated with the graph, and rank the pages according to the value of each page in this ....

....by good hubs. In PAGERANK good authorities are pointed to by good authorities. The HITS and PAGERANK algorithms were followed by a substantial number of variations and enhancements. Most of the subsequent work follows a similar algebraic approach, manipulating some matrix related to the web graph [4, 3, 13, 16, 2, 1, 15]. Recently, there were some interesting attempts in applying statistical, and machine learning tools for computing authority weights [4, 6, 11] 3. DYNAMICAL SYSTEMS A dynamical system describes a weight propagation scheme on the nodes of a graph. We construct the Base Set as described by ....

[Article contains additional citation context not shown here]

D. Achlioptas, A. Fiat, A. Karlin, and F. McSherry. Web search through hub synthesis. In Proceedings of the 42nd Foundation of Computer Science (FOCS 2001.

....secondary (i.e. non principal) eigenvectors (or their positive and negative components) being related to secondary (or opposing) communities of web pages. The use of secondary eigenvectors for discovering communities, or for improving the quality of the ranking has been investigated further in [13, 1, 18]. We now present a few simple examples which we feel illustrate the opinion that such secondary eigenvectors sometimes are, but sometimes are not, indicative of secondary communities. In short, there is no simple result either way, regarding these secondary eigenvectors. For the following, we ....

....alter the graph. We would like small changes in the graph to have a small effect on the weight vector of the algorithm. We capture this requirement by the definition of stability. The notion of stability has been independently considered (but not explicitly defined) in a number of different papers [17, 18, 3, 1]. Given a graph G, we can view a change in graph G, as an operation on graph G, that adds and or removes links so a to produce a new graph G 0 = G. Formally, a change is defined as an operation on the adjacency matrix of the graph G, that alters k entries of the matrix, for some k 0. The ....

[Article contains additional citation context not shown here]

D. Achlioptas, A. Fiat, A. Karlin, and F. McSherry. Web search through hub synthesis. In Proceedings of the 42nd Foundation of Computer Science (FOCS

No context found.

Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia. Web search through hub synthesis. In Symposium on Foundations of Computer Science, 2001.

....purchased together such as Cham paign and Caviar or Beer and Diapers. Such rules had been used for marketing (e.g. placing Beer and Diapers next to each other in the supermarket) and recommendation systems (e.g. recommend books to customers based on previous book purchases) 6] 19] 24] [4]. A computationally challenging important subproblem is to discover association rules that have high correlation but low support (e.g. the association rule Champaign and Caviar that are rare purchases but are often purchased together) 9] Similarly to these data mining techniques, we exploit ....

Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia. Web search through hub synthesis. In Symposium on Foundations of Computer Science, 2001.

....that are often purchased together such as Champaign and Caviar or Beer and Diapers. Such rules had been used for marketing (e.g. placing Beer and Diapers next to each other in the supermarket) and recommendation systems (e.g. recommend books to customers based on previous book purchases) [7, 21, 25, 4]. A computationally challenging important subproblem is to discover association rules that have high correlation but low support (e.g. the association rule Champaign and Caviar that are rare purchases but are often purchased together) 11] Similarly to these data mining techniques, we exploit ....

Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia. Web search through hub synthesis. In Symposium on Foundations of Computer Science, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC