On finding power method in spreading activation search
نویسنده
چکیده
Graph ranking algorithms such as PageRank and HITS share the common idea of calculating eigenvectors of graph adjacency matrices. This paper shows that the power method usually used to calculate eigenvectors is also present in a spreading activation search. In addition, we empirically show that spreading activation algorithm is able to converge on periodic graphs, where power method fails. Furthermore, an extension to graph ranking calculation scheme is proposed unifying calculation of PageRank, HITS, NodeRanking and spreading activation search.
منابع مشابه
Discovering Latent Informaion by Spreading Activation Algorithm for Document Retrieval
Syntactic search relies on keywords contained in a query to find suitable documents. So, documents that do not contain the keywords but contain information related to the query are not retrieved. Spreading activation is an algorithm for finding latent information in a query by exploiting relations between nodes in an associative network or semantic network. However, the classical spreading acti...
متن کاملUsing a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models
The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...
متن کاملRetrieving Semantically Distant Analogies with Knowledge-Directed Spreading Activation
Techniques that traditionally have been useful for retrieving same domain analogies from small single use knowledge bases such as spreading activation and indexing on selected features are inadequate for retrieving cross domain analogies from large multi use knowledge bases In this paper we describe Knowledge Directed Spreading Activation KDSA a new method for retriev ing analogies in a large s...
متن کاملLoad-Frequency Control in a Deregulated Environment Based on Bisection Search
Recently several robust control designs have been proposed to the load-frequency control (LFC) problem. However, the importance and difficulties in the selection of weighting functions of these approaches and the pole-zero cancellation phenomenon associated with it produces closed loop poles. Also the order of robust controllers is as high as the plant. This gives rise to complex structure of s...
متن کاملCombining Fact and Document Retrieval with Spreading Activation for Semantic Desktop Search
The Semantic Desktop is a means to support users in Personal Information Management (PIM). It provides an excellent test bed for Semantic Web technology: resources (e. g., persons, projects, messages, documents) are distributed amongst multiple systems, ontologies are used to link and annotate them. Finding information is a core element in PIM. For the end user, the search interface has to be i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008