Related papers: Samuelson's webs of maximum rank
We propose a generalization of SimRank similarity measure for heterogeneous information networks. Given the information network, the intraclass similarity score s(a, b) is high if the set of objects that are related with a and the set of…
Recently, statistical properties of the World-Wide Web have attracted considerable attention when self-similar regimes have been observed in the scaling of its link structure. Here we recall a classical model for general scaling phenomena…
The study of networks has grown into a substantial interdisciplinary endeavour that encompasses myriad disciplines in the natural, social, and information sciences. Here we introduce a framework for constructing taxonomies of networks based…
In the present time, all know about World Wide Web and work over the Internet daily. In this paper, we introduce the search engines working for keywords that are entered by users to find something. The search engine uses different search…
Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the…
Most works on Web services has focused on discovery, composition and selection processes of these kinds of services. Other few works were interested in how to represent Web services search queries. However, these queries cannot be processed…
In many online platforms, customers' decisions are substantially influenced by product rankings as most customers only examine a few top-ranked products. Concurrently, such platforms also use the same data corresponding to customers'…
Keyword search engines are essential elements of large information spaces. The largest information space is the Web, and keyword search engines play crucial role there. The advent of keyword search engines has provided a quantum leap in the…
Research in the Life Sciences depends on the integration of large, distributed and heterogeneous data sources and web services. The discovery of which of these resources are the most appropriate to solve a given task is a complex research…
In this paper we propose an analysis and an upgrade of WordNet's top-level synset taxonomy. We briefly review WordNet and identify its main semantic limitations. Some principles from a forthcoming OntoClean methodology are applied to the…
Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road…
A classification and examples of four-dimensional isoclinic three-webs of codimension two are given. The examples considered prove the existence theorem for many classes of webs for which the general existence theorems are not proved yet.
Let $M$ be an $n \times m$ matrix of independent Rademacher ($\pm 1$) random variables. It is well known that if $n \leq m$, then $M$ is of full rank with high probability. We show that this property is resilient to adversarial changes to…
This work studies the maximum possible sign rank of $N \times N$ sign matrices with a given VC dimension $d$. For $d=1$, this maximum is {three}. For $d=2$, this maximum is $\tilde{\Theta}(N^{1/2})$. For $d >2$, similar but slightly less…
On the case that the number of dangling nodes is large, PageRank computation can be proceeded with a much smaller matrix through lumping all dangling nodes of a web graph into a single node. Thus, it saves many computational cost and…
To better understand the correlation between network topological features and the robustness of network controllability in a general setting, this paper suggests a practical approach to searching for optimal network topologies with given…
We compare two link analysis ranking methods of web pages in a site. The first, called Site Rank, is an adaptation of PageRank to the granularity of a web site and the second, called Popularity Rank, is based on the frequencies of user…
The advent of Internet and World Wide Web has led to unprecedent growth of the information available. People usually face the information overload by following a limited number of sources which best fit their interests. It has thus become…
We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…
Looking into the growth of information in the web it is a very tedious process of getting the exact information the user is looking for. Many search engines generate user profile related data listing. This paper involves one such process…