The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding optimal paths within them, have emerged as an adequate modeling tool for prohibitively complex and/...

This paper studies a family of link-based algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with the distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. We focus on three damping functions, having linear, exponential, and hyper...

With the development of media convergence, communication mode, characteristics, and path broadcast television have significantly changed. How to achieve better under convergence has received wide attention from researchers. This paper briefly introduced features verified importance taking Chinese enterprises’ new index ranking in June 2021 as an example. Then, status was analyzed, current probl...

Computing shortest paths is a fundamental primitive for several social network applications including sociallysensitive ranking, location-aware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency while maintaining feasible memory requirements. We present ASAP, a system that achieves this goal by ...

User query q, Web pages {v } (q, v) can be represented with a rich feature vector Text match score with title, anchor text, headings, bold text, body text,. .. , of v as a hypertext document Pagerank, topic-specific Pageranks, personalized Pageranks of v as a node in the Web graph Estimated location of user, commercial intent,. .. Must we guess the relative importance of these features? How to ...

From the more than two hundred partial orders for fuzzy numbers proposed in literature, only a few are total. In this article, we introduce notion of admissible order equipped with order, i.e., total which refines order. particular, it is given special attention to by Klir and Yuan 1995. Moreover, propose method construct on terms linear defined intervals considering strictly increasing upper d...

MOTIVATION Pathway knowledge in public databases enables us to examine how individual metabolites are connected via chemical reactions and what genes are implicated in those processes. For two given (sets of) compounds, the number of possible paths between them in a metabolic network can be intractably large. It would be informative to rank these paths in order to differentiate between them. ...

Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickthrough data to adapt a search engine’s ranking function. Clickthrough data indicate for each query the results that are clicked by users. As a kind of implicit relevance feedback information, clickthrough data can easily be coll...