Direction-Aware Proximity on Graphs
نویسندگان
چکیده
In many graph mining settings, measuring node proximity is a fundamental problem. While most of existing measurements are (implicitly or explicitly) designed for undirected graphs; edge directions in the graph provide a new perspective to proximity measurement: measuring the proximity from A to B; rather than between A and B. (See Figure 1 as an example). In this chapter, we study the role of edge direction in measuring proximity on graphs. To be specific, we will address the following fundamental research questions in the context of direction-aware proximity:
منابع مشابه
New bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملModelling Context-Aware Security for Electronic Health Records Using Contextual Graphs
The paper presents an approach to modelling security for electronic health records by using Contextual Graphs. Such graphs provide the context in which security policies should be used, i.e. such graphs function as meta-policies. We argue that such an approach has the advantages of modularity and ease of understanding, and supports fine-grained security determined by contexts such as location, ...
متن کاملCommonsense Notions of Proximity and Direction in Environmental Space
It is desirable that formal theories of qualitative reasoning should be informed by the ways in which humans conceptualize the spaces in which they live. The work described in this paper uses data provided in experiments with human subjects to derive some regularities in such conceptualizations. The data concerns human conceptualization of proximity and direction within a university campus. The...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملA Case for Lightweight SuperPeer Topologies
The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware class of Lightweight SuperPeer Topologies (LSTs). The proposed LST is based on the geometric principle of Yao-Graphs, a class of graphs allowing the development of simple and efficient broadcast algorithms. The pre-requisi...
متن کامل